Petri nets with simple circuits

Authors:
Hsu-Chun Yen;Lien-Po Yu
Affiliations:
Dept. of Electrical Eng., National Taiwan University, Taipei, Taiwan, R.O.C;Dept. of Electrical Eng., National Taiwan University, Taipei, Taiwan, R.O.C
Venue:
COCOON'03 Proceedings of the 9th annual international conference on Computing and combinatorics
Year:
2003

Citing 10
Cited 0

On questions of fairness and temporal logic for conflict-free Petri nets

Advances in Petri Nets 1988
A unified approach for deciding the existence of certain Petri net paths

Information and Computation
Normal and sinkless Petri nets

Journal of Computer and System Sciences
On the regularity of Petri net languages

Information and Computation
On reachability equivalence for BPP-nets

Theoretical Computer Science
A Decompositional Approach for Computing Least Fixed-Pointsof Datalog Programs with Z-Counters

Constraints
Proving Safety Properties of Infinite State Systems by Compilation into Presburger Arithmetic

CONCUR '97 Proceedings of the 8th International Conference on Concurrency Theory
Weak Bisimulation and Model Checking for Basic Parallel Processes

Proceedings of the 16th Conference on Foundations of Software Technology and Theoretical Computer Science
Decidability of reachability in vector addition systems (Preliminary Version)

STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Petri Nets, Commutative Context-Free Grammars, and Basic Parallel Processes

Fundamenta Informaticae

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study the complexity of the reachability problem for a new subclass of Petri nets called simple-circuit Petri nets, which properly contains several well known subclasses such as conflict-free, BPP, normal Petri nets and more. A new decomposition approach is applied to developing an integer linear programming formulation for characterizing the reachability sets of such Petri nets. Consequently, the reachability problem is shown to be NP-complete. The model checking problem for some temporal logics is also investigated for simple-circuit Petri nets.