Existence of home states in Petri nets is decidable

DOI10.1016/j.ipl.2016.01.011zbMath1356.68152OpenAlexW2302192021MaRDI QIDQ264201

Eike Best, Javier Esparza

Publication date: 6 April 2016

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2016.01.011

zbMATH Keywords

Petri netsconcurrencytheory of computationhome states

Mathematics Subject Classification ID

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

Related Items (5)

Reversible Computation vs. Reversibility in Petri Nets ⋮ Structural Liveness of Immediate Observation Petri Nets ⋮ Reversing Unbounded Petri Nets ⋮ Deciding Structural Liveness of Petri Nets ⋮ Structural liveness of Petri nets is \textsc{ExpSpace}-hard and decidable

Cites Work

• Unnamed Item
• Petri nets with individual tokens
• Semigroups, Presburger formulas, and languages
• Rational sets in commutative monoids
• Vector Addition System Reversible Reachability Problem
• Entscheidbarkeit bei Petri Netzen
• Self-stabilizing systems in spite of distributed control
• Free Choice Petri Nets
• Verification of Population Protocols

This page was built for publication: Existence of home states in Petri nets is decidable