Keywords
Undecidable problemReachabilityReachability problemPetri netDecidabilityMathematicsSimple (philosophy)Exposition (narrative)Inclusion (mineral)Discrete mathematicsAlgebra over a fieldCombinatoricsAlgorithmPure mathematics
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...
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 ...
Publication Info
- Year
- 1976
- Type
- article
- Volume
- 2
- Issue
- 1
- Pages
- 77-95
- Citations
- 117
- Access
- Closed
External Links
Social Impact
Altmetric
PlumX Metrics
Social media, news, blog, policy document mentions
Citation Metrics
117
OpenAlex
Cite This
M. Hack
(1976).
The equality problem for vector addition systems is undecidable.
Theoretical Computer Science
, 2
(1)
, 77-95.
https://doi.org/10.1016/0304-3975(76)90008-6
Identifiers
- DOI
- 10.1016/0304-3975(76)90008-6