Model checking with finite complete prefixes is PSPACE-complete

DOI10.1007/3-540-44618-4_10MaRDI QIDQ4536597zbMATH OpenFDO

Authors Keijo Heljanko

Publication date 28 November 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-44618-4_10

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Model checking using net unfoldings
• Towards an efficient algorithm for unfolding Petri nets
• Model checking using net unfoldings
• scientific article; zbMATH DE number 2088661
• Unfoldings of unbounded Petri nets

Cited in

(1)

• The complexity of achievement and maintenance problems in agent-based systems

This page was built for publication: Model checking with finite complete prefixes is PSPACE-complete

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