32 citations · 149 across the 42 of their papers we have counts for
54 papers
Robust Alternating-Time Temporal Logic
Aniello Murano, Daniel Neider, Martin Zimmermann
In multi-agent system design, a crucial aspect is to ensure robustness, meaning that for a coalition of agents A, small violations of adversarial assumptions only lead to small vio…
Robust Probabilistic Temporal Logics
Martin Zimmermann
We robustify PCTL and PCTL*, the most important specification languages for probabilistic systems, and show that robustness does not increase the complexity of their model-checking…
On the Existence of Reactive Strategies Resilient to Delay
Martin Fränzle, Paul Kröger, Sarah Winter +1
We compare games under delayed control and delay games, two types of infinite games modelling asynchronicity in reactive synthesis. In games under delayed control both players suff…
HyperLTL Satisfiability Is Highly Undecidable, HyperCTL is Even Harder
Marie Fortin, Louwe B. Kuijer, Patrick Totzke +1
Temporal logics for the specification of information-flow properties are able to express relations between multiple executions of a system. The two most important such logics are H…
History-deterministic Parikh Automata
Enzo Erlich, Mario Grobler, Shibashis Guha +3
Parikh automata extend finite automata by counters that can be tested for membership in a semilinear set, but only at the end of a run. Thereby, they preserve many of the desirable…
Parikh Automata over Infinite Words
Shibashis Guha, Ismaël Jecker, Karoliina Lehtinen +1
Parikh automata extend finite automata by counters that can be tested for membership in a semilinear set, but only at the end of a run, thereby preserving many of the desirable alg…