Canonical prefixes of Petri net unfoldings

DOI10.1007/S00236-003-0122-YzbMATH Open1072.68072OpenAlexW2899793400MaRDI QIDQ1889762FDOQ1889762

Authors: 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

Recommendations

• scientific article; zbMATH DE number 1903382
• Goal-driven unfolding of Petri nets
• On the well-foundedness of adequate orders used for construction of complete unfolding prefixes
• Recent advances in unfolding technique
• scientific article; zbMATH DE number 1863174

zbMATH Keywords

unfolding algorithm

Mathematics Subject Classification ID

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

Cited In (31)

• Spreading nets: a uniform approach to unfoldings
• Recent advances in unfolding technique
• Goal-driven unfolding of Petri nets
• Generalized mapping for multiset rewriting systems
• Title not available (Why is that?)
• Trellis processes: a compact representation for runs of concurrent systems
• Towards Efficient Verification of Systems with Dynamic Process Creation
• Merged processes: a new condensed representation of Petri net behaviour
• Efficient unfolding of contextual Petri nets
• On the well-foundedness of adequate orders used for construction of complete unfolding prefixes
• An algebraic approach to revising propositional rule-based knowledge bases
• An algorithm for direct construction of complete merged processes
• Verification of bounded Petri nets using integer programming
• Computing the reveals relation in occurrence nets
• Branching processes of timed Petri nets
• Observable liveness of Petri nets
• Multilevel transitive and intransitive non-interference, causally
• STG decomposition strategies in combination with unfolding
• Untanglings: a novel approach to analyzing concurrent systems
• Model checking reversible systems: forwardly
• A Practical Approach to Verification of Mobile Systems Using Net Unfoldings
• Non-interference by unfolding
• Deadlock detection-oriented unfolding of unbounded Petri nets
• A theory of structural stationarity in the \(\pi\)-calculus
• Directed Unfolding of Petri Nets
• A compositional Petri net translation of general \(\pi\)-calculus terms
• Efficient trace encodings of bounded synthesis for asynchronous distributed systems
• Complete Finite Prefixes of Symbolic Unfoldings of Safe Time Petri Nets
• ``Truly concurrent and nondeterministic semantics of discrete-time Petri nets
• Petri games: synthesis of distributed systems with causal memory
• Flow unfolding of multi-clock nets

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

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