Extending Fairness Expressibility of ECTL+: A Tree-Style One-Pass Tableau Approach
From MaRDI portal
Publication:5079769
DOI10.4230/LIPIcs.TIME.2018.5zbMath1487.68154MaRDI QIDQ5079769
Paqui Lucio, Alexander Bolotov, Montserrat Hermo
Publication date: 28 May 2022
Full work available at URL: https://doi.org/10.4230/LIPIcs.TIME.2018.5
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Cut-free sequent systems for temporal logic
- Dual systems of tableaux and sequents for PLTL
- FM 2009: Formal methods. Second world congress, Eindhoven, The Netherlands, November 2--6, 2009. Proceedings
- Decision procedures and expressiveness in the temporal logic of branching time
- Model-based testing of reactive systems. Advanced lectures.
- Automatic verification of finite-state concurrent systems using temporal logic specifications
- “Sometimes” and “not never” revisited
- Rabinizer 2: Small Deterministic Automata for LTL ∖ GU