scientific article; zbMATH DE number 3993549
[For the entire collection see Zbl 0578.00004.] Branching tense logics are in certain ways preferable to linear tense logics for use in the design of correct concurrent programs. But they are problematic in two respects, expressive power and complexity of decision procedure. The authors present a branching temporal logic they call Fair Computation Tree Logic which can express a range of fairness properties: impartiality, strong fairness, limited looping fairness, etc. They then prove a Small Model theorem for FCTL and show that this leads to a decision procedure for FCTL which is of deterministic, single- exponential-time complexity.
- Control machines: A new model of parallelism for compositional specifications and their effective compilation
- Solving parity games via priority promotion
- Branching-time logic \(\mathsf{ECTL}^{\#}\) and its tree-style one-pass tableau: extending fairness expressibility of \(\mathsf{ECTL}^+\)
- Diagnosability of fair transition systems
- Robust worst cases for parity games algorithms
- Checking extended CTL properties using guarded quotient structures
- Reasoning About Substructures and Games
- Justice Delayed Is Justice Denied: Logics for a Temporal Account of Reparations and Legal Compliance
- Extending fairness expressibility of ECTL^+: a tree-style one-pass tableau approach
- Branching-time logics and fairness, revisited
- Assumption-based runtime verification
- Towards a grand unification of Büchi complementation constructions
- Searching for ribbon-shaped paths in fair transition systems
- A unified approach for showing language inclusion and equivalence between various types of -automata
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4722045)