Robust, expressive, and quantitative linear temporal logics: pick any two for free
From MaRDI portal
Publication:2672232
DOI10.1016/j.ic.2021.104810OpenAlexW3209560691MaRDI QIDQ2672232
Daniel Neider, Alexander Weinert, Martín G. Zimmermann
Publication date: 8 June 2022
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://elib.dlr.de/144975/1/main.pdf
Specification and verification (program logics, model checking, etc.) (68Q60) Temporal logic (03B44)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimal bounds in parametric LTL games
- Parametric linear dynamic logic
- Robustness of temporal logic specifications for continuous-time signals
- Alternating finite automata on \(\omega\)-words
- From liveness to promptness
- Reasoning about infinite computations
- Automata, logics, and infinite games. A guide to current research
- Parameterized linear temporal logics meet costs: still not costlier than LTL
- Towards Robustness for Cyber-Physical Systems
- Temporal logic can be more expressive
- Fifteen Years of Formal Property Verification in Intel
- Regular Linear Temporal Logic
- Parametric temporal logic for “model measuring”
- Robust Satisfaction of Temporal Logic over Real-Valued Signals
- The complexity of propositional linear temporal logics
- Visibly Linear Dynamic Logic
- Deciding parity games in quasipolynomial time
- Synthesizing Optimally Resilient Controllers
- From LTL to rLTL monitoring
- Evrostos
- Deterministic generators and games for Ltl fragments
- Robust Linear Temporal Logic
- CONCUR 2003 - Concurrency Theory
This page was built for publication: Robust, expressive, and quantitative linear temporal logics: pick any two for free
