Martin Zimmermann

According to our database, Martin Zimmermann authored at least 62 papers between 2009 and 2024.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of four.

2024

The complexity of evaluating nfer.

Sean Kauffman, Martin Zimmermann

Sci. Comput. Program., January, 2024

A Bit of Nondeterminism Makes Pushdown Automata Expressive and Succinct.

Shibashis Guha, Ismaël Jecker, Karoliina Lehtinen, Martin Zimmermann

Log. Methods Comput. Sci., 2024

2023

The Complexity of Second-order HyperLTL.

Martin Zimmermann

CoRR, 2023

Strategies Resilient to Delay: Games under Delayed Control vs. Delay Games.

Martin Fränzle, Sarah Winter, Martin Zimmermann

Proceedings of the Fourteenth International Symposium on Games, 2023

Robust Probabilistic Temporal Logics.

Martin Zimmermann

CoRR, 2023

Strategies Resilient to Delay: Games under Delayed Control vs. Delay Games (full version).

Martin Fränzle, Sarah Winter, Martin Zimmermann

CoRR, 2023

HyperLTL Satisfiability Is Highly Undecidable, HyperCTL* is Even Harder.

Marie Fortin, Louwe B. Kuijer, Patrick Totzke, Martin Zimmermann

CoRR, 2023

Robust Alternating-Time Temporal Logic.

Aniello Murano, Daniel Neider, Martin Zimmermann

Proceedings of the Logics in Artificial Intelligence - 18th European Conference, 2023

History-Deterministic Parikh Automata.

Enzo Erlich, Shibashis Guha, Ismaël Jecker, Karoliina Lehtinen, Martin Zimmermann

Proceedings of the 34th International Conference on Concurrency Theory, 2023

2022

Good-for-games ω-Pushdown Automata.

Karoliina Lehtinen, Martin Zimmermann

Log. Methods Comput. Sci., 2022

Approximating the minimal lookahead needed to win infinite games.

Martin Zimmermann

Inf. Process. Lett., 2022

Weak Muller Conditions Make Delay Games Hard.

Sarah Winter, Martin Zimmermann

CoRR, 2022

Robust Computation Tree Logic.

Satya Prakash Nayak, Daniel Neider, Rajarshi Roy, Martin Zimmermann

Proceedings of the NASA Formal Methods - 14th International Symposium, 2022

Robustness-by-Construction Synthesis: Adapting to the Environment at Runtime.

Satya Prakash Nayak, Daniel Neider, Martin Zimmermann

Proceedings of the Leveraging Applications of Formal Methods, Verification and Validation. Verification Principles, 2022

Parikh Automata over Infinite Words.

Shibashis Guha, Ismaël Jecker, Karoliina Lehtinen, Martin Zimmermann

Proceedings of the 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2022

Monitoring Timed Properties (Revisited).

Thomas Møller Grosen, Sean Kauffman, Kim Guldstrand Larsen, Martin Zimmermann

Proceedings of the Formal Modeling and Analysis of Timed Systems, 2022

2021

Preface.

Andrea Orlandini, Martin Zimmermann

Inf. Comput., 2021

From LTL to rLTL monitoring: improved monitorability through robust semantics.

Corto Mascle, Daniel Neider, Maximilian Schwenger, Paulo Tabuada, Alexander Weinert, Martin Zimmermann

Formal Methods Syst. Des., 2021

HyperLTL Satisfiability is Σ₁¹-complete, HyperCTL* Satisfiability is Σ₁²-complete.

Marie Fortin, Louwe B. Kuijer, Patrick Totzke, Martin Zimmermann

CoRR, 2021

HyperLTL Satisfiability Is Σ₁¹-Complete, HyperCTL* Satisfiability Is Σ₁²-Complete.

Marie Fortin, Louwe B. Kuijer, Patrick Totzke, Martin Zimmermann

Proceedings of the 46th International Symposium on Mathematical Foundations of Computer Science, 2021

Adaptive strategies for rLTL games.

Satya Prakash Nayak, Daniel Neider, Martin Zimmermann

Proceedings of the HSCC '21: 24th ACM International Conference on Hybrid Systems: Computation and Control, 2021

2020

Finite-state strategies in delay games.

Sarah Winter, Martin Zimmermann

Inf. Comput., 2020

Optimal Strategies in Weighted Limit Games.

Aniello Murano, Sasha Rubin, Martin Zimmermann

Proceedings of the Proceedings 11th International Symposium on Games, 2020

Optimal Strategies in Weighted Limit Games (full version).

Aniello Murano, Sasha Rubin, Martin Zimmermann

CoRR, 2020

Synthesizing optimally resilient controllers.

Daniel Neider, Alexander Weinert, Martin Zimmermann

Acta Informatica, 2020

Promptness and Bounded Fairness in Concurrent and Parameterized Systems.

Swen Jacobs, Mouhammad Sakr, Martin Zimmermann

Proceedings of the Verification, Model Checking, and Abstract Interpretation, 2020

Optimally Resilient Strategies in Pushdown Safety Games.

Daniel Neider, Patrick Totzke, Martin Zimmermann

Proceedings of the 45th International Symposium on Mathematical Foundations of Computer Science, 2020

The Keys to Decidable HyperLTL Satisfiability: Small Models or Very Simple Formulas.

Corto Mascle, Martin Zimmermann

Proceedings of the 28th EACSL Annual Conference on Computer Science Logic, 2020

2019

Parity Games with Weights.

