Time-Optimal Winning Strategies for Poset Games. - Martin Zimmermann 002 (CIAA, 2009)

Degrees of Lookahead in Context-free Infinite Games. - Wladimir Fridman; Christof Löding; Martin Zimmermann 002 (CSL, 2011)

Cost-Parity and Cost-Streett Games. - Nathanaël Fijalkow; Martin Zimmermann 002 (FSTTCS, 2012)

Playing Pushdown Parity Games in a Hurry - Wladimir Fridman; Martin Zimmermann 002 (GandALF, 2012)

Playing Muller Games in a Hurry. - John Fearnley; Martin Zimmermann 002 (Int. J. Found. Comput. Sci., 2012)

Solving infinite games with bounds. - Martin Zimmermann 002 (2012)

Optimal bounds in parametric LTL games. - Martin Zimmermann 002 (Theor. Comput. Sci., 2013)

Parametric Linear Dynamic Logic. - Peter Faymonville; Martin Zimmermann 002 (GandALF, 2014)

Parity and Streett Games with Costs - Nathanaël Fijalkow; Martin Zimmermann 002 (Log. Methods Comput. Sci., 2014)

Down the Borel hierarchy: Solving Muller games via safety games. - Daniel Neider; Roman Rabinovich 001; Martin Zimmermann 002 (Theor. Comput. Sci., 2014)

What are Strategies in Delay Games? Borel Determinacy for Games with Lookahead. - Felix Klein 001; Martin Zimmermann 002 (CSL, 2015)

Parametric Linear Dynamic Logic (full version). - Peter Faymonville; Martin Zimmermann 002 (CoRR, 2015)

Parameterized Linear Temporal Logics Meet Costs: Still not Costlier than LTL (full version). - Martin Zimmermann 002 (CoRR, 2015)

Parameterized Linear Temporal Logics Meet Costs: Still not Costlier than LTL. - Martin Zimmermann 002 (GandALF, 2015)

Unbounded Lookahead in WMSO+U Games. - Martin Zimmermann 002 (CoRR, 2015)

Optimal strategy synthesis for request-response games. - Florian Horn 001; Wolfgang Thomas; Nico Wallmeier; Martin Zimmermann 002 (RAIRO Theor. Informatics Appl., 2015)

Prompt Delay. - Felix Klein 001; Martin Zimmermann 002 (FSTTCS, 2016)

Distributed PROMPT-LTL Synthesis. - Swen Jacobs; Leander Tentrup; Martin Zimmermann 002 (GandALF, 2016)

How Much Lookahead is Needed to Win Infinite Games? - Felix Klein 001; Martin Zimmermann 002 (Log. Methods Comput. Sci., 2016)

Limit Your Consumption! Finding Bounds in Average-energy Games. - Kim G. Larsen; Simon Laursen; Martin Zimmermann 002 (QAPL, 2016)

Approximating Optimal Bounds in Prompt-LTL Realizability in Doubly-exponential Time - Leander Tentrup; Alexander Weinert; Martin Zimmermann 002 (GandALF, 2016)

Delay Games with WMSO+U Winning Conditions. - Martin Zimmermann 002 (RAIRO Theor. Informatics Appl., 2016)

Bounding Average-Energy Games. - Patricia Bouyer; Piotr Hofman; Nicolas Markey; Mickael Randour; Martin Zimmermann 002 (FoSSaCS, 2017)

Games with costs and delays. - Martin Zimmermann 002 (LICS, 2017)

The First-Order Logic of Hyperproperties. - Bernd Finkbeiner; Martin Zimmermann 002 (STACS, 2017)

Finite-state Strategies in Delay Games. - Martin Zimmermann 002 (GandALF, 2017)

Easy to Win, Hard to Master: Optimal Strategies in Parity Games with Costs. - Alexander Weinert; Martin Zimmermann 002 (Log. Methods Comput. Sci., 2017)

Parity to Safety in Polynomial Time for Pushdown and Collapsible Pushdown Systems. - Matthew Hague; Roland Meyer 001; Sebastian Muskalla; Martin Zimmermann 002 (MFCS, 2018)

