Merged processes: a new condensed representation of Petri net behaviour

DOI10.1007/S00236-006-0023-YzbMath1104.68072OpenAlexW2027131958MaRDI QIDQ854679

Walter Vogler, Alex Kondratyev, Maciej Koutny, Victor Khomenko

Publication date: 6 December 2006

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00236-006-0023-y

zbMATH Keywords

model checking

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (9)

Modeling dependencies and simultaneity in membrane system computations ⋮ Untanglings: a novel approach to analyzing concurrent systems ⋮ Unnamed Item ⋮ An Algorithm for Direct Construction of Complete Merged Processes ⋮ How Much Is Worth to Remember? A Taxonomy Based on Petri Nets Unfoldings ⋮ Spreading nets: a uniform approach to unfoldings ⋮ Flow Unfolding of Multi-clock Nets ⋮ Merging Relations: A Way to Compact Petri Nets’ Behaviors Uniformly ⋮ Exploiting colored Petri nets to decide on permutation admissibility

Uses Software

• MiniSat
• Chaff

Cites Work

• Branching processes of Petri nets
• An improvement of McMillan's unfolding algorithm
• Canonical prefixes of Petri net unfoldings
• Free Choice Petri Nets
• Theory and Applications of Satisfiability Testing
• CONCUR 2005 – Concurrency Theory
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Merged processes: a new condensed representation of Petri net behaviour