Finite and Circular Path Models for Branching Time Logics

DOI10.1093/LOGCOM/1.1.71MaRDI QIDQ5753939zbMATH OpenOpenAlexFDO

Authors Michael Kaminski, Michael Tiomkin

Publication date 1990

Published in Journal Of Logic And Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1093/logcom/1.1.71

zbMATH Keywords

branching time logicsnon-deterministic programspath modelstemporal logic

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Logic in computer science (03B70) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Semantics in the theory of computing (68Q55)

Recommendations

• Branching-time logics with path relativisation
• Branching-Time Temporal Logics with Minimal Model Quantifiers
• A New Approach to Bounded Model Checking for Branching Time Logics
• Branching-time logic with quantification over branches: The point of view of modal logic
• scientific article; zbMATH DE number 177267
• scientific article; zbMATH DE number 177521
• On the Complexity of Branching-Time Logics
• The decision problem for branching time logic
• Modalities for model checking: Branching time logic strikes back
• Decision procedures and expressiveness in the temporal logic of branching time

Cited in

(2)

• A branching time logic with past operators
• Path logics with synchronization

This page was built for publication: Finite and Circular Path Models for Branching Time Logics

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5753939)