scientific article; zbMATH DE number 7453073
From MaRDI portal
Publication:5020519
zbMath1487.68159arXiv1909.08538MaRDI QIDQ5020519
Daniel Neider, Martín G. Zimmermann, Alexander Weinert
Publication date: 6 January 2022
Full work available at URL: https://arxiv.org/abs/1909.08538
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Specification and verification (program logics, model checking, etc.) (68Q60) Temporal logic (03B44)
Related Items (2)
Robust, expressive, and quantitative linear temporal logics: pick any two for free ⋮ From LTL to rLTL monitoring: improved monitorability through robust semantics
Cites Work
- Unnamed Item
- Optimal bounds in parametric LTL games
- Parametric linear dynamic logic
- Robustness of temporal logic specifications for continuous-time signals
- 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
- Synthesizing Optimally Resilient Controllers
- Deterministic generators and games for Ltl fragments
- Robust Linear Temporal Logic
- CONCUR 2003 - Concurrency Theory
This page was built for publication:
