scientific article; zbMATH DE number 3993549

MaRDI QIDQ4722045zbMATH OpenFDO

Authors Chin-Laung Lei, E. Allen Emerson

Publication date 1986

zbMATH Keywords

branching temporal logicdecision procedureFair Computation Tree Logicfairness propertiesparallelismtense logic

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Logic in computer science (03B70)

Recommendations

• “Sometimes” and “not never” revisited
• Modalities for model checking: Branching time logic strikes back
• The temporal logic of branching time
• Decision procedures and expressiveness in the temporal logic of branching time
• Temporal logic and fair discrete systems

Cited in

(14)

• 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)