A partial order approach to branching time logic model checking.

DOI10.1006/inco.1998.2778zbMath1045.68588MaRDI QIDQ1854268

Doron A. Peled, Wojciech Penczek, Rob Gerth, Ruurd Kuiper

Publication date: 14 January 2003

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://research.tue.nl/nl/publications/a-partial-order-approach-to-branching-time-logic-model-checking(97bbfaef-a151-4087-a869-c3564e1ec4ad).html

zbMATH Keywords

assertional language

Mathematics Subject Classification ID

03B70: Logic in computer science

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

68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)

03B44: Temporal logic

Related Items

Confluence for process verification, Translating Java for multiple model checkers: The Bandera back-end, Question-guided stubborn set methods for state properties, On stubborn sets in the verification of linear time temporal properties, Towards Partial Order Reduction for Model Checking Temporal Epistemic Logic

Cites Work

• Characterizing finite Kripke structures in propositional temporal logic
• A calculus of communicating systems
• Automatic verification of finite-state concurrent systems using temporal logic specifications
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item