On the complexity of partial order trace model checking

DOI10.1016/J.IPL.2007.10.013zbMATH Open1186.68299OpenAlexW1985465033MaRDI QIDQ963347FDOQ963347

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

• Title not available (Why is that?)
• Title not available (Why is that?)
• Model checking a path (preliminary report)
• Detection of global predicates: techniques and their limitations
• Testing Distributed Systems Through Symbolic Model Checking
• Principles of Distributed Systems

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)