Canonical prefixes of Petri net unfoldings

DOI10.1007/s00236-003-0122-yzbMath1072.68072OpenAlexW2899793400MaRDI QIDQ1889762

Victor Khomenko, Maciej Koutny, Walter Vogler

Publication date: 9 December 2004

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

Full work available at URL: https://doi.org/10.1007/s00236-003-0122-y

zbMATH Keywords

unfolding algorithm

Mathematics Subject Classification ID

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

Related Items (28)

Branching Processes of Timed Petri Nets ⋮ On the well-foundedness of adequate orders used for construction of complete unfolding prefixes ⋮ Merged processes: a new condensed representation of Petri net behaviour ⋮ Verification of bounded Petri nets using integer programming ⋮ Multilevel transitive and intransitive non-interference, causally ⋮ Computing the reveals relation in occurrence nets ⋮ Recent advances in unfolding technique ⋮ An algebraic approach to revising propositional rule-based knowledge bases ⋮ Untanglings: a novel approach to analyzing concurrent systems ⋮ Efficient unfolding of contextual Petri nets ⋮ Deadlock detection-oriented unfolding of unbounded Petri nets ⋮ ``Truly concurrent and nondeterministic semantics of discrete-time Petri nets ⋮ Efficient Trace Encodings of Bounded Synthesis for Asynchronous Distributed Systems ⋮ A compositional Petri net translation of general \(\pi\)-calculus terms ⋮ Trellis processes: a compact representation for runs of concurrent systems ⋮ An Algorithm for Direct Construction of Complete Merged Processes ⋮ Spreading nets: a uniform approach to unfoldings ⋮ Petri games: synthesis of distributed systems with causal memory ⋮ Flow Unfolding of Multi-clock Nets ⋮ Non-interference by Unfolding ⋮ Directed Unfolding of Petri Nets ⋮ Unnamed Item ⋮ A theory of structural stationarity in the \(\pi\)-calculus ⋮ STG decomposition strategies in combination with unfolding ⋮ A Practical Approach to Verification of Mobile Systems Using Net Unfoldings ⋮ Towards Efficient Verification of Systems with Dynamic Process Creation ⋮ Observable liveness of Petri nets ⋮ Generalized mapping for multiset rewriting systems

This page was built for publication: Canonical prefixes of Petri net unfoldings