On the complexity of partial order trace model checking

DOI10.1016/J.IPL.2007.10.013MaRDI QIDQ963347zbMATH OpenOpenAlexFDO

Authors Thierry Massart, Cédric Meuter, Laurent Van Begin

Publication date 19 April 2010

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.384.7774

zbMATH Keywords

computational complexitydistributed systemsformal methods

Mathematics Subject Classification ID

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

Cites work

• scientific article; zbMATH DE number 1670563 (Why is no real title available?)
• scientific article; zbMATH DE number 3888913 (Why is no real title available?)
• Detection of global predicates: techniques and their limitations
• Model checking a path (preliminary report)
• Principles of Distributed Systems
• Testing Distributed Systems Through Symbolic Model Checking

This page was built for publication: On the complexity of partial order trace model checking

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