Martin Zimmermann

ORCID

Publication Activity (10 Years)

Years Active: 2009-2024
Publications (10 Years): 85

Top Venues

CoRR

GandALF

Log. Methods Comput. Sci.

MFCS

RWTH Aachen University (PHD)

Education History

RWTH Aachen University

PHD

Publications

Shibashis Guha, Ismaël Jecker, Karoliina Lehtinen, Martin Zimmermann
A Bit of Nondeterminism Makes Pushdown Automata Expressive and Succinct. Log. Methods Comput. Sci. 20 (1) (2024)
Sean Kauffman, Kim Guldstrand Larsen, Martin Zimmermann
The Complexity of Data-Free Nfer. CoRR (2024)
Martin Fränzle, Thomas Møller Grosen, Kim G. Larsen, Martin Zimmermann
Monitoring Real-Time Systems under Parametric Delay. CoRR (2024)
Sarah Winter, Martin Zimmermann
Tracy, Traces, and Transducers: Computable Counterexamples and Explanations for HyperLTL Model-Checking. CoRR (2024)
Christian Schilling, Martin Zimmermann
The Reachability Problem for Neural-Network Control Systems. CoRR (2024)
Sean Kauffman, Martin Zimmermann
The complexity of evaluating nfer. Sci. Comput. Program. 231 (2024)
Marie Fortin, Louwe B. Kuijer, Patrick Totzke, Martin Zimmermann
HyperLTL Satisfiability Is Highly Undecidable, HyperCTL* is Even Harder. CoRR (2023)
Martin Fränzle, Sarah Winter, Martin Zimmermann
Strategies Resilient to Delay: Games under Delayed Control vs. Delay Games. GandALF (2023)
Enzo Erlich, Shibashis Guha, Ismaël Jecker, Karoliina Lehtinen, Martin Zimmermann
History-Deterministic Parikh Automata. CONCUR (2023)
Martin Fränzle, Sarah Winter, Martin Zimmermann
Strategies Resilient to Delay: Games under Delayed Control vs. Delay Games. CoRR (2023)
Aniello Murano, Daniel Neider, Martin Zimmermann
Robust Alternating-Time Temporal Logic. JELIA (2023)
Aniello Murano, Daniel Neider, Martin Zimmermann
Robust Alternating-Time Temporal Logic. CoRR (2023)
Shibashis Guha, Ismaël Jecker, Karoliina Lehtinen, Martin Zimmermann
Parikh Automata over Infinite Words. CoRR (2022)
Thomas Møller Grosen, Sean Kauffman, Kim Guldstrand Larsen, Martin Zimmermann
Monitoring Timed Properties (Revisited). FORMATS (2022)
Enzo Erlich, Shibashis Guha, Ismaël Jecker, Karoliina Lehtinen, Martin Zimmermann
History-deterministic Parikh Automata. CoRR (2022)
Satya Prakash Nayak, Daniel Neider, Rajarshi Roy, Martin Zimmermann
Robust Computation Tree Logic. NFM (2022)
Sean Kauffman, Martin Zimmermann
The Complexity of Evaluating nfer. CoRR (2022)
Thomas Møller Grosen, Sean Kauffman, Kim Guldstrand Larsen, Martin Zimmermann
Monitoring Timed Properties (Revisited). CoRR (2022)
Sarah Winter, Martin Zimmermann
Weak Muller Conditions Make Delay Games Hard. CoRR (2022)
Satya Prakash Nayak, Daniel Neider, Martin Zimmermann
Robustness-by-Construction Synthesis: Adapting to the Environment at Runtime. ISoLA (1) (2022)
Martin Zimmermann
Approximating the minimal lookahead needed to win infinite games. Inf. Process. Lett. 177 (2022)
Sean Kauffman, Martin Zimmermann
The Complexity of Evaluating Nfer. TASE (2022)
Satya Prakash Nayak, Daniel Neider, Rajarshi Roy, Martin Zimmermann
Robust Computation Tree Logic. CoRR (2022)
Satya Prakash Nayak, Daniel Neider, Martin Zimmermann
Robustness-by-Construction Synthesis: Adapting to the Environment at Runtime. CoRR (2022)
Karoliina Lehtinen, Martin Zimmermann
Good-for-games ω-Pushdown Automata. Log. Methods Comput. Sci. 18 (1) (2022)
Shibashis Guha, Ismaël Jecker, Karoliina Lehtinen, Martin Zimmermann
Parikh Automata over Infinite Words. FSTTCS (2022)
Daniel Neider, Alexander Weinert, Martin Zimmermann
Robust, expressive, and quantitative linear temporal logics: Pick any two for free. Inf. Comput. 285 (Part) (2022)
Shibashis Guha, Ismaël Jecker, Karoliina Lehtinen, Martin Zimmermann
A Bit of Nondeterminism Makes Pushdown Automata Expressive and Succinct. MFCS (2021)
Andrea Orlandini, Martin Zimmermann
Preface. Inf. Comput. 278 (2021)
Marie Fortin, Louwe B. Kuijer, Patrick Totzke, Martin Zimmermann
-complete. CoRR (2021)
Marie Fortin, Louwe B. Kuijer, Patrick Totzke, Martin Zimmermann
HyperLTL Satisfiability Is Σ₁¹-Complete, HyperCTL* Satisfiability Is Σ₁²-Complete. MFCS (2021)
Shibashis Guha, Ismaël Jecker, Karoliina Lehtinen, Martin Zimmermann
A Bit of Nondeterminism Makes Pushdown Automata Expressive and Succinct. CoRR (2021)
Satya Prakash Nayak, Daniel Neider, Martin Zimmermann
Adaptive strategies for rLTL games. HSCC (2021)
Corto Mascle, Daniel Neider, Maximilian Schwenger, Paulo Tabuada, Alexander Weinert, Martin Zimmermann
From LTL to rLTL monitoring: improved monitorability through robust semantics. Formal Methods Syst. Des. 59 (1) (2021)
Karoliina Lehtinen, Martin Zimmermann
Good-for-games ω-Pushdown Automata. LICS (2020)
Karoliina Lehtinen, Martin Zimmermann
Good-for-games ω-Pushdown Automata. CoRR (2020)
Sarah Winter, Martin Zimmermann
Finite-state strategies in delay games. Inf. Comput. 272 (2020)
Corto Mascle, Martin Zimmermann
The Keys to Decidable HyperLTL Satisfiability: Small Models or Very Simple Formulas. CSL (2020)
Daniel Neider, Alexander Weinert, Martin Zimmermann
Synthesizing optimally resilient controllers. Acta Informatica 57 (1-2) (2020)
Martin Zimmermann
Approximating the Minimal Lookahead Needed to Win Infinite Games. CoRR (2020)
Daniel Neider, Patrick Totzke, Martin Zimmermann
Optimally Resilient Strategies in Pushdown Safety Games. MFCS (2020)
Aniello Murano, Sasha Rubin, Martin Zimmermann
Optimal Strategies in Weighted Limit Games (full version). CoRR (2020)
Corto Mascle, Daniel Neider, Maximilian Schwenger, Paulo Tabuada, Alexander Weinert, Martin Zimmermann
From LTL to rLTL monitoring: improved monitorability through robust semantics. HSCC (2020)
Swen Jacobs, Mouhammad Sakr, Martin Zimmermann
Promptness and Bounded Fairness in Concurrent and Parameterized Systems. VMCAI (2020)
Aniello Murano, Sasha Rubin, Martin Zimmermann
Optimal Strategies in Weighted Limit Games. GandALF (2020)
Swen Jacobs, Mouhammad Sakr, Martin Zimmermann
Promptness and Bounded Fairness in Concurrent and Parameterized Systems. CoRR (2019)
Sven Schewe, Alexander Weinert, Martin Zimmermann
Parity Games with Weights. Log. Methods Comput. Sci. 15 (3) (2019)
Daniel Neider, Alexander Weinert, Martin Zimmermann
Robust, Expressive, and Quantitative Linear Temporal Logics: Pick any Two for Free. GandALF (2019)
Daniel Neider, Patrick Totzke, Martin Zimmermann
Optimally Resilient Strategies in Pushdown Safety Games. CoRR (2019)
Corto Mascle, Martin Zimmermann
The Keys to Decidable HyperLTL Satisfiability: Small Models or Very Simple Formulas. CoRR (2019)
Matthew Hague, Roland Meyer, Sebastian Muskalla, Martin Zimmermann
Parity to Safety in Polynomial Time for Pushdown and Collapsible Pushdown Systems. CoRR (2018)
Sven Schewe, Alexander Weinert, Martin Zimmermann
Parity Games with Weights. CoRR (2018)
Swen Jacobs, Leander Tentrup, Martin Zimmermann
Distributed synthesis for parameterized temporal logics. Inf. Comput. 262 (2018)
Martin Zimmermann
Parameterized linear temporal logics meet costs: still not costlier than LTL. Acta Informatica 55 (2) (2018)
Daniel Neider, Alexander Weinert, Martin Zimmermann
Robust, Expressive, and Quantitative Linear Temporal Logics: Pick any Two for Free. CoRR (2018)
Sven Schewe, Alexander Weinert, Martin Zimmermann
Parity Games with Weights. CSL (2018)
Matthew Hague, Roland Meyer, Sebastian Muskalla, Martin Zimmermann
Parity to Safety in Polynomial Time for Pushdown and Collapsible Pushdown Systems. MFCS (2018)
Hazem Torfah, Martin Zimmermann
The complexity of counting models of linear-time temporal logic. Acta Informatica 55 (3) (2018)
Daniel Neider, Alexander Weinert, Martin Zimmermann
Synthesizing Optimally Resilient Controllers. CSL (2018)
Corto Mascle, Daniel Neider, Maximilian Schwenger, Paulo Tabuada, Alexander Weinert, Martin Zimmermann
From LTL to rLTL Monitoring: Improved Monitorability through Robust Semantics. CoRR (2018)
Alexander Weinert, Martin Zimmermann
Visibly linear dynamic logic. Theor. Comput. Sci. 747 (2018)
Andreas Krebs, Arne Meier, Jonni Virtema, Martin Zimmermann
Team Semantics for the Specification and Verification of Hyperproperties. MFCS (2018)
Sarah Winter, Martin Zimmermann
Finite-state Strategies in Delay Games. CoRR (2017)
Swen Jacobs, Leander Tentrup, Martin Zimmermann
Distributed Synthesis for Parameterized Temporal Logics. CoRR (2017)
Alexander Weinert, Martin Zimmermann
Easy to Win, Hard to Master: Optimal Strategies in Parity Games with Costs. Log. Methods Comput. Sci. 13 (3) (2017)
Bernd Finkbeiner, Martin Zimmermann
The First-Order Logic of Hyperproperties. STACS (2017)
Peter Faymonville, Martin Zimmermann
Parametric Linear Dynamic Logic. Inf. Comput. 253 (2017)
Martin Zimmermann
Games with Costs and Delays. CoRR (2017)
Martin Zimmermann
Finite-state Strategies in Delay Games. GandALF (2017)
Martin Zimmermann
Games with costs and delays. LICS (2017)
Daniel Neider, Alexander Weinert, Martin Zimmermann
Synthesizing Optimally Resilient Controllers. CoRR (2017)
Patricia Bouyer, Piotr Hofman, Nicolas Markey, Mickael Randour, Martin Zimmermann
Bounding Average-Energy Games. FoSSaCS (2017)
Andreas Krebs, Arne Meier, Jonni Virtema, Martin Zimmermann
Team Semantics for the Specification and Verification of Hyperproperties. CoRR (2017)
Bernd Finkbeiner, Martin Zimmermann
The First-Order Logic of Hyperproperties. CoRR (2016)
Alexander Weinert, Martin Zimmermann
Easy to Win, Hard to Master: Optimal Strategies in Parity Games with Costs. CoRR (2016)
Felix Klein, Martin Zimmermann
Prompt Delay. FSTTCS (2016)
Alexander Weinert, Martin Zimmermann
Visibly Linear Dynamic Logic. FSTTCS (2016)
Felix Klein, Martin Zimmermann
Prompt Delay. CoRR (2016)
Alexander Weinert, Martin Zimmermann
Easy to Win, Hard to Master: Optimal Strategies in Parity Games with Costs. CSL (2016)
Leander Tentrup, Alexander Weinert, Martin Zimmermann
Approximating Optimal Bounds in Prompt-LTL Realizability in Doubly-exponential Time GandALF (2016)
Martin Zimmermann
Delay Games with WMSO+U Winning Conditions. RAIRO Theor. Informatics Appl. 50 (2) (2016)
Felix Klein, Martin Zimmermann
How Much Lookahead is Needed to Win Infinite Games? Log. Methods Comput. Sci. 12 (3) (2016)
Kim G. Larsen, Simon Laursen, Martin Zimmermann
Limit Your Consumption! Finding Bounds in Average-energy Games. QAPL (2016)
Swen Jacobs, Leander Tentrup, Martin Zimmermann
Distributed PROMPT-LTL Synthesis. GandALF (2016)
Patricia Bouyer, Piotr Hofman, Nicolas Markey, Mickael Randour, Martin Zimmermann
Bounding Average-energy Games. CoRR (2016)
Felix Klein, Martin Zimmermann
What are Strategies in Delay Games? Borel Determinacy for Games with Lookahead. CSL (2015)
Felix Klein, Martin Zimmermann
How Much Lookahead is Needed to Win Infinite Games? ICALP (2) (2015)
Martin Zimmermann
Parameterized Linear Temporal Logics Meet Costs: Still not Costlier than LTL (full version). CoRR (2015)
Alexander Weinert, Martin Zimmermann
Visibly Linear Dynamic Logic. CoRR (2015)
Felix Klein, Martin Zimmermann
What are Strategies in Delay Games? Borel Determinacy for Games with Lookahead. CoRR (2015)
Florian Horn, Wolfgang Thomas, Nico Wallmeier, Martin Zimmermann
Optimal strategy synthesis for request-response games. RAIRO Theor. Informatics Appl. 49 (3) (2015)
Martin Zimmermann
Delay Games with WMSO+U Winning Conditions. CSR (2015)
Peter Faymonville, Martin Zimmermann
Parametric Linear Dynamic Logic (full version). CoRR (2015)
Martin Zimmermann
Unbounded Lookahead in WMSO+U Games. CoRR (2015)
Martin Zimmermann
Parameterized Linear Temporal Logics Meet Costs: Still not Costlier than LTL. GandALF (2015)
Nathanaël Fijalkow, Martin Zimmermann
Parity and Streett Games with Costs Log. Methods Comput. Sci. 10 (2) (2014)
Daniel Neider, Roman Rabinovich, Martin Zimmermann
Down the Borel hierarchy: Solving Muller games via safety games. Theor. Comput. Sci. 560 (2014)
Peter Faymonville, Martin Zimmermann
Parametric Linear Dynamic Logic. GandALF (2014)
Hazem Torfah, Martin Zimmermann
The Complexity of Counting Models of Linear-time Temporal Logic. FSTTCS (2014)
Martin Zimmermann
Delay Games with WMSO+U Winning Conditions. CoRR (2014)

Martin Zimmermann.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Martin Zimmermann