Martin Zimmermann

141 papers A* 2A 1B 22C 1Misc 2Journal 85Unranked 26

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	The Complexity of Second-order HyperLTL. Log. Methods Comput. Sci. Hadar Frenkel, Gaëtan Regaud, Martin Zimmermann
2026	J	`jnl`	The complexity of HyperQPTL. Inf. Process. Lett. Gaëtan Regaud, Martin Zimmermann
2025	J	`jnl`	History-Deterministic Parikh Automata. ACM Trans. Comput. Log. Enzo Erlich, Mario Grobler, Shibashis Guha, Ismaël Jecker, Karoliina Lehtinen, Martin Zimmermann
2025	J	`jnl`	HyperLTL Satisfiability Is Highly Undecidable, HyperCTL$^* is Even Harder. Log. Methods Comput. Sci. Marie Fortin, Louwe B. Kuijer, Patrick Totzke, Martin Zimmermann
2025	J	`jnl`	On the Existence of Reactive Strategies Resilient to Delay. Log. Methods Comput. Sci. Martin Fränzle, Paul Kröger, Sarah Winter, Martin Zimmermann
2025	B	`conf`	Prophecies All the Way: Game-Based Model-Checking for HyperQPTL Beyond ∀∃. CONCUR Sarah Winter, Martin Zimmermann
2025	J	`jnl`	Prophecies all the Way: Game-based Model-Checking for HyperQPTL beyond ∀ CoRR Sarah Winter, Martin Zimmermann
2025	J	`jnl`	Robust computation tree logic. Innov. Syst. Softw. Eng. Satya Prakash Nayak, Daniel Neider, Rajarshi Roy, Martin Zimmermann
2025	J	`jnl`	Robust probabilistic temporal logics. Inf. Process. Lett. Martin Zimmermann
2025	B	`conf`	TAPAAL HyperLTL: A Tool for Checking Hyperproperties of Petri Nets. ATVA Bruno Maria René Gonzalez, Peter Gjøl Jensen, Stefan Schmid, Jirí Srba, Martin Zimmermann
2025	J	`jnl`	TAPAAL HyperLTL: A Tool for Checking Hyperproperties of Petri Nets. CoRR Bruno Maria René Gonzalez, Peter Gjøl Jensen, Stefan Schmid, Jirí Srba, Martin Zimmermann
2025	J	`jnl`	The Complexity of Fragments of Second-Order HyperLTL. CoRR Gaëtan Regaud, Martin Zimmermann
2025	J	`jnl`	The Complexity of Generalized HyperLTL with Stuttering and Contexts. CoRR Gaëtan Regaud, Martin Zimmermann
2025	—	`conf`	The Complexity of Generalized HyperLTL with Stuttering and Contexts. GandALF Gaëtan Regaud, Martin Zimmermann
2025	B	`conf`	The Complexity of Second-Order HyperLTL. CSL Hadar Frenkel, Martin Zimmermann
2025	B	`conf`	Time for Timed Monitorability. CONCUR Thomas Møller Grosen, Sean Kauffman, Kim G. Larsen, Martin Zimmermann
2025	J	`jnl`	Time for Timed Monitorability. CoRR Thomas Møller Grosen, Sean Kauffman, Kim G. Larsen, Martin Zimmermann
2025	J	`jnl`	Tracy, traces, and transducers: computable counterexamples and explanations for HyperLTL model-checking. Acta Informatica Sarah Winter, Martin Zimmermann
2025	J	`jnl`	You May Delay, but Time Will Not: Timed Games Under Delayed Control. CoRR Kim G. Larsen, Martin Zimmermann
2024	J	`jnl`	A Bit of Nondeterminism Makes Pushdown Automata Expressive and Succinct. Log. Methods Comput. Sci. Shibashis Guha, Ismaël Jecker, Karoliina Lehtinen, Martin Zimmermann
2024	B	`conf`	Exploiting Assumptions for Effective Monitoring of Real-Time Properties Under Partial Observability. SEFM Alessandro Cimatti, Thomas Møller Grosen, Kim G. Larsen, Stefano Tonetta, Martin Zimmermann
2024	J	`jnl`	Exploiting Assumptions for Effective Monitoring of Real-Time Properties under Partial Observability. CoRR Alessandro Cimatti, Thomas Møller Grosen, Kim G. Larsen, Stefano Tonetta, Martin Zimmermann
2024	B	`conf`	Monitoring Real-Time Systems Under Parametric Delay. IFM Martin Fränzle, Thomas Møller Grosen, Kim G. Larsen, Martin Zimmermann
2024	J	`jnl`	Monitoring Real-Time Systems under Parametric Delay. CoRR Martin Fränzle, Thomas Møller Grosen, Kim G. Larsen, Martin Zimmermann
2024	J	`jnl`	Synchronous Team Semantics for Temporal Logics. CoRR Andreas Krebs, Arne Meier, Jonni Virtema, Martin Zimmermann
2024	B	`conf`	The Complexity of Data-Free Nfer. RV Sean Kauffman, Kim Guldstrand Larsen, Martin Zimmermann
2024	J	`jnl`	The Complexity of Data-Free Nfer. CoRR Sean Kauffman, Kim Guldstrand Larsen, Martin Zimmermann
2024	J	`jnl`	The Complexity of HyperQPTL. CoRR Gaëtan Regaud, Martin Zimmermann
2024	J	`jnl`	The Reachability Problem for Neural-Network Control Systems. CoRR Christian Schilling, Martin Zimmermann
2024	J	`jnl`	The complexity of evaluating nfer. Sci. Comput. Program. Sean Kauffman, Martin Zimmermann
2024	J	`jnl`	Tracy, Traces, and Transducers: Computable Counterexamples and Explanations for HyperLTL Model-Checking. CoRR Sarah Winter, Martin Zimmermann
2023	B	`conf`	History-Deterministic Parikh Automata. CONCUR Enzo Erlich, Shibashis Guha, Ismaël Jecker, Karoliina Lehtinen, Martin Zimmermann
2023	J	`jnl`	HyperLTL Satisfiability Is Highly Undecidable, HyperCTL* is Even Harder. CoRR Marie Fortin, Louwe B. Kuijer, Patrick Totzke, Martin Zimmermann
2023	J	`jnl`	On the Existence of Reactive Strategies Resilient to Delay. CoRR Martin Fränzle, Paul Kröger, Sarah Winter, Martin Zimmermann
2023	B	`conf`	Robust Alternating-Time Temporal Logic. JELIA Aniello Murano, Daniel Neider, Martin Zimmermann
2023	J	`jnl`	Robust Alternating-Time Temporal Logic. CoRR Aniello Murano, Daniel Neider, Martin Zimmermann
2023	J	`jnl`	Robust Probabilistic Temporal Logics. CoRR Martin Zimmermann
2023	—	`conf`	Strategies Resilient to Delay: Games under Delayed Control vs. Delay Games. GandALF Martin Fränzle, Sarah Winter, Martin Zimmermann
2023	J	`jnl`	The Complexity of Second-order HyperLTL. CoRR Hadar Frenkel, Gaëtan Regaud, Martin Zimmermann
2023	—	`conf`	The Reachability Problem for Neural-Network Control Systems. AISoLA (Selected Papers) Christian Schilling, Martin Zimmermann
2022	J	`jnl`	Approximating the minimal lookahead needed to win infinite games. Inf. Process. Lett. Martin Zimmermann
2022	J	`jnl`	Good-for-games ω-Pushdown Automata. Log. Methods Comput. Sci. Karoliina Lehtinen, Martin Zimmermann
2022	J	`jnl`	History-deterministic Parikh Automata. CoRR Enzo Erlich, Mario Grobler, Shibashis Guha, Ismaël Jecker, Karoliina Lehtinen, Martin Zimmermann
2022	—	`conf`	Monitoring Timed Properties (Revisited). FORMATS Thomas Møller Grosen, Sean Kauffman, Kim Guldstrand Larsen, Martin Zimmermann
2022	J	`jnl`	Monitoring Timed Properties (Revisited). CoRR Thomas Møller Grosen, Sean Kauffman, Kim Guldstrand Larsen, Martin Zimmermann
2022	—	`conf`	Parikh Automata over Infinite Words. FSTTCS Shibashis Guha, Ismaël Jecker, Karoliina Lehtinen, Martin Zimmermann
2022	J	`jnl`	Parikh Automata over Infinite Words. CoRR Shibashis Guha, Ismaël Jecker, Karoliina Lehtinen, Martin Zimmermann
2022	—	`conf`	Robust Computation Tree Logic. NFM Satya Prakash Nayak, Daniel Neider, Rajarshi Roy, Martin Zimmermann
2022	J	`jnl`	Robust Computation Tree Logic. CoRR Satya Prakash Nayak, Daniel Neider, Rajarshi Roy, Martin Zimmermann
2022	J	`jnl`	Robust, expressive, and quantitative linear temporal logics: Pick any two for free. Inf. Comput. Daniel Neider, Alexander Weinert, Martin Zimmermann
2022	—	`conf`	Robustness-by-Construction Synthesis: Adapting to the Environment at Runtime. ISoLA (1) Satya Prakash Nayak, Daniel Neider, Martin Zimmermann
2022	J	`jnl`	Robustness-by-Construction Synthesis: Adapting to the Environment at Runtime. CoRR Satya Prakash Nayak, Daniel Neider, Martin Zimmermann
2022	Misc	`conf`	The Complexity of Evaluating Nfer. TASE Sean Kauffman, Martin Zimmermann
2022	J	`jnl`	The Complexity of Evaluating nfer. CoRR Sean Kauffman, Martin Zimmermann
2022	J	`jnl`	Weak Muller Conditions Make Delay Games Hard. CoRR Sarah Winter, Martin Zimmermann
2021	B	`conf`	A Bit of Nondeterminism Makes Pushdown Automata Expressive and Succinct. MFCS Shibashis Guha, Ismaël Jecker, Karoliina Lehtinen, Martin Zimmermann
2021	J	`jnl`	A Bit of Nondeterminism Makes Pushdown Automata Expressive and Succinct. CoRR Shibashis Guha, Ismaël Jecker, Karoliina Lehtinen, Martin Zimmermann
2021	—	`conf`	Adaptive strategies for rLTL games. HSCC Satya Prakash Nayak, Daniel Neider, Martin Zimmermann
2021	J	`jnl`	From LTL to rLTL monitoring: improved monitorability through robust semantics. Formal Methods Syst. Des. Corto Mascle, Daniel Neider, Maximilian Schwenger, Paulo Tabuada, Alexander Weinert, Martin Zimmermann
2021	B	`conf`	HyperLTL Satisfiability Is Σ₁¹-Complete, HyperCTL* Satisfiability Is Σ₁²-Complete. MFCS Marie Fortin, Louwe B. Kuijer, Patrick Totzke, Martin Zimmermann
2021	J	`jnl`	HyperLTL Satisfiability is Σ CoRR Marie Fortin, Louwe B. Kuijer, Patrick Totzke, Martin Zimmermann
2021	J	`jnl`	Preface. Inf. Comput. Andrea Orlandini, Martin Zimmermann
2020	J	`jnl`	Approximating the Minimal Lookahead Needed to Win Infinite Games. CoRR Martin Zimmermann
2020	J	`jnl`	Finite-state strategies in delay games. Inf. Comput. Sarah Winter, Martin Zimmermann
2020	—	`conf`	From LTL to rLTL monitoring: improved monitorability through robust semantics. HSCC Corto Mascle, Daniel Neider, Maximilian Schwenger, Paulo Tabuada, Alexander Weinert, Martin Zimmermann
2020	A*	`conf`	Good-for-games ω-Pushdown Automata. LICS Karoliina Lehtinen, Martin Zimmermann
2020	J	`jnl`	Good-for-games ω-Pushdown Automata. CoRR Karoliina Lehtinen, Martin Zimmermann
2020	J	`jnl`	Optimal Strategies in Weighted Limit Games (full version). CoRR Aniello Murano, Sasha Rubin, Martin Zimmermann
2020	—	`conf`	Optimal Strategies in Weighted Limit Games. GandALF Aniello Murano, Sasha Rubin, Martin Zimmermann
2020	B	`conf`	Optimally Resilient Strategies in Pushdown Safety Games. MFCS Daniel Neider, Patrick Totzke, Martin Zimmermann
2020	B	`conf`	Promptness and Bounded Fairness in Concurrent and Parameterized Systems. VMCAI Swen Jacobs, Mouhammad Sakr, Martin Zimmermann
2020	J	`jnl`	Synthesizing optimally resilient controllers. Acta Informatica Daniel Neider, Alexander Weinert, Martin Zimmermann
2020	B	`conf`	The Keys to Decidable HyperLTL Satisfiability: Small Models or Very Simple Formulas. CSL Corto Mascle, Martin Zimmermann
2019	J	`jnl`	Optimally Resilient Strategies in Pushdown Safety Games. CoRR Daniel Neider, Patrick Totzke, Martin Zimmermann
2019	J	`jnl`	Parity Games with Weights. Log. Methods Comput. Sci. Sven Schewe, Alexander Weinert, Martin Zimmermann
2019	J	`jnl`	Promptness and Bounded Fairness in Concurrent and Parameterized Systems. CoRR Swen Jacobs, Mouhammad Sakr, Martin Zimmermann
2019	—	`conf`	Robust, Expressive, and Quantitative Linear Temporal Logics: Pick any Two for Free. GandALF Daniel Neider, Alexander Weinert, Martin Zimmermann
2019	J	`jnl`	The Keys to Decidable HyperLTL Satisfiability: Small Models or Very Simple Formulas. CoRR Corto Mascle, Martin Zimmermann
2018	J	`jnl`	Distributed synthesis for parameterized temporal logics. Inf. Comput. Swen Jacobs, Leander Tentrup, Martin Zimmermann
2018	J	`jnl`	From LTL to rLTL Monitoring: Improved Monitorability through Robust Semantics. CoRR Corto Mascle, Daniel Neider, Maximilian Schwenger, Paulo Tabuada, Alexander Weinert, Martin Zimmermann
2018	J	`jnl`	Parameterized linear temporal logics meet costs: still not costlier than LTL. Acta Informatica Martin Zimmermann
2018	B	`conf`	Parity Games with Weights. CSL Sven Schewe, Alexander Weinert, Martin Zimmermann
2018	J	`jnl`	Parity Games with Weights. CoRR Sven Schewe, Alexander Weinert, Martin Zimmermann
2018	B	`conf`	Parity to Safety in Polynomial Time for Pushdown and Collapsible Pushdown Systems. MFCS Matthew Hague, Roland Meyer, Sebastian Muskalla, Martin Zimmermann
2018	J	`jnl`	Parity to Safety in Polynomial Time for Pushdown and Collapsible Pushdown Systems. CoRR Matthew Hague, Roland Meyer, Sebastian Muskalla, Martin Zimmermann
2018	—	`ed.`	Proceedings Ninth International Symposium on Games, Automata, Logics, and Formal Verification, GandALF 2018, Saarbrücken, Germany, 26-28th September 2018. GandALF Andrea Orlandini, Martin Zimmermann
2018	J	`jnl`	Robust, Expressive, and Quantitative Linear Temporal Logics: Pick any Two for Free. CoRR Daniel Neider, Alexander Weinert, Martin Zimmermann
2018	B	`conf`	Synthesizing Optimally Resilient Controllers. CSL Daniel Neider, Alexander Weinert, Martin Zimmermann
2018	B	`conf`	Team Semantics for the Specification and Verification of Hyperproperties. MFCS Andreas Krebs, Arne Meier, Jonni Virtema, Martin Zimmermann
2018	J	`jnl`	The complexity of counting models of linear-time temporal logic. Acta Informatica Hazem Torfah, Martin Zimmermann
2018	J	`jnl`	Visibly linear dynamic logic. Theor. Comput. Sci. Alexander Weinert, Martin Zimmermann
2017	B	`conf`	Bounding Average-Energy Games. FoSSaCS Patricia Bouyer, Piotr Hofman, Nicolas Markey, Mickael Randour, Martin Zimmermann
2017	J	`jnl`	Distributed Synthesis for Parameterized Temporal Logics. CoRR Swen Jacobs, Leander Tentrup, Martin Zimmermann
2017	J	`jnl`	Easy to Win, Hard to Master: Optimal Strategies in Parity Games with Costs. Log. Methods Comput. Sci. Alexander Weinert, Martin Zimmermann
2017	J	`jnl`	Finite-state Strategies in Delay Games. CoRR Sarah Winter, Martin Zimmermann
2017	—	`conf`	Finite-state Strategies in Delay Games. GandALF Martin Zimmermann
2017	J	`jnl`	Games with Costs and Delays. CoRR Martin Zimmermann
2017	A*	`conf`	Games with costs and delays. LICS Martin Zimmermann
2017	J	`jnl`	Parametric Linear Dynamic Logic. Inf. Comput. Peter Faymonville, Martin Zimmermann
2017	J	`jnl`	Synthesizing Optimally Resilient Controllers. CoRR Daniel Neider, Alexander Weinert, Martin Zimmermann
2017	J	`jnl`	Team Semantics for the Specification and Verification of Hyperproperties. CoRR Andreas Krebs, Arne Meier, Jonni Virtema, Martin Zimmermann
2017	A	`conf`	The First-Order Logic of Hyperproperties. STACS Bernd Finkbeiner, Martin Zimmermann
2016	—	`conf`	Approximating Optimal Bounds in Prompt-LTL Realizability in Doubly-exponential Time GandALF Leander Tentrup, Alexander Weinert, Martin Zimmermann
2016	J	`jnl`	Bounding Average-energy Games. CoRR Patricia Bouyer, Piotr Hofman, Nicolas Markey, Mickael Randour, Martin Zimmermann
2016	J	`jnl`	Delay Games with WMSO+U Winning Conditions. RAIRO Theor. Informatics Appl. Martin Zimmermann
2016	—	`conf`	Distributed PROMPT-LTL Synthesis. GandALF Swen Jacobs, Leander Tentrup, Martin Zimmermann
2016	B	`conf`	Easy to Win, Hard to Master: Optimal Strategies in Parity Games with Costs. CSL Alexander Weinert, Martin Zimmermann
2016	J	`jnl`	Easy to Win, Hard to Master: Optimal Strategies in Parity Games with Costs. CoRR Alexander Weinert, Martin Zimmermann
2016	J	`jnl`	How Much Lookahead is Needed to Win Infinite Games? Log. Methods Comput. Sci. Felix Klein, Martin Zimmermann
2016	—	`conf`	Limit Your Consumption! Finding Bounds in Average-energy Games. QAPL Kim G. Larsen, Simon Laursen, Martin Zimmermann
2016	—	`conf`	Prompt Delay. FSTTCS Felix Klein, Martin Zimmermann
2016	J	`jnl`	Prompt Delay. CoRR Felix Klein, Martin Zimmermann
2016	J	`jnl`	The First-Order Logic of Hyperproperties. CoRR Bernd Finkbeiner, Martin Zimmermann
2016	—	`conf`	Visibly Linear Dynamic Logic. FSTTCS Alexander Weinert, Martin Zimmermann
2015	Misc	`conf`	Delay Games with WMSO+U Winning Conditions. CSR Martin Zimmermann
2015	—	`conf`	How Much Lookahead is Needed to Win Infinite Games? ICALP (2) Felix Klein, Martin Zimmermann
2015	J	`jnl`	Optimal strategy synthesis for request-response games. RAIRO Theor. Informatics Appl. Florian Horn, Wolfgang Thomas, Nico Wallmeier, Martin Zimmermann
2015	J	`jnl`	Parameterized Linear Temporal Logics Meet Costs: Still not Costlier than LTL (full version). CoRR Martin Zimmermann
2015	—	`conf`	Parameterized Linear Temporal Logics Meet Costs: Still not Costlier than LTL. GandALF Martin Zimmermann
2015	J	`jnl`	Parametric Linear Dynamic Logic (full version). CoRR Peter Faymonville, Martin Zimmermann
2015	J	`jnl`	Unbounded Lookahead in WMSO+U Games. CoRR Martin Zimmermann
2015	J	`jnl`	Visibly Linear Dynamic Logic. CoRR Alexander Weinert, Martin Zimmermann
2015	B	`conf`	What are Strategies in Delay Games? Borel Determinacy for Games with Lookahead. CSL Felix Klein, Martin Zimmermann
2015	J	`jnl`	What are Strategies in Delay Games? Borel Determinacy for Games with Lookahead. CoRR Felix Klein, Martin Zimmermann
2014	J	`jnl`	Delay Games with WMSO+U Winning Conditions. CoRR Martin Zimmermann
2014	J	`jnl`	Down the Borel hierarchy: Solving Muller games via safety games. Theor. Comput. Sci. Daniel Neider, Roman Rabinovich, Martin Zimmermann
2014	J	`jnl`	Optimal Strategy Synthesis for Request-Response Games. CoRR Florian Horn, Wolfgang Thomas, Nico Wallmeier, Martin Zimmermann
2014	—	`conf`	Parametric Linear Dynamic Logic. GandALF Peter Faymonville, Martin Zimmermann
2014	J	`jnl`	Parity and Streett Games with Costs Log. Methods Comput. Sci. Nathanaël Fijalkow, Martin Zimmermann
2014	—	`conf`	The Complexity of Counting Models of Linear-time Temporal Logic. FSTTCS Hazem Torfah, Martin Zimmermann
2014	J	`jnl`	The Complexity of Counting Models of Linear-time Temporal Logic. CoRR Hazem Torfah, Martin Zimmermann
2013	J	`jnl`	Optimal bounds in parametric LTL games. Theor. Comput. Sci. Martin Zimmermann
2012	—	`conf`	Cost-Parity and Cost-Streett Games. FSTTCS Nathanaël Fijalkow, Martin Zimmermann
2012	—	`conf`	Down the Borel Hierarchy: Solving Muller Games via Safety Games GandALF Daniel Neider, Roman Rabinovich, Martin Zimmermann
2012	J	`jnl`	Playing Muller Games in a Hurry. Int. J. Found. Comput. Sci. John Fearnley, Martin Zimmermann
2012	—	`conf`	Playing Pushdown Parity Games in a Hurry GandALF Wladimir Fridman, Martin Zimmermann
2012	—	`—`	Solving infinite games with bounds. Martin Zimmermann
2011	B	`conf`	Degrees of Lookahead in Context-free Infinite Games. CSL Wladimir Fridman, Christof Löding, Martin Zimmermann
2011	—	`conf`	Optimal Bounds in Parametric LTL Games GandALF Martin Zimmermann
2010	—	`conf`	Playing Muller Games in a Hurry GANDALF John Fearnley, Martin Zimmermann
2009	C	`conf`	Time-Optimal Winning Strategies for Poset Games. CIAA Martin Zimmermann