Team Semantics for the Specification and Verification of Hyperproperties. - Andreas Krebs; Arne Meier; Jonni Virtema; Martin Zimmermann 002 (MFCS, 2018)

The complexity of counting models of linear-time temporal logic. - Hazem Torfah; Martin Zimmermann 002 (Acta Informatica, 2018)

Distributed synthesis for parameterized temporal logics. - Swen Jacobs; Leander Tentrup; Martin Zimmermann 002 (Inf. Comput., 2018)

Visibly linear dynamic logic. - Alexander Weinert; Martin Zimmermann 002 (Theor. Comput. Sci., 2018)

Robust, Expressive, and Quantitative Linear Temporal Logics: Pick any Two for Free. - Daniel Neider; Alexander Weinert; Martin Zimmermann 002 (GandALF, 2019)

Parity Games with Weights. - Sven Schewe; Alexander Weinert; Martin Zimmermann 002 (Log. Methods Comput. Sci., 2019)

The Keys to Decidable HyperLTL Satisfiability: Small Models or Very Simple Formulas. - Corto Mascle; Martin Zimmermann 002 (CSL, 2020)

Optimally Resilient Strategies in Pushdown Safety Games. - Daniel Neider; Patrick Totzke; Martin Zimmermann 002 (MFCS, 2020)

Promptness and Bounded Fairness in Concurrent and Parameterized Systems. - Swen Jacobs; Mouhammad Sakr; Martin Zimmermann 002 (VMCAI, 2020)

Synthesizing optimally resilient controllers. - Daniel Neider; Alexander Weinert; Martin Zimmermann 002 (Acta Informatica, 2020)

Optimal Strategies in Weighted Limit Games (full version). - Aniello Murano; Sasha Rubin; Martin Zimmermann 002 (CoRR, 2020)

Optimal Strategies in Weighted Limit Games. - Aniello Murano; Sasha Rubin; Martin Zimmermann 002 (GandALF, 2020)

Finite-state strategies in delay games. - Sarah Winter; Martin Zimmermann 002 (Inf. Comput., 2020)

Adaptive strategies for rLTL games. - Satya Prakash Nayak; Daniel Neider; Martin Zimmermann 002 (HSCC, 2021)

HyperLTL Satisfiability Is Σ₁¹-Complete, HyperCTL* Satisfiability Is Σ₁²-Complete. - Marie Fortin; Louwe B. Kuijer; Patrick Totzke; Martin Zimmermann 002 (MFCS, 2021)

HyperLTL Satisfiability is Σ11-complete, HyperCTL* Satisfiability is Σ12-complete. - Marie Fortin; Louwe B. Kuijer; Patrick Totzke; Martin Zimmermann 002 (CoRR, 2021)

From LTL to rLTL monitoring: improved monitorability through robust semantics. - Corto Mascle; Daniel Neider; Maximilian Schwenger; Paulo Tabuada; Alexander Weinert; Martin Zimmermann 002 (Formal Methods Syst. Des., 2021)

Preface. - Andrea Orlandini; Martin Zimmermann 002 (Inf. Comput., 2021)

Monitoring Timed Properties (Revisited). - Thomas Møller Grosen; Sean Kauffman; Kim Guldstrand Larsen; Martin Zimmermann 002 (FORMATS, 2022)

Parikh Automata over Infinite Words. - Shibashis Guha; Ismaël Jecker; Karoliina Lehtinen; Martin Zimmermann 002 (FSTTCS, 2022)

Robustness-by-Construction Synthesis: Adapting to the Environment at Runtime. - Satya Prakash Nayak; Daniel Neider; Martin Zimmermann 002 (ISoLA (1), 2022)

Weak Muller Conditions Make Delay Games Hard. - Sarah Winter; Martin Zimmermann 002 (CoRR, 2022)

Approximating the minimal lookahead needed to win infinite games. - Martin Zimmermann 002 (Inf. Process. Lett., 2022)

Good-for-games ω-Pushdown Automata. - Karoliina Lehtinen; Martin Zimmermann 002 (Log. Methods Comput. Sci., 2022)

History-Deterministic Parikh Automata. - Enzo Erlich; Shibashis Guha; Ismaël Jecker; Karoliina Lehtinen; Martin Zimmermann 002 (CONCUR, 2023)

