\(\text{BTL}_{2}\) and the expressive power of \(\text{ECTL}^{+}\)
From MaRDI portal
Publication:2500472
DOI10.1016/j.ic.2005.07.006zbMath1110.68076OpenAlexW4205759389MaRDI QIDQ2500472
Philippe Schnoebelen, Alexander Rabinovich
Publication date: 16 August 2006
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ic.2005.07.006
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
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The temporal logic of branching time
- Fairness and related properties in transition systems - a temporal logic to deal with fairness
- The polynomial-time hierarchy
- Counting on CTL\(^*\): On the expressive power of monadic path logic
- Modalities for model checking: Branching time logic strikes back
- An infinite hierarchy of temporal logics over branching time
- The complexity of propositional linear temporal logics in simple cases
- Future temporal logic needs infinitely many modalities
- Decision procedures and expressiveness in the temporal logic of branching time
- First-order logic with two variables and unary temporal logic
- An application of games to the completeness problem for formalized theories
- The decision problem for branching time logic
- Automatic verification of finite-state concurrent systems using temporal logic specifications
- “Sometimes” and “not never” revisited
- The complexity of propositional linear temporal logics
- Monadic Logic of Order over Naturals has no Finite Base
- Decidability of Second-Order Theories and Automata on Infinite Trees
- CONCUR 2003 - Concurrency Theory
This page was built for publication: \(\text{BTL}_{2}\) and the expressive power of \(\text{ECTL}^{+}\)
