Efficient model checking for LTL with partial order snapshots

DOI10.1016/J.TCS.2009.03.002MaRDI QIDQ732005zbMATH OpenOpenAlexFDO

Authors Peter Niebert, Doron 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

model checkingconcurrencytemporal logicssnapshotsPartial order semantics

Mathematics Subject Classification ID

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

Recommendations

• Tools and Algorithms for the Construction and Analysis of Systems
• TEMPORAL LOGICS FOR TRACE SYSTEMS: ON AUTOMATED VERIFICATION
• Local model checking in a logic for true concurrency
• Tools and Algorithms for the Construction and Analysis of Systems
• Deciding global partial-order properties

Cites work

• scientific article; zbMATH DE number 1223711 (Why is no real title available?)
• Communicating sequential processes
• Detection of global predicates: techniques and their limitations
• Proving partial order properties
• Reasoning about infinite computations
• Relationships between nondeterministic and deterministic tape complexities
• The complexity of propositional linear temporal logics
• Tools and Algorithms for the Construction and Analysis of Systems

Cited in

(2)

• Tools and Algorithms for the Construction and Analysis of Systems
• 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

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