Existence of home states in Petri nets is decidable

DOI10.1016/J.IPL.2016.01.011zbMATH Open1356.68152OpenAlexW2302192021MaRDI QIDQ264201FDOQ264201

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

Recommendations

• scientific article; zbMATH DE number 1912023
• Reachability in cyclic extended free-choice systems
• Applications and Theory of Petri Nets 2004
• Decidability of the Petri net reachability problem
• scientific article; zbMATH DE number 4092785

zbMATH Keywords

concurrencyhome statesPetri netstheory of computation

Mathematics Subject Classification ID

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

Cites Work

• Petri nets with individual tokens
• Semigroups, Presburger formulas, and languages
• Rational sets in commutative monoids
• Vector Addition System Reversible Reachability Problem
• Title not available (Why is that?)
• Entscheidbarkeit bei Petri Netzen
• Self-stabilizing systems in spite of distributed control
• Free Choice Petri Nets
• Verification of Population Protocols

Cited In (8)

• On the reversibility of circular conservative Petri nets
• Structural Liveness of Immediate Observation Petri Nets
• Deciding Structural Liveness of Petri Nets
• Title not available (Why is that?)
• Applications and Theory of Petri Nets 2004
• Reversing Unbounded Petri Nets
• Reversible Computation vs. Reversibility in Petri Nets
• Structural liveness of Petri nets is \textsc{ExpSpace}-hard and decidable

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

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