On the weak adequacy of branching-time temporal logic

DOI10.1007/3-540-52592-0_75MaRDI QIDQ4038673zbMATH OpenFDO

Authors Sophie Pinchinat, Philippe Schnoebelen

Publication date 18 May 1993

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-52592-0_75

zbMATH Keywords

bisimulation semanticsbranching-time temporal logicnon-deterministic programsobservational equivalencesparallel programs

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• “Sometimes” and “not never” revisited
• The temporal logic of branching time
• scientific article; zbMATH DE number 3878351
• Three logics for branching bisimulation
• scientific article; zbMATH DE number 4119600

Cited in

(3)

• Expressive completeness failure in branching time structures
• Weakest precondition semantics for time and concurrency
• Sublogics of a branching time logic of robustness

This page was built for publication: On the weak adequacy of branching-time temporal logic

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