Efficient model checking for LTL with partial order snapshots

DOI10.1016/J.TCS.2009.03.002zbMath1187.68317OpenAlexW1518788150MaRDI QIDQ732005

Peter Niebert, Doron A. Peled

Publication date: 9 October 2009

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2009.03.002

zbMATH Keywords

snapshotsmodel checkingconcurrencytemporal logicsPartial order semantics

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Proving partial order properties
• Reasoning about infinite computations
• Relationships between nondeterministic and deterministic tape complexities
• The complexity of propositional linear temporal logics
• Communicating sequential processes
• Tools and Algorithms for the Construction and Analysis of Systems

This page was built for publication: Efficient model checking for LTL with partial order snapshots