Reachability In Some Classes Of Acyclic Petri Nets

Authors:
Iain A. Stewart
Affiliations:
Department of Computer Science, University College of Swansea, Swansea, SA2 8PP, U.K.
Venue:
Fundamenta Informaticae
Year:
1995

Citing 11
Cited 4

Adding equality to semantic tableaux

Journal of Automated Reasoning
Foundations of logic programming; (2nd extended ed.)

Foundations of logic programming; (2nd extended ed.)
Completeness results for conflict-free vector replacement systems

Journal of Computer and System Sciences
On questions of fairness and temporal logic for conflict-free Petri nets

Advances in Petri Nets 1988
First-order logic and automated theorem proving

First-order logic and automated theorem proving
Reachability in reversible free choice systems

STACS 91 Proceedings of the 8th annual symposium on Theoretical aspects of computer science
Branching processes of Petri nets

Acta Informatica
An algorithm for reasoning about equality

Communications of the ACM
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Decidability of reachability in vector addition systems (Preliminary Version)

STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Exponential space complete problems for Petri nets and commutative semigroups (Preliminary Report)

STOC '76 Proceedings of the eighth annual ACM symposium on Theory of computing

A Sufficient Condition for Reachability in a General Petri Net

Discrete Event Dynamic Systems
Processes of Petri Nets with Range Testing

Fundamenta Informaticae - Half a Century of Inspirational Research: Honoring the Scientific Influence of Antoni Mazurkiewicz
Context-Bounded Analysis for Concurrent Programs with Dynamic Creation of Threads

TACAS '09 Proceedings of the 15th International Conference on Tools and Algorithms for the Construction and Analysis of Systems: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009,
Processes of Petri Nets with Range Testing

Fundamenta Informaticae - Half a Century of Inspirational Research: Honoring the Scientific Influence of Antoni Mazurkiewicz

Quantified Score

Hi-index	0.00

Visualization

Abstract

We motivate the study of certain classes of acyclic Petri nets and consider the reachability problem for these classes of Petri nets, providing various NP-completeness results. We also show how the reachability problem for the class of acyclic elementary net systems appears to be harder than it is for the (seemingly comparable) class of 1-bounded acyclic Petri nets.