On the expressivity and complexity of quantitative branching-time temporal logics
From MaRDI portal
Publication:1401306
DOI10.1016/S0304-3975(02)00644-8zbMath1019.03012MaRDI QIDQ1401306
Publication date: 17 August 2003
Published in: Theoretical Computer Science (Search for Journal in Brave)
03B70: Logic in computer science
68Q60: Specification and verification (program logics, model checking, etc.)
03B44: Temporal logic
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Model-checking in dense real-time
- Characterizing finite Kripke structures in propositional temporal logic
- Symbolic model checking: \(10^{20}\) states and beyond
- The complexity of propositional linear temporal logics in simple cases
- NuSMV: A new symbolic model checker
- Is your model checker on time? On the complexity of model checking for timed modal logics
- On programming of arithmetic operations
- A really temporal logic
- An automata-theoretic approach to branching-time model checking