Sven Schewe, Alexander Weinert, Martin Zimmermann

Log. Methods Comput. Sci., 2019

Robust, Expressive, and Quantitative Linear Temporal Logics: Pick any Two for Free.

Daniel Neider, Alexander Weinert, Martin Zimmermann

Proceedings of the Proceedings Tenth International Symposium on Games, 2019

2018

Visibly linear dynamic logic.

Alexander Weinert, Martin Zimmermann

Theor. Comput. Sci., 2018

Distributed synthesis for parameterized temporal logics.

Swen Jacobs, Leander Tentrup, Martin Zimmermann

Inf. Comput., 2018

Parameterized linear temporal logics meet costs: still not costlier than LTL.

Martin Zimmermann

Acta Informatica, 2018

The complexity of counting models of linear-time temporal logic.

Hazem Torfah, Martin Zimmermann

Acta Informatica, 2018

Team Semantics for the Specification and Verification of Hyperproperties.

Andreas Krebs, Arne Meier, Jonni Virtema, Martin Zimmermann

Proceedings of the 43rd International Symposium on Mathematical Foundations of Computer Science, 2018

Parity to Safety in Polynomial Time for Pushdown and Collapsible Pushdown Systems.

Matthew Hague, Roland Meyer, Sebastian Muskalla, Martin Zimmermann

Proceedings of the 43rd International Symposium on Mathematical Foundations of Computer Science, 2018

2017

Easy to Win, Hard to Master: Optimal Strategies in Parity Games with Costs.

Alexander Weinert, Martin Zimmermann

Log. Methods Comput. Sci., 2017

Finite-state Strategies in Delay Games.

Martin Zimmermann

Proceedings of the Proceedings Eighth International Symposium on Games, 2017

The First-Order Logic of Hyperproperties.

Bernd Finkbeiner, Martin Zimmermann

Proceedings of the 34th Symposium on Theoretical Aspects of Computer Science, 2017

Games with costs and delays.

Martin Zimmermann

Proceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, 2017

Bounding Average-Energy Games.

Patricia Bouyer, Piotr Hofman, Nicolas Markey, Mickael Randour, Martin Zimmermann

Proceedings of the Foundations of Software Science and Computation Structures, 2017

2016

Delay Games with WMSO+U Winning Conditions.

Martin Zimmermann

RAIRO Theor. Informatics Appl., 2016

Approximating Optimal Bounds in Prompt-LTL Realizability in Doubly-exponential Time

Leander Tentrup, Alexander Weinert, Martin Zimmermann

Proceedings of the Seventh International Symposium on Games, 2016

Limit Your Consumption! Finding Bounds in Average-energy Games.

Kim G. Larsen, Simon Laursen, Martin Zimmermann

Proceedings of the Proceedings 14th International Workshop Quantitative Aspects of Programming Languages and Systems, 2016

How Much Lookahead is Needed to Win Infinite Games?

Felix Klein, Martin Zimmermann

Log. Methods Comput. Sci., 2016

Distributed PROMPT-LTL Synthesis.

Swen Jacobs, Leander Tentrup, Martin Zimmermann

Proceedings of the Seventh International Symposium on Games, 2016

Prompt Delay.

Felix Klein, Martin Zimmermann

Proceedings of the 36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2016

2015

Optimal strategy synthesis for request-response games.

Florian Horn, Wolfgang Thomas, Nico Wallmeier, Martin Zimmermann

RAIRO Theor. Informatics Appl., 2015

Unbounded Lookahead in WMSO+U Games.

Martin Zimmermann

CoRR, 2015

Parameterized Linear Temporal Logics Meet Costs: Still not Costlier than LTL (full version).

Martin Zimmermann

CoRR, 2015

Parametric Linear Dynamic Logic (full version).

Peter Faymonville, Martin Zimmermann

CoRR, 2015

What are Strategies in Delay Games? Borel Determinacy for Games with Lookahead.

Felix Klein, Martin Zimmermann

Proceedings of the 24th EACSL Annual Conference on Computer Science Logic, 2015

2014

Down the Borel hierarchy: Solving Muller games via safety games.

Daniel Neider, Roman Rabinovich, Martin Zimmermann

Theor. Comput. Sci., 2014

Parity and Streett Games with Costs

Nathanaël Fijalkow, Martin Zimmermann

Log. Methods Comput. Sci., 2014

Parametric Linear Dynamic Logic.

Peter Faymonville, Martin Zimmermann

Proceedings of the Proceedings Fifth International Symposium on Games, 2014

2013

Optimal bounds in parametric LTL games.

Martin Zimmermann

Theor. Comput. Sci., 2013

2012

Solving infinite games with bounds.

Martin Zimmermann

PhD thesis, 2012

Playing Pushdown Parity Games in a Hurry

Wladimir Fridman, Martin Zimmermann

Proceedings of the Proceedings Third International Symposium on Games, 2012

Cost-Parity and Cost-Streett Games.

Nathanaël Fijalkow, Martin Zimmermann

Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2012

2011

Degrees of Lookahead in Context-free Infinite Games.

Wladimir Fridman, Christof Löding, Martin Zimmermann

Proceedings of the Computer Science Logic, 2011

2010

Playing Muller Games in a Hurry

John Fearnley, Martin Zimmermann

Proceedings of the Proceedings First Symposium on Games, 2010

2009

Time-Optimal Winning Strategies for Poset Games.

Martin Zimmermann

Proceedings of the Implementation and Application of Automata, 2009