Extending fairness expressibility of ECTL^+: a tree-style one-pass tableau approach
From MaRDI portal
Publication:5079769
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
Cites work
- scientific article; zbMATH DE number 3887063 (Why is no real title available?)
- scientific article; zbMATH DE number 4011921 (Why is no real title available?)
- scientific article; zbMATH DE number 1142326 (Why is no real title available?)
- scientific article; zbMATH DE number 3993549 (Why is no real title available?)
- Automatic verification of finite-state concurrent systems using temporal logic specifications
- Cut-free sequent systems for temporal logic
- Decision procedures and expressiveness in the temporal logic of branching time
- Dual systems of tableaux and sequents for PLTL
- FM 2009: Formal methods. Second world congress, Eindhoven, The Netherlands, November 2--6, 2009. Proceedings
- Model-based testing of reactive systems. Advanced lectures.
- Rabinizer 2: small deterministic automata for \(\mathrm{LTL}_{ \setminus\mathbf{GU}}\)
- Tableau methods for modal and temporal logics
- “Sometimes” and “not never” revisited
Cited in
(2)
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)
