Amanote Research
Register
Sign In
The Recursive Equivalence of the Reachability Problem and the Liveness Problem for Petri Nets and Vector Addition Systems
doi 10.1109/swat.1974.28
Full Text
Open PDF
Abstract
Available in
full text
Date
October 1, 1974
Authors
Michel Hack
Publisher
IEEE
Related search
The Reachability Problem for Petri Nets Is Not Elementary
The Reachability Problem for Branching Vector Addition Systems Requires Doubly-Exponential Space
Information Processing Letters
Signal Processing
Computer Science Applications
Information Systems
Theoretical Computer Science
Compositional Reachability in Petri Nets
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
On Minimality and Equivalence of Petri Nets
Fundamenta Informaticae
Information Systems
Algebra
Number Theory
Mathematics
Computational Theory
Theoretical Computer Science
Time-Independent Liveness in Time Petri Nets
Fundamenta Informaticae
Information Systems
Algebra
Number Theory
Mathematics
Computational Theory
Theoretical Computer Science
On Deadlockability, Liveness and Reversibility in Subclasses of Weighted Petri Nets
Fundamenta Informaticae
Information Systems
Algebra
Number Theory
Mathematics
Computational Theory
Theoretical Computer Science
On State-Space Compression and State Reachability Retrieval of Petri Nets
Advances in Mechanical Engineering
Mechanical Engineering
Strong Shift Equivalence Theory and the Shift Equivalence Problem
Bulletin of the American Mathematical Society
Mathematics
Applied Mathematics
A Class of Petri Nets That a Necessary and Sufficient Condition for Reachability Is Obtainable
Transactions of the Society of Instrument and Control Engineers
