default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMartin Zimmermann 0002
Person information
- affiliation: Aalborg University, Denmark
- affiliation (former): University of Liverpool, UK
- affiliation (former): Saarland University, Department of Computer Science
- affiliation (former): University of Warsaw, Institute of Informatics
- affiliation (former): RWTH Aachen, Computer Science Department
Other persons with the same name
- Martin Zimmermann — disambiguation page
- Martin Zimmermann 0001 — Hochschule Offenburg, Production Systems Engineering, Germany
- Martin Zimmermann 0003 — ETH Zurich, Physical Electronics Laboratory, Switzerland
- Martin Zimmermann 0004 — IMS CHIPS, Stuttgart, Germany
- Martin Zimmermann 0005 — J. W. Goethe-Universität Frankfurt/Main, Germany
- Martin Zimmermann 0006 — University of Hanover, Germany
- Martin Zimmermann 0007
![[0000-0002-1459-1329]](https://dblp.uni-trier.de/img/orcid-mark.12x12.png "0000-0002-1459-1329")
— Graz University of Technology, Institute for Software Technology, Austria
SPARQL queries 
🛈 Please note that only 72% of the records listed on this page have a DOI. Therefore, DOI-based queries can only provide partial results.
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
Books and Theses
- 2012
[b1]Martin Zimmermann:
Solving infinite games with bounds. RWTH Aachen University, 2012
Journal Articles
- 2024
- [j23]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) - [j22]Sean Kauffman, Martin Zimmermann:
The complexity of evaluating nfer. Sci. Comput. Program. 231: 103012 (2024) - 2022
- [j21]Daniel Neider, Alexander Weinert, Martin Zimmermann:
Robust, expressive, and quantitative linear temporal logics: Pick any two for free. Inf. Comput. 285(Part): 104810 (2022) - [j20]Martin Zimmermann:
Approximating the minimal lookahead needed to win infinite games. Inf. Process. Lett. 177: 106264 (2022) - [j19]Karoliina Lehtinen, Martin Zimmermann:
Good-for-games ω-Pushdown Automata. Log. Methods Comput. Sci. 18(1) (2022) - 2021
- [j18]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): 170-204 (2021) - [j17]Andrea Orlandini, Martin Zimmermann:
Preface. Inf. Comput. 278: 104591 (2021) - 2020
- [j16]Daniel Neider, Alexander Weinert, Martin Zimmermann:
Synthesizing optimally resilient controllers. Acta Informatica 57(1-2): 195-221 (2020) - [j15]Sarah Winter, Martin Zimmermann:
Finite-state strategies in delay games. Inf. Comput. 272: 104500 (2020) - 2019
- [j14]Sven Schewe, Alexander Weinert, Martin Zimmermann:
Parity Games with Weights. Log. Methods Comput. Sci. 15(3) (2019) - 2018
- [j13]Martin Zimmermann:
Parameterized linear temporal logics meet costs: still not costlier than LTL. Acta Informatica 55(2): 129-152 (2018) - [j12]Hazem Torfah, Martin Zimmermann:
The complexity of counting models of linear-time temporal logic. Acta Informatica 55(3): 191-212 (2018) - [j11]Swen Jacobs, Leander Tentrup, Martin Zimmermann:
Distributed synthesis for parameterized temporal logics. Inf. Comput. 262: 311-328 (2018) - [j10]Alexander Weinert, Martin Zimmermann:
Visibly linear dynamic logic. Theor. Comput. Sci. 747: 100-117 (2018) - 2017
- [j9]Peter Faymonville, Martin Zimmermann:
Parametric Linear Dynamic Logic. Inf. Comput. 253: 237-256 (2017) - [j8]Alexander Weinert, Martin Zimmermann:
Easy to Win, Hard to Master: Optimal Strategies in Parity Games with Costs. Log. Methods Comput. Sci. 13(3) (2017) - 2016
- [j7]Felix Klein, Martin Zimmermann:
How Much Lookahead is Needed to Win Infinite Games? Log. Methods Comput. Sci. 12(3) (2016) - [j6]Martin Zimmermann:
Delay Games with WMSO+U Winning Conditions. RAIRO Theor. Informatics Appl. 50(2): 145-165 (2016) - 2015
- [j5]Florian Horn, Wolfgang Thomas, Nico Wallmeier, Martin Zimmermann:
Optimal strategy synthesis for request-response games. RAIRO Theor. Informatics Appl. 49(3): 179-203 (2015) - 2014
- [j4]Nathanaël Fijalkow, Martin Zimmermann:
Parity and Streett Games with Costs. Log. Methods Comput. Sci. 10(2) (2014) - [j3]Daniel Neider, Roman Rabinovich, Martin Zimmermann:
Down the Borel hierarchy: Solving Muller games via safety games. Theor. Comput. Sci. 560: 219-234 (2014) - 2013
- [j2]Martin Zimmermann:
Optimal bounds in parametric LTL games. Theor. Comput. Sci. 493: 30-45 (2013) - 2012
- [j1]John Fearnley, Martin Zimmermann:
Playing Muller Games in a Hurry. Int. J. Found. Comput. Sci. 23(3): 649-668 (2012)
Conference and Workshop Papers
- 2023
- [c45]Enzo Erlich, Shibashis Guha, Ismaël Jecker, Karoliina Lehtinen, Martin Zimmermann:
History-Deterministic Parikh Automata. CONCUR 2023: 31:1-31:16 - [c44]Aniello Murano, Daniel Neider, Martin Zimmermann:
Robust Alternating-Time Temporal Logic. JELIA 2023: 796-813 - [c43]Martin Fränzle, Sarah Winter, Martin Zimmermann:
Strategies Resilient to Delay: Games under Delayed Control vs. Delay Games. GandALF 2023: 220-235 - 2022
- [c42]Thomas Møller Grosen, Sean Kauffman, Kim Guldstrand Larsen, Martin Zimmermann:
Monitoring Timed Properties (Revisited). FORMATS 2022: 43-62 - [c41]Shibashis Guha, Ismaël Jecker, Karoliina Lehtinen, Martin Zimmermann:
Parikh Automata over Infinite Words. FSTTCS 2022: 40:1-40:20 - [c40]Satya Prakash Nayak, Daniel Neider, Martin Zimmermann:
Robustness-by-Construction Synthesis: Adapting to the Environment at Runtime. ISoLA (1) 2022: 149-173 - [c39]Satya Prakash Nayak, Daniel Neider, Rajarshi Roy, Martin Zimmermann:
Robust Computation Tree Logic. NFM 2022: 538-556 - [c38]Sean Kauffman, Martin Zimmermann:
The Complexity of Evaluating Nfer. TASE 2022: 388-405 - 2021
- [c37]Satya Prakash Nayak, Daniel Neider, Martin Zimmermann:
Adaptive strategies for rLTL games. HSCC 2021: 32:1-32:2 - [c36]Marie Fortin, Louwe B. Kuijer, Patrick Totzke, Martin Zimmermann:
HyperLTL Satisfiability Is Σ₁¹-Complete, HyperCTL* Satisfiability Is Σ₁²-Complete. MFCS 2021: 47:1-47:19 - [c35]Shibashis Guha, Ismaël Jecker, Karoliina Lehtinen, Martin Zimmermann:
A Bit of Nondeterminism Makes Pushdown Automata Expressive and Succinct. MFCS 2021: 53:1-53:20 - 2020
- [c34]Corto Mascle, Martin Zimmermann:
The Keys to Decidable HyperLTL Satisfiability: Small Models or Very Simple Formulas. CSL 2020: 29:1-29:16 - [c33]Corto Mascle, Daniel Neider, Maximilian Schwenger, Paulo Tabuada, Alexander Weinert, Martin Zimmermann:
From LTL to rLTL monitoring: improved monitorability through robust semantics. HSCC 2020: 7:1-7:12 - [c32]Karoliina Lehtinen, Martin Zimmermann:
Good-for-games ω-Pushdown Automata. LICS 2020: 689-702 - [c31]Daniel Neider, Patrick Totzke, Martin Zimmermann:
Optimally Resilient Strategies in Pushdown Safety Games. MFCS 2020: 74:1-74:15 - [c30]Swen Jacobs, Mouhammad Sakr, Martin Zimmermann:
Promptness and Bounded Fairness in Concurrent and Parameterized Systems. VMCAI 2020: 337-359 - [c29]Aniello Murano, Sasha Rubin, Martin Zimmermann:
Optimal Strategies in Weighted Limit Games. GandALF 2020: 114-130 - 2019
- [c28]Daniel Neider, Alexander Weinert, Martin Zimmermann:
Robust, Expressive, and Quantitative Linear Temporal Logics: Pick any Two for Free. GandALF 2019: 1-16 - 2018
- [c27]Daniel Neider, Alexander Weinert, Martin Zimmermann:
Synthesizing Optimally Resilient Controllers. CSL 2018: 34:1-34:17 - [c26]Sven Schewe, Alexander Weinert, Martin Zimmermann:
Parity Games with Weights. CSL 2018: 36:1-36:17 - [c25]Andreas Krebs, Arne Meier, Jonni Virtema, Martin Zimmermann:
Team Semantics for the Specification and Verification of Hyperproperties. MFCS 2018: 10:1-10:16 - [c24]Matthew Hague, Roland Meyer, Sebastian Muskalla, Martin Zimmermann:
Parity to Safety in Polynomial Time for Pushdown and Collapsible Pushdown Systems. MFCS 2018: 57:1-57:15 - 2017
- [c23]Patricia Bouyer, Piotr Hofman, Nicolas Markey, Mickael Randour, Martin Zimmermann:
Bounding Average-Energy Games. FoSSaCS 2017: 179-195 - [c22]Martin Zimmermann:
Games with costs and delays. LICS 2017: 1-12 - [c21]Bernd Finkbeiner, Martin Zimmermann:
The First-Order Logic of Hyperproperties. STACS 2017: 30:1-30:14 - [c20]Martin Zimmermann:
Finite-state Strategies in Delay Games. GandALF 2017: 151-165 - 2016
- [c19]Alexander Weinert, Martin Zimmermann:
Easy to Win, Hard to Master: Optimal Strategies in Parity Games with Costs. CSL 2016: 31:1-31:17 - [c18]Alexander Weinert, Martin Zimmermann:
Visibly Linear Dynamic Logic. FSTTCS 2016: 28:1-28:14 - [c17]Felix Klein, Martin Zimmermann:
Prompt Delay. FSTTCS 2016: 43:1-43:14 - [c16]Kim G. Larsen, Simon Laursen, Martin Zimmermann:
Limit Your Consumption! Finding Bounds in Average-energy Games. QAPL 2016: 1-14 - [c15]Swen Jacobs, Leander Tentrup, Martin Zimmermann:
Distributed PROMPT-LTL Synthesis. GandALF 2016: 228-241 - [c14]Leander Tentrup, Alexander Weinert, Martin Zimmermann:
Approximating Optimal Bounds in Prompt-LTL Realizability in Doubly-exponential Time. GandALF 2016: 302-315 - 2015
- [c13]Felix Klein, Martin Zimmermann:
What are Strategies in Delay Games? Borel Determinacy for Games with Lookahead. CSL 2015: 519-533 - [c12]Martin Zimmermann:
Delay Games with WMSO+U Winning Conditions. CSR 2015: 412-425 - [c11]Felix Klein, Martin Zimmermann:
How Much Lookahead is Needed to Win Infinite Games? ICALP (2) 2015: 452-463 - [c10]Martin Zimmermann:
Parameterized Linear Temporal Logics Meet Costs: Still not Costlier than LTL. GandALF 2015: 144-157 - 2014
- [c9]Hazem Torfah, Martin Zimmermann:
The Complexity of Counting Models of Linear-time Temporal Logic. FSTTCS 2014: 241-252 - [c8]Peter Faymonville, Martin Zimmermann:
Parametric Linear Dynamic Logic. GandALF 2014: 60-73 - 2012
- [c7]Nathanaël Fijalkow, Martin Zimmermann:
Cost-Parity and Cost-Streett Games. FSTTCS 2012: 124-135 - [c6]Daniel Neider, Roman Rabinovich, Martin Zimmermann:
Down the Borel Hierarchy: Solving Muller Games via Safety Games. GandALF 2012: 169-182 - [c5]Wladimir Fridman, Martin Zimmermann:
Playing Pushdown Parity Games in a Hurry. GandALF 2012: 183-196 - 2011
- [c4]Wladimir Fridman, Christof Löding, Martin Zimmermann:
Degrees of Lookahead in Context-free Infinite Games. CSL 2011: 264-276 - [c3]Martin Zimmermann:
Optimal Bounds in Parametric LTL Games. GandALF 2011: 146-161 - 2010
- [c2]John Fearnley, Martin Zimmermann:
Playing Muller Games in a Hurry. GANDALF 2010: 146-161 - 2009
- [c1]Martin Zimmermann:
Time-Optimal Winning Strategies for Poset Games. CIAA 2009: 217-226
Editorship
- 2018
- [e1]Andrea Orlandini, Martin Zimmermann:
Proceedings Ninth International Symposium on Games, Automata, Logics, and Formal Verification, GandALF 2018, Saarbrücken, Germany, 26-28th September 2018. EPTCS 277, 2018 [contents]
Informal and Other Publications
- 2024
- [i45]Sarah Winter, Martin Zimmermann:
Tracy, Traces, and Transducers: Computable Counterexamples and Explanations for HyperLTL Model-Checking. CoRR abs/2404.18280 (2024) - [i44]Martin Fränzle, Thomas Møller Grosen, Kim G. Larsen, Martin Zimmermann:
Monitoring Real-Time Systems under Parametric Delay. CoRR abs/2404.18282 (2024) - [i43]Sean Kauffman, Kim Guldstrand Larsen, Martin Zimmermann:
The Complexity of Data-Free Nfer. CoRR abs/2407.03155 (2024) - [i42]Christian Schilling, Martin Zimmermann:
The Reachability Problem for Neural-Network Control Systems. CoRR abs/2407.04988 (2024) - 2023
- [i41]Marie Fortin, Louwe B. Kuijer, Patrick Totzke, Martin Zimmermann:
HyperLTL Satisfiability Is Highly Undecidable, HyperCTL* is Even Harder. CoRR abs/2303.16699 (2023) - [i40]Martin Fränzle, Sarah Winter, Martin Zimmermann:
Strategies Resilient to Delay: Games under Delayed Control vs. Delay Games (full version). CoRR abs/2305.19985 (2023) - [i39]Martin Zimmermann:
Robust Probabilistic Temporal Logics. CoRR abs/2306.05806 (2023) - [i38]Aniello Murano, Daniel Neider, Martin Zimmermann:
Robust Alternating-Time Temporal Logic. CoRR abs/2307.10885 (2023) - [i37]Martin Zimmermann:
The Complexity of Second-order HyperLTL. CoRR abs/2311.15675 (2023) - 2022
- [i36]Satya Prakash Nayak, Daniel Neider, Rajarshi Roy, Martin Zimmermann:
Robust Computation Tree Logic. CoRR abs/2201.07116 (2022) - [i35]Sean Kauffman, Martin Zimmermann:
The Complexity of Evaluating nfer. CoRR abs/2202.13677 (2022) - [i34]Sarah Winter, Martin Zimmermann:
Weak Muller Conditions Make Delay Games Hard. CoRR abs/2203.03404 (2022) - [i33]Satya Prakash Nayak, Daniel Neider, Martin Zimmermann:
Robustness-by-Construction Synthesis: Adapting to the Environment at Runtime. CoRR abs/2204.10912 (2022) - [i32]Thomas Møller Grosen, Sean Kauffman, Kim Guldstrand Larsen, Martin Zimmermann:
Monitoring Timed Properties (Revisited). CoRR abs/2206.14590 (2022) - [i31]Shibashis Guha, Ismaël Jecker, Karoliina Lehtinen, Martin Zimmermann:
Parikh Automata over Infinite Words. CoRR abs/2207.07694 (2022) - [i30]Enzo Erlich, Shibashis Guha, Ismaël Jecker, Karoliina Lehtinen, Martin Zimmermann:
History-deterministic Parikh Automata. CoRR abs/2209.07745 (2022) - 2021
- [i29]Shibashis Guha, Ismaël Jecker, Karoliina Lehtinen, Martin Zimmermann:
A Bit of Nondeterminism Makes Pushdown Automata Expressive and Succinct. CoRR abs/2105.02611 (2021) - [i28]Marie Fortin, Louwe B. Kuijer, Patrick Totzke, Martin Zimmermann:
HyperLTL Satisfiability is Σ11-complete, HyperCTL* Satisfiability is Σ12-complete. CoRR abs/2105.04176 (2021) - 2020
- [i27]Karoliina Lehtinen, Martin Zimmermann:
Good-for-games ω-Pushdown Automata. CoRR abs/2001.04392 (2020) - [i26]Aniello Murano, Sasha Rubin, Martin Zimmermann:
Optimal Strategies in Weighted Limit Games (full version). CoRR abs/2008.11562 (2020) - [i25]Martin Zimmermann:
Approximating the Minimal Lookahead Needed to Win Infinite Games. CoRR abs/2010.11706 (2020) - 2019
- [i24]Corto Mascle, Martin Zimmermann:
The Keys to Decidable HyperLTL Satisfiability: Small Models or Very Simple Formulas. CoRR abs/1907.05070 (2019) - [i23]Swen Jacobs, Mouhammad Sakr, Martin Zimmermann:
Promptness and Bounded Fairness in Concurrent and Parameterized Systems. CoRR abs/1911.03122 (2019) - [i22]Daniel Neider, Patrick Totzke, Martin Zimmermann:
Optimally Resilient Strategies in Pushdown Safety Games. CoRR abs/1912.04771 (2019) - 2018
- [i21]Sven Schewe, Alexander Weinert, Martin Zimmermann:
Parity Games with Weights. CoRR abs/1804.06168 (2018) - [i20]Matthew Hague, Roland Meyer, Sebastian Muskalla, Martin Zimmermann:
Parity to Safety in Polynomial Time for Pushdown and Collapsible Pushdown Systems. CoRR abs/1805.02963 (2018) - [i19]Corto Mascle, Daniel Neider, Maximilian Schwenger, Paulo Tabuada, Alexander Weinert, Martin Zimmermann:
From LTL to rLTL Monitoring: Improved Monitorability through Robust Semantics. CoRR abs/1807.08203 (2018) - [i18]Daniel Neider, Alexander Weinert, Martin Zimmermann:
Robust, Expressive, and Quantitative Linear Temporal Logics: Pick any Two for Free. CoRR abs/1808.09028 (2018) - 2017
- [i17]Martin Zimmermann:
Games with Costs and Delays. CoRR abs/1701.02168 (2017) - [i16]Sarah Winter, Martin Zimmermann:
Finite-state Strategies in Delay Games. CoRR abs/1704.08887 (2017) - [i15]Swen Jacobs, Leander Tentrup, Martin Zimmermann:
Distributed Synthesis for Parameterized Temporal Logics. CoRR abs/1705.08112 (2017) - [i14]Daniel Neider, Alexander Weinert, Martin Zimmermann:
Synthesizing Optimally Resilient Controllers. CoRR abs/1709.04854 (2017) - [i13]Andreas Krebs, Arne Meier, Jonni Virtema, Martin Zimmermann:
Team Semantics for the Specification and Verification of Hyperproperties. CoRR abs/1709.08510 (2017) - 2016
- [i12]Felix Klein, Martin Zimmermann:
Prompt Delay. CoRR abs/1602.05045 (2016) - [i11]Alexander Weinert, Martin Zimmermann:
Easy to Win, Hard to Master: Optimal Strategies in Parity Games with Costs. CoRR abs/1604.05543 (2016) - [i10]Bernd Finkbeiner, Martin Zimmermann:
The First-Order Logic of Hyperproperties. CoRR abs/1610.04388 (2016) - [i9]Patricia Bouyer, Piotr Hofman, Nicolas Markey, Mickael Randour, Martin Zimmermann:
Bounding Average-energy Games. CoRR abs/1610.07858 (2016) - 2015
- [i8]Felix Klein, Martin Zimmermann:
What are Strategies in Delay Games? Borel Determinacy for Games with Lookahead. CoRR abs/1504.02627 (2015) - [i7]Peter Faymonville, Martin Zimmermann:
Parametric Linear Dynamic Logic (full version). CoRR abs/1504.03880 (2015) - [i6]Martin Zimmermann:
Parameterized Linear Temporal Logics Meet Costs: Still not Costlier than LTL (full version). CoRR abs/1505.06953 (2015) - [i5]Martin Zimmermann:
Unbounded Lookahead in WMSO+U Games. CoRR abs/1509.07495 (2015) - [i4]Alexander Weinert, Martin Zimmermann:
Visibly Linear Dynamic Logic. CoRR abs/1512.05177 (2015) - 2014
- [i3]Florian Horn, Wolfgang Thomas, Nico Wallmeier, Martin Zimmermann:
Optimal Strategy Synthesis for Request-Response Games. CoRR abs/1406.4648 (2014) - [i2]Hazem Torfah, Martin Zimmermann:
The Complexity of Counting Models of Linear-time Temporal Logic. CoRR abs/1408.5752 (2014) - [i1]Martin Zimmermann:
Delay Games with WMSO+U Winning Conditions. CoRR abs/1412.3978 (2014)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-28 23:34 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
