A well-structured framework for analysing Petri net extensions

DOI10.1016/J.IC.2004.01.005zbMATH Open1101.68696OpenAlexW1987557885MaRDI QIDQ1763373FDOQ1763373

Authors: Alain Finkel, Pierre McKenzie, Claudine Picaronny 

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

Recommendations

• Reduction and covering of infinite reachability trees
• Accelerations for the coverability set of Petri nets with names
• \(\omega\)-Petri nets: algorithms and complexity
• \(\omega \)-Petri nets
• Recursive Petri nets

zbMATH Keywords

Transition systems

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Parallel program schemata
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Remarks on blind and partially blind one-way multicounter machines
• Reduction and covering of infinite reachability trees
• Title not available (Why is that?)
• Well-structured transition systems everywhere!
• Title not available (Why is that?)
• Title not available (Why is that?)
• The residue of vector sets with applications to decidability problems in Petri nets
• Ordering by Divisibility in Abstract Algebras
• Title not available (Why is that?)
• Bounds for permanents of non-negative matrices
• Classes of Recursively Enumerable Sets and Their Decision Problems
• Some decision problems related to the reachability problem for Petri nets
• Title not available (Why is that?)
• 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
• Title not available (Why is that?)

Cited In (21)

• A classification of the expressive power of well-structured transition systems
• Multiset rewriting for the verification of depth-bounded processes with name binding
• About the decision of reachability for register machines
• Dynamic Recursive Petri Nets
• Automatic verification of counter systems with ranking function
• Extending the Rackoff technique to affine nets
• Coverability trees for Petri nets with unordered data
• Branch-well-structured transition systems and extensions
• Forward analysis and model checking for trace bounded WSTS
• Branch-well-structured transition systems and extensions
• Forward analysis for WSTS. III: Karp-Miller trees
• Applying regions
• Forward analysis for WSTS. III: Karp-Miller trees
• Synthesis of Petri nets with whole-place operations and localities
• Analysis of the fault tolerance of complex systems by extensions of Petri nets
• Combining free choice and time in Petri nets
• Computable fixpoints in well-structured symbolic model checking
• Handling infinitely branching well-structured transition systems
• Process of petri nets extension
• A Language-Based Comparison of Extensions of Petri Nets with and without Whole-Place Operations
• Ordinal recursive complexity of unordered data nets

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

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