activity
20102022
most citedAbsSynthe: abstract synthesis from succinct safety specifications

27 citations · 44 across the 5 of their papers we have counts for

collaborators

5 papers

cs.LO20224 cited

Zone-based verification of timed automata: extrapolations, simulations and what next?

Patricia Bouyer, Paul Gastin, Frédéric Herbreteau +2

Timed automata have been introduced by Rajeev Alur and David Dill in the early 90's. In the last decades, timed automata have become the de facto model for the verification of real…

cs.GT2022

Non-Blind Strategies in Timed Network Congestion Games

Aline Goeminne, Nicolas Markey, Ocan Sankur

Network congestion games are a convenient model for reasoning about routing problems in a network: agents have to move from a source to a target vertex while avoiding congestion, m…

cs.LO201613 cited

The 3rd Reactive Synthesis Competition (SYNTCOMP 2016): Benchmarks, Participants & Results

Swen Jacobs, Roderick Bloem, Romain Brenguier +13

We report on the benchmarks, participants and results of the third reactive synthesis competition(SYNTCOMP 2016). The benchmark library of SYNTCOMP 2016 has been extended to benchm…

cs.LO201427 cited

AbsSynthe: abstract synthesis from succinct safety specifications

Romain Brenguier, Guillermo A. Pérez, Jean-François Raskin +1

In this paper, we describe a synthesis algorithm for safety specifications described as circuits. Our algorithm is based on fixpoint computations, abstraction and refinement, it us…

cs.DS2010

Online Correlation Clustering

Claire Mathieu, Ocan Sankur, Warren Schudy

We study the online clustering problem where data items arrive in an online fashion. The algorithm maintains a clustering of data items into similarity classes. Upon arrival of v,…