32 citations · 149 across the 42 of their papers we have counts for
29 papers · 1 filter
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…
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…
Robustness-by-Construction Synthesis: Adapting to the Environment at Runtime
Satya Prakash Nayak, Daniel Neider, Martin Zimmermann
While most of the current synthesis algorithms only focus on correctness-by-construction, ensuring robustness has remained a challenge. Hence, in this paper, we address the robust-…
The Complexity of Evaluating nfer
Sean Kauffman, Martin Zimmermann
Nfer is a rule-based language for abstracting event streams into a hierarchy of intervals with data. Nfer has multiple implementations and has been applied in the analysis of space…
Robust Computation Tree Logic
Satya Prakash Nayak, Daniel Neider, Rajarshi Roy +1
It is widely accepted that every system should be robust in that ``small'' violations of environment assumptions should lead to ``small'' violations of system guarantees, but it is…