Keywords
LivenessReachabilityPetri netEquivalence (formal languages)Stochastic Petri netReachability problemComputer scienceTheoretical computer scienceProcess architectureMathematicsDiscrete mathematicsAlgorithm
Affiliated Institutions
Related Publications
An Algorithm for the General Petri Net Reachability Problem
An algorithm is presented for the general Petri net reachability problem. It is based on a generalization of the basic reachability tree construction which is made symmetric wit...
Stochastic Petri net representation of discrete event simulations
In the context of discrete event simulation, the marking of a stochastic Petri net (SPN) corresponds to the state of the underlying stochastic process of the simulation and the ...
A partial solution to the reachability-problem for vector-addition systems
With geometrical techniques we hope to bring new insight into the reachability problem for vector-addition systems, which is pertaining in many areas in computer science theory ...
Petri nets: Properties, analysis and applications
Starts with a brief review of the history and the application areas considered in the literature. The author then proceeds with introductory modeling examples, behavioral and st...
Publication Info
- Year
- 1974
- Type
- article
- Pages
- 156-164
- Citations
- 62
- Access
- Closed
External Links
Social Impact
Altmetric
PlumX Metrics
Social media, news, blog, policy document mentions
Citation Metrics
62
OpenAlex
Cite This
M. Hack
(1974).
The recursive equivalence of the reachability problem and the liveness problem for Petri nets and vector addition systems.
, 156-164.
https://doi.org/10.1109/swat.1974.28
Identifiers
- DOI
- 10.1109/swat.1974.28