activity
20052024
most citedParikh's Theorem: A simple and direct automaton construction

52 citations · 267 across the 47 of their papers we have counts for

collaborators
Showing 2017Show all

5 papers · 1 filter

eess.SY2017★ 1 cited

Quantitative Implementation Strategies for Safety Controllers

Philipp J. Meyer, Matthias Rungger, Michael Luttenberger +2

We consider the symbolic controller synthesis approach to enforce safety specifications on perturbed, nonlinear control systems. In general, in each state of the system several con…

cs.LO2017

Static Analysis of Deterministic Negotiations

Javier Esparza, Anca Muscholl, Igor Walukiewicz

Negotiation diagrams are a model of concurrent computation akin to workflow Petri nets. Deterministic negotiation diagrams, equivalent to the much studied and used free-choice work…

cs.FL2017★ 1 cited

Soundness in negotiations

Javier Esparza, Denis Kuperberg, Anca Muscholl +1

Negotiations are a formalism for describing multiparty distributed cooperation. Alternatively, they can be seen as a model of concurrency with synchronized choice as communication…

cs.LO2017★ 9 cited

Towards Efficient Verification of Population Protocols

Michael Blondin, Javier Esparza, Stefan Jaax +1

Population protocols are a well established model of computation by anonymous, identical finite state agents. A protocol is well-specified if from every initial configuration, all…

cs.LO2017★ 28 cited

From LTL and Limit-Deterministic Büchi Automata to Deterministic Parity Automata

Javier Esparza, Jan Křetínský, Jean-François Raskin +1

Controller synthesis for general linear temporal logic (LTL) objectives is a challenging task. The standard approach involves translating the LTL objective into a deterministic par…