Extending fairness expressibility of ECTL^+: a tree-style one-pass tableau approach
From MaRDI portal
Publication:5079769
DOI10.4230/LIPICS.TIME.2018.5zbMATH Open1487.68154OpenAlexW2898734050MaRDI QIDQ5079769FDOQ5079769
P. Lucio, Alexander Bolotov, M. Hermo
Publication date: 28 May 2022
Full work available at URL: https://doi.org/10.4230/LIPIcs.TIME.2018.5
Recommendations
- Branching-time logic \(\mathsf{ECTL}^{\#}\) and its tree-style one-pass tableau: extending fairness expressibility of \(\mathsf{ECTL}^+\)
- One-Pass Tableaux for Computation Tree Logic
- A tableau calculus for first-order branching time logic
- A faster tableau for \(\mathrm{CTL}^{\ast}\)
- A clausal resolution method for extended computation tree logic ECTL
Specification and verification (program logics, model checking, etc.) (68Q60) Temporal logic (03B44)
Cites Work
- Rabinizer 2: Small Deterministic Automata for LTL ∖ GU
- Title not available (Why is that?)
- Model-based testing of reactive systems. Advanced lectures.
- Automatic verification of finite-state concurrent systems using temporal logic specifications
- Decision procedures and expressiveness in the temporal logic of branching time
- “Sometimes” and “not never” revisited
- Cut-free sequent systems for temporal logic
- Tableau methods for modal and temporal logics
- Dual systems of tableaux and sequents for PLTL
- Title not available (Why is that?)
- Title not available (Why is that?)
- FM 2009: Formal methods. Second world congress, Eindhoven, The Netherlands, November 2--6, 2009. Proceedings
- Title not available (Why is that?)
Cited In (1)
Uses Software
This page was built for publication: Extending fairness expressibility of ECTL\(^+\): a tree-style one-pass tableau approach
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5079769)
