output
20032024
most citedDemystifying Reachability in Vector Addition Systems

88 citations

Showing 2013Show all

15 papers · 1 filter

cs.GL2013

Les connaissances de la toile

Serge Abiteboul

How to manage knowledge on the Web.

cs.FL2013★ 5 cited

Finite-type-Dyck shift spaces

Marie-Pierre Béal, Michel Blockelet, Cǎtǎlin Dima

We study some basic properties of sofic-Dyck shifts and finite-type-Dyck shifts. We prove that the class of sofic-Dyck shifts is stable under proper conjugacies. We prove a Decompo…

cs.GT2013★ 2 cited

Doomsday Equilibria for Omega-Regular Games

Krishnendu Chatterjee, Laurent Doyen, Emmanuel Filiot +1

Two-player games on graphs provide the theoretical frame- work for many important problems such as reactive synthesis. While the traditional study of two-player zero-sum games has…

cs.FL2013★ 9 cited

Avoiding Shared Clocks in Networks of Timed Automata

Sandie Balaguer, Thomas Chatain

Networks of timed automata (NTA) are widely used to model distributed real-time systems. Quite often in the literature, the automata are allowed to share clocks, i.e. transitions o…

cs.GT2013★ 2 cited

Limit Synchronization in Markov Decision Processes

Laurent Doyen, Thierry Massart, Mahsa Shirmohammadi

Markov decision processes (MDP) are finite-state systems with both strategic and probabilistic choices. After fixing a strategy, an MDP produces a sequence of probability distribut…

cs.LO2013★ 3 cited

Reachability under Contextual Locking

Remi Bonnet, Rohit Chadha, Mahesh Viswanathan +1

The pairwise reachability problem for a multi-threaded program asks, given control locations in two threads, whether they can be simultaneously reached in an execution of the progr…