![]() | Up a level |
Tentrup, Leander, Weinert, Alexander and Zimmermann, Martin ORCID: 0000-0002-8038-2453
(2015)
Approximating Optimal Bounds in Prompt-LTL Realizability in Doubly-exponential Time.
.
Zimmermann, Martin ORCID: 0000-0002-8038-2453
(2022)
Approximating the minimal lookahead needed to win infinite games.
INFORMATION PROCESSING LETTERS, 177.
Guha, Shibashis, Jecker, Ismaël, Lehtinen, Karoliina and Zimmermann, Martin ORCID: 0000-0002-8038-2453
(2021)
A Bit of Nondeterminism Makes Pushdown Automata Expressive and Succinct.
.
Bouyer, Patricia, Hofman, Piotr, Markey, Nicolas, Randour, Mickael and Zimmermann, Martin ORCID: 0000-0002-8038-2453
(2017)
Bounding Average-Energy Games.
.
Zimmermann, Martin ORCID: 0000-0002-8038-2453
(2015)
Delay Games with WMSO $$+$$ + U Winning Conditions.
.
Zimmermann, Martin ORCID: 0000-0002-8038-2453
(2014)
Delay Games with WMSO+U Winning Conditions.
Jacobs, Swen, Tentrup, Leander and Zimmermann, Martin ORCID: 0000-0002-8038-2453
(2015)
Distributed PROMPT-LTL Synthesis.
.
Jacobs, Swen, Tentrup, Leander and Zimmermann, Martin ORCID: 0000-0002-8038-2453
(2018)
Distributed synthesis for parameterized temporal logics.
INFORMATION AND COMPUTATION, 262.
311 - 328.
Neider, Daniel, Rabinovich, Roman and Zimmermann, Martin ORCID: 0000-0002-8038-2453
(2012)
Down the Borel Hierarchy: Solving Muller Games via Safety Games.
.
Neider, Daniel, Rabinovich, Roman and Zimmermann, Martin ORCID: 0000-0002-8038-2453
(2014)
Down the Borel hierarchy: Solving Muller games via safety games.
THEORETICAL COMPUTER SCIENCE, 560.
219 - 234.
Zimmermann, Martin ORCID: 0000-0002-8038-2453
(2017)
Finite-state Strategies in Delay Games.
.
Finkbeiner, Bernd and Zimmermann, Martin ORCID: 0000-0002-8038-2453
(2017)
The First-Order Logic of Hyperproperties.
.
Mascle, Corto, Neider, Daniel, Schwenger, Maximilian, Tabuada, Paulo, Weinert, Alexander and Zimmermann, Martin ORCID: 0000-0002-8038-2453
(2020)
From LTL to rLTL monitoring.
In: HSCC '20: 23rd ACM International Conference on Hybrid Systems: Computation and Control.
Lehtinen, Karoliina and Zimmermann, Martin ORCID: 0000-0002-8038-2453
(2020)
GOOD-FOR-GAMES omega-PUSHDOWN AUTOMATA.
LOGICAL METHODS IN COMPUTER SCIENCE, 18 (1).
Zimmermann, Martin ORCID: 0000-0002-8038-2453
(2017)
Games with Costs and Delays.
.
Lehtinen, Karoliina, Zimmermann, Martin ORCID: 0000-0002-8038-2453 and ACM,
(2020)
Good-for-games omega-Pushdown Automata.
.
Klein, Felix and Zimmermann, Martin ORCID: 0000-0002-8038-2453
(2015)
How Much Lookahead is Needed to Win Infinite Games?
.
Klein, Felix and Zimmermann, Martin ORCID: 0000-0002-8038-2453
(2017)
How Much Lookahead is Needed to Win Infinite Games?
Logical Methods in Computer Science, 12 (3).
Fortin, Marie, Kuijer, Louwe B, Totzke, Patrick ORCID: 0000-0001-5274-8190 and Zimmermann, Martin
(2021)
HyperLTL Satisfiability is $Σ_1^1$-complete, HyperCTL* Satisfiability is $Σ_1^2$-complete.
Kuijer, Louwe ORCID: 0000-0001-6696-9023, Fortin, Marie, Totzke, Patrick
ORCID: 0000-0001-5274-8190 and Zimmermann, Martin
ORCID: 0000-0002-8038-2453
(2021)
HyperLTL Satisfiability is Σ11-complete, HyperCTL* Satisfiability is Σ21-complete.
In: Mathematical Foundations of Computer Science, 2021-08-23 - 2021-08-27, Tallinn.
Mascle, Corto and Zimmermann, Martin
(2019)
The Keys to Decidable HyperLTL Satisfiability: Small Models or Very Simple Formulas.
Larsen, Kim G, Laursen, Simon and Zimmermann, Martin ORCID: 0000-0002-8038-2453
(2015)
Limit Your Consumption! Finding Bounds in Average-energy Games.
.
Horn, Florian, Thomas, Wolfgang, Wallmeier, Nico and Zimmermann, Martin ORCID: 0000-0002-8038-2453
(2015)
OPTIMAL STRATEGY SYNTHESIS FOR REQUEST-RESPONSE GAMES.
RAIRO-THEORETICAL INFORMATICS AND APPLICATIONS, 49 (3).
179 - 203.
Zimmermann, Martin ORCID: 0000-0002-8038-2453
(2011)
Optimal Bounds in Parametric LTL Games.
.
Murano, Aniello, Rubin, Sasha and Zimmermann, Martin ORCID: 0000-0002-8038-2453
(2020)
Optimal Strategies in Weighted Limit Games.
.
Zimmermann, Martin ORCID: 0000-0002-8038-2453
(2013)
Optimal bounds in parametric LTL games.
THEORETICAL COMPUTER SCIENCE, 493.
30 - 45.
Neider, Daniel, Totzke, Patrick ORCID: 0000-0001-5274-8190 and Zimmermann, Martin
ORCID: 0000-0002-8038-2453
(2019)
Optimally Resilient Strategies in Pushdown Safety Games.
.
Fearnley, John and Zimmermann, Martin ORCID: 0000-0002-8038-2453
(2012)
PLAYING MULLER GAMES IN A HURRY.
INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 23 (3).
649 - 668.
Zimmermann, Martin ORCID: 0000-0002-8038-2453
(2018)
Parameterized linear temporal logics meet costs: still not costlier than LTL.
ACTA INFORMATICA, 55 (2).
129 - 152.
Faymonville, Peter and Zimmermann, Martin ORCID: 0000-0002-8038-2453
(2014)
Parametric Linear Dynamic Logic.
.
Faymonville, Peter and Zimmermann, Martin ORCID: 0000-0002-8038-2453
(2017)
Parametric Linear Dynamic Logic.
Information and Computation, 253 (Part 2).
237 - 256.
Schewe, Sven ORCID: 0000-0002-9093-9518, Weinert, Alexander and Zimmermann, Martin
(2018)
Parity Games with Weights.
.
Fijalkow, Nathanael and Zimmermann, Martin ORCID: 0000-0002-8038-2453
(2014)
Parity and Streett Games with Costs.
Logical Methods in Computer Science, 10 (2).
Fearnley, John and Zimmermann, Martin ORCID: 0000-0002-8038-2453
(2010)
Playing Muller Games in a Hurry.
.
Fridman, Wladimir and Zimmermann, Martin ORCID: 0000-0002-8038-2453
(2012)
Playing Pushdown Parity Games in a Hurry.
.
Klein, Felix and Zimmermann, Martin ORCID: 0000-0002-8038-2453
(2016)
Prompt Delay.
.
Jacobs, Swen, Sakr, Mouhammad and Zimmermann, Martin ORCID: 0000-0002-8038-2453
(2020)
Promptness and Bounded Fairness in Concurrent and Parameterized Systems.
.
Neider, Daniel, Weinert, Alexander and Zimmermann, Martin ORCID: 0000-0002-8038-2453
(2019)
Robust, Expressive, and Quantitative Linear Temporal Logics: Pick any Two for Free.
.
Neider, Daniel, Weinert, Alexander and Zimmermann, Martin ORCID: 0000-0002-8038-2453
(2022)
Robust, expressive, and quantitative linear temporal logics: Pick any two for free.
Information and Computation, 285.
104810 - 104810.
Neider, Daniel, Weinert, Alexander and Zimmermann, Martin ORCID: 0000-0002-8038-2453
(2017)
Synthesizing Optimally Resilient Controllers.
.
Neider, Daniel, Weinert, Alexander and Zimmermann, Martin ORCID: 0000-0002-8038-2453
(2019)
Synthesizing optimally resilient controllers.
ACTA INFORMATICA.
Zimmermann, Martin ORCID: 0000-0002-8038-2453
(2009)
Time-Optimal Winning Strategies for Poset Games.
.
Weinert, Alexander and Zimmermann, Martin ORCID: 0000-0002-8038-2453
(2015)
Visibly Linear Dynamic Logic.
.
Weinert, Alexander and Zimmermann, Martin ORCID: 0000-0002-8038-2453
(2018)
Visibly linear dynamic logic.
THEORETICAL COMPUTER SCIENCE, 747.
100 - 117.
Klein, Felix and Zimmermann, Martin ORCID: 0000-0002-8038-2453
(2015)
What are Strategies in Delay Games? Borel Determinacy for Games with Lookahead.
.
Torfah, Hazem and Zimmermann, Martin ORCID: 0000-0002-8038-2453
(2018)
The complexity of counting models of linear-time temporal logic.
ACTA INFORMATICA, 55 (3).
191 - 212.