scientific article; zbMATH DE number 4016870

MaRDI QIDQ3028984zbMATH OpenFDO

Authors M. C. Browne, Orna Grumberg, Edmund Clarke

Publication date 1987

zbMATH Keywords

bisimulationfinite Kripke structurepolynomial algorithmreasoning about concurrent systemsshutteringtemporal logics

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Logic in computer science (03B70) Theory of operating systems (68N25) Abstract data types; algebraic specification (68Q65)

Recommendations

• Characterizing finite Kripke structures in propositional temporal logic
• “Sometimes” and “not never” revisited
• The temporal logic of branching time
• scientific article; zbMATH DE number 1536555
• scientific article; zbMATH DE number 4119600

Cited in

(17)

• Characterizing finite Kripke structures in propositional temporal logic
• A model checker for linear time temporal logic
• Positive announcements
• Characteristic invariants in Hennessy-Milner logic
• Semantics for knowledge and change of awareness
• Parameter Synthesis for Timed Kripke Structures
• Temporal normal form for linear temporal logic formulae
• On the definability of simulability and bisimilarity by finite epistemic models
• scientific article; zbMATH DE number 177516 (Why is no real title available?)
• Equivalences for fair Kripke structures
• Refinement modal logic
• A topological characterization of weakness
• To be announced
• Encapsulating deontic and branching time specifications
• A generalized nexttime operator in temporal logic
• Branching versus linear logics yet again
• SnS can be modally characterized

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