An Algorithm for Direct Construction of Complete Merged Processes

DOI10.1007/978-3-642-21834-7_6zbMath1330.68206OpenAlexW53550045MaRDI QIDQ3011883

Andrey Mokhov, Victor Khomenko

Publication date: 29 June 2011

Published in: Applications and Theory of Petri Nets (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-21834-7_6

zbMATH Keywords

model checkingSATunravellingPetri net unfolding2QBFmerged process

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items

A geometric view of partial order reduction ⋮ Compact and efficiently verifiable models for concurrent systems ⋮ Untanglings: a novel approach to analyzing concurrent systems ⋮ An Algorithm for Direct Construction of Complete Merged Processes ⋮ Flow Unfolding of Multi-clock Nets

Uses Software

• MiniSat
• Chaff

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Merged processes: a new condensed representation of Petri net behaviour
• Branching processes of Petri nets
• The polynomial-time hierarchy
• An improvement of McMillan's unfolding algorithm
• Canonical prefixes of Petri net unfoldings
• Unfoldings: A partial-order approach to model checking.
• An Algorithm for Direct Construction of Complete Merged Processes
• McMillan’s Complete Prefix for Contextual Nets
• Complete Finite Prefixes of Symbolic Unfoldings of Safe Time Petri Nets
• Theory and Applications of Satisfiability Testing
• Formal Techniques for Networked and Distributed Systems – FORTE 2004