Seguir
Martin Zimmermann
Título
Citado por
Citado por
Ano
Parity and Streett Games with Costs
N Fijalkow, M Zimmermann
Logical Methods in Computer Science 10 (2), 2014
51*2014
The First-order Logic of Hyperproperties
B Finkbeiner, M Zimmermann
STACS 2017, 2017
502017
Optimal Bounds in Parametric LTL Games
M Zimmermann
Theoretical Computer Science 493, 30-45, 2013
492013
Team Semantics for the Specification and Verification of Hyperproperties
A Krebs, A Meier, J Virtema, M Zimmermann
MFCS 2018, 2017
462017
Parametric linear dynamic logic
P Faymonville, M Zimmermann
Information and Computation 253, 237-256, 2017
44*2017
Optimal strategy synthesis for request-response games
F Horn, W Thomas, N Wallmeier, M Zimmermann
RAIRO-Theoretical Informatics and Applications-Informatique Théorique et …, 2015
42*2015
How Much Lookahead is Needed to Win Infinite Games?
F Klein, M Zimmermann
Logical Methods in Computer Science 12 (3), 2016
362016
Good-for-games ω-pushdown automata
K Lehtinen, M Zimmermann
Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer …, 2020
252020
Degrees of Lookahead in Context-free Infinite Games
W Fridman, C Löding, M Zimmermann
CSL 2011 12, 264-276, 2011
232011
Synthesizing optimally resilient controllers
D Neider, A Weinert, M Zimmermann
Acta Informatica 57 (1), 195-221, 2020
212020
From LTL to rLTL monitoring: improved monitorability through robust semantics
MZ Corto Mascle, Daniel Neider, Maximilian Schwenger, Paulo Tabuada ...
Formal Methods in System Design 59, 2021
20*2021
The Keys to Decidable HyperLTL Satisfiability: Small Models or Very Simple Formulas
C Mascle, M Zimmermann
CSL 2020, 2020
202020
What are Strategies in Delay Games? Borel Determinacy for Games with Lookahead
F Klein, M Zimmermann
CSL 2015 41, 519--533, 2015
202015
Down the Borel Hierarchy: Solving Muller Games via Safety Games
D Neider, R Rabinovich, M Zimmermann
Theoretical Computer Science 560, 219-234, 2014
20*2014
Time-optimal Winning Strategies for Poset Games
M Zimmermann
CIAA 2009 5642, 217-226, 2009
172009
Visibly linear dynamic logic
A Weinert, M Zimmermann
TCS, 2018
16*2018
A Bit of Nondeterminism Makes Pushdown Automata Expressive and Succinct
S Guha, I Jecker, K Lehtinen, M Zimmermann
MFCS 2021, 2021
152021
Finite-state strategies in delay games
S Winter, M Zimmermann
Information and Computation 272, 104500, 2020
15*2020
Robust, Expressive, and Quantitative Linear Temporal Logics: Pick any Two for Free
D Neider, A Weinert, M Zimmermann
Information and Computation, 2022
14*2022
HyperLTL Satisfiability is -complete, HyperCTL* Satisfiability is -complete
M Fortin, LB Kuijer, P Totzke, M Zimmermann
MFCS 2021, 2021
14*2021
O sistema não pode executar a operação agora. Tente novamente mais tarde.
Artigos 1–20