Robust Alternating-Time Temporal Logic. - Aniello Murano; Daniel Neider; Martin Zimmermann 002 (JELIA, 2023)

The Reachability Problem for Neural-Network Control Systems. - Christian Schilling 001; Martin Zimmermann 002 (AISoLA (Selected Papers), 2023)

Strategies Resilient to Delay: Games under Delayed Control vs. Delay Games. - Martin Fränzle; Sarah Winter; Martin Zimmermann 002 (GandALF, 2023)

Monitoring Real-Time Systems Under Parametric Delay. - Martin Fränzle; Thomas Møller Grosen; Kim G. Larsen; Martin Zimmermann 002 (IFM, 2024)

The Complexity of Data-Free Nfer. - Sean Kauffman; Kim Guldstrand Larsen; Martin Zimmermann 002 (RV, 2024)

Exploiting Assumptions for Effective Monitoring of Real-Time Properties Under Partial Observability. - Alessandro Cimatti; Thomas Møller Grosen; Kim G. Larsen; Stefano Tonetta; Martin Zimmermann 002 (SEFM, 2024)

Synchronous Team Semantics for Temporal Logics. - Andreas Krebs; Arne Meier; Jonni Virtema; Martin Zimmermann 002 (CoRR, 2024)

The Complexity of HyperQPTL. - Gaëtan Regaud; Martin Zimmermann 002 (CoRR, 2024)

A Bit of Nondeterminism Makes Pushdown Automata Expressive and Succinct. - Shibashis Guha; Ismaël Jecker; Karoliina Lehtinen; Martin Zimmermann 002 (Log. Methods Comput. Sci., 2024)

The complexity of evaluating nfer. - Sean Kauffman; Martin Zimmermann 002 (Sci. Comput. Program., 2024)

Time for Timed Monitorability. - Thomas Møller Grosen; Sean Kauffman; Kim G. Larsen; Martin Zimmermann 002 (CONCUR, 2025)

Prophecies All the Way: Game-Based Model-Checking for HyperQPTL Beyond ∀*∃. - Sarah Winter; Martin Zimmermann 002 (CONCUR, 2025)

The Complexity of Second-Order HyperLTL. - Hadar Frenkel; Martin Zimmermann 002 (CSL, 2025)

Robust probabilistic temporal logics. - Martin Zimmermann 002 (Inf. Process. Lett., 2025)

HyperLTL Satisfiability Is Highly Undecidable, HyperCTL$^*$ is Even Harder. - Marie Fortin; Louwe B. Kuijer; Patrick Totzke; Martin Zimmermann 002 (Log. Methods Comput. Sci., 2025)

On the Existence of Reactive Strategies Resilient to Delay. - Martin Fränzle; Paul Kröger; Sarah Winter; Martin Zimmermann 002 (Log. Methods Comput. Sci., 2025)

The Complexity of Fragments of Second-Order HyperLTL. - Gaëtan Regaud; Martin Zimmermann 002 (CoRR, 2025)

You May Delay, but Time Will Not: Timed Games Under Delayed Control. - Kim G. Larsen; Martin Zimmermann 002 (CoRR, 2025)

The Complexity of Generalized HyperLTL with Stuttering and Contexts. - Gaëtan Regaud; Martin Zimmermann 002 (CoRR, 2025)

Prophecies all the Way: Game-based Model-Checking for HyperQPTL beyond ∀*&#8707*. - Sarah Winter; Martin Zimmermann 002 (CoRR, 2025)

Robust computation tree logic. - Satya Prakash Nayak; Daniel Neider; Rajarshi Roy 002; Martin Zimmermann 002 (Innov. Syst. Softw. Eng., 2025)

History-Deterministic Parikh Automata. - Enzo Erlich; Mario Grobler; Shibashis Guha; Ismaël Jecker; Karoliina Lehtinen; Martin Zimmermann 002 (ACM Trans. Comput. Log., 2025)

Tracy, traces, and transducers: computable counterexamples and explanations for HyperLTL model-checking. - Sarah Winter; Martin Zimmermann 002 (Acta Informatica, 2025)