Bounded self-stabilizing Petri nets

DOI10.1007/BF01178259zbMath0826.68084OpenAlexW4234842671MaRDI QIDQ1892714

Rodney R. Howell, Louis E. Rosier, Ludmila A. Cherkasova

Publication date: 21 June 1995

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

Full work available at URL: https://doi.org/10.1007/bf01178259

zbMATH Keywords

self-stabilizationbounded Petri nets

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Completeness results for single-path Petri nets
• A new polynomial-time algorithm for linear programming
• The instability of self-stabilization
• An \(O(n^{1.5})\) algorithm to decide boundedness for conflict-free vector replacement systems
• Completeness results for conflict-free vector replacement systems
• On the reachability problem for 5-dimensional vector addition systems
• The complexity of problems involving structurally bounded and conservative Petri nets
• A structure to decide reachability in Petri nets
• Normal and sinkless Petri nets
• Complete problems for deterministic polynomial time
• Complexity of some problems in Petri nets
• The covering and boundedness problems for vector addition systems
• Relationships between nondeterministic and deterministic tape complexities
• Parallel program schemata
• An Algorithm for the General Petri Net Reachability Problem
• A class of inherently fault tolerant distributed programs
• Self-stabilizing systems in spite of distributed control
• The mutual exclusion problem

This page was built for publication: Bounded self-stabilizing Petri nets