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.
.
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.
Mascle, Corto, Neider, Daniel, Schwenger, Maximilian, Tabuada, Paulo, Weinert, Alexander and Zimmermann, Martin ORCID: 0000-0002-8038-2453
(2022)
From LTL to rLTL monitoring: improved monitorability through robust semantics.
FORMAL METHODS IN SYSTEM DESIGN, 59 (1-3).
pp. 170-204.
Schewe, Sven ORCID: 0000-0002-9093-9518, Weinert, Alexander and Zimmermann, Martin
(2018)
Parity Games with Weights.
In: Computer Science Logic, 2018-9-4 - 2018-9-7, Birmingham.
Schewe, Sven ORCID: 0000-0002-9093-9518, Weinert, Alexander and Zimmermann, M ORCID: 0000-0002-8038-2453
(2019)
Parity Games with Weights.
Logical Methods in Computer Science, 15 (03).
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.
In: GandALF 2019, Bordeaux.
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.
p. 104810.
Neider, Daniel, Weinert, Alexander and Zimmermann, Martin ORCID: 0000-0002-8038-2453
(2017)
Synthesizing Optimally Resilient Controllers.
In: CSL 2018.
Neider, Daniel, Weinert, Alexander and Zimmermann, Martin ORCID: 0000-0002-8038-2453
(2019)
Synthesizing optimally resilient controllers.
ACTA INFORMATICA, 57 (1-2).
pp. 195-221.
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.
pp. 100-117.