A well-structured framework for analysing Petri net extensions

DOI10.1016/j.ic.2004.01.005zbMath1101.68696OpenAlexW1987557885MaRDI QIDQ1763373

Pierre McKenzie, Claudine Picaronny, Alain Finkel

Publication date: 22 February 2005

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ic.2004.01.005

zbMATH Keywords

Transition systems

Mathematics Subject Classification ID

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

Related Items (17)

Forward analysis and model checking for trace bounded WSTS ⋮ Synthesis of Petri Nets with Whole-Place Operations and Localities ⋮ Branch-well-structured transition systems and extensions ⋮ Dynamic Recursive Petri Nets ⋮ Handling infinitely branching well-structured transition systems ⋮ Computable fixpoints in well-structured symbolic model checking ⋮ Ordinal recursive complexity of unordered data nets ⋮ Automatic Verification of Counter Systems With Ranking Function ⋮ A classification of the expressive power of well-structured transition systems ⋮ About the decision of reachability for register machines ⋮ Multiset rewriting for the verification of depth-bounded processes with name binding ⋮ Applying regions ⋮ A Language-Based Comparison of Extensions of Petri Nets with and without Whole-Place Operations ⋮ Combining free choice and time in Petri nets ⋮ Coverability Trees for Petri Nets with Unordered Data ⋮ Unnamed Item ⋮ Unnamed Item

Cites Work

• The residue of vector sets with applications to decidability problems in Petri nets
• Petri nets: central models and their properties. Advances in Petri nets 1986, Part I. Proceedings of an advanced course, Bad Honnef, September 8--19, 1986
• Reduction and covering of infinite reachability trees
• Some decision problems related to the reachability problem for Petri nets
• Remarks on blind and partially blind one-way multicounter machines
• Parallel program schemata
• Bounds for permanents of non-negative matrices
• Ordering by Divisibility in Abstract Algebras
• Classes of Recursively Enumerable Sets and Their Decision Problems
• Well-structured transition systems everywhere!
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A well-structured framework for analysing Petri net extensions