An algorithm for direct construction of complete merged processes
From MaRDI portal
Recommendations
Cites work
- An algorithm for direct construction of complete merged processes
- An improvement of McMillan's unfolding algorithm
- Branching processes of Petri nets
- Canonical prefixes of Petri net unfoldings
- Complete Finite Prefixes of Symbolic Unfoldings of Safe Time Petri Nets
- Formal Techniques for Networked and Distributed Systems – FORTE 2004
- scientific article; zbMATH DE number 1302047 (Why is no real title available?)
- scientific article; zbMATH DE number 1304999 (Why is no real title available?)
- scientific article; zbMATH DE number 1337888 (Why is no real title available?)
- scientific article; zbMATH DE number 1903342 (Why is no real title available?)
- McMillan’s Complete Prefix for Contextual Nets
- Merged processes: a new condensed representation of Petri net behaviour
- The polynomial-time hierarchy
- Theory and Applications of Satisfiability Testing
- Unfoldings: A partial-order approach to model checking.
Cited in
(9)- Compact and efficiently verifiable models for concurrent systems
- A geometric view of partial order reduction
- An algorithm for direct construction of complete merged processes
- scientific article; zbMATH DE number 4037177 (Why is no real title available?)
- scientific article; zbMATH DE number 177854 (Why is no real title available?)
- Flow unfolding of multi-clock nets
- Contextual merged processes
- Merging relations: a way to compact Petri nets' behaviors uniformly
- Untanglings: a novel approach to analyzing concurrent systems
This page was built for publication: An algorithm for direct construction of complete merged processes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3011883)