Analyzing Reachability for Some Petri Nets With Fast Growing Markings

Authors:
M. Praveen;Kamal Lodaya
Affiliations:
The Institute of Mathematical Sciences, CIT Campus, Chennai 600113, India;The Institute of Mathematical Sciences, CIT Campus, Chennai 600113, India
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2008

Citing 13
Cited 2

Linear algebraic techniques for place/transition nets

Advances in Petri nets 1986, part I on Petri nets: central models and their properties
The mathematics of Petri nets

The mathematics of Petri nets
A structure to decide reachability in Petri nets

Theoretical Computer Science
Complexity results for 1-safe nets

Theoretical Computer Science
Linear Algebra in Net Theory

Proceedings of the Advanced Course on General Net Theory of Processes and Systems: Net Theory and Applications
Linear Algebraic and Linear Programming Techniques for the Analysis of Place or Transition Net Systems

Lectures on Petri Nets I: Basic Models, Advances in Petri Nets, the volumes are based on the Advanced Course on Petri Nets
Basic Linear Algebraic Techniques for Place or Transition Nets

Lectures on Petri Nets I: Basic Models, Advances in Petri Nets, the volumes are based on the Advanced Course on Petri Nets
Decidability and Complexity of Petri Net Problems - An Introduction

Lectures on Petri Nets I: Basic Models, Advances in Petri Nets, the volumes are based on the Advanced Course on Petri Nets
Mathematical methods for calculating invariants in Petri nets

Advances in Petri Nets 1987, covers the 7th European Workshop on Applications and Theory of Petri Nets
Decidability of reachability in vector addition systems (Preliminary Version)

STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
An algorithm for the general Petri net reachability problem

STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
Parallel program schemata

Journal of Computer and System Sciences
A reachability algorithm for general petri nets based on transition invariants

MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science

Modeling a flexible manufacturing cell using stochastic Petri nets with fuzzy parameters

Expert Systems with Applications: An International Journal
Checking system boundedness using ordinary differential equations

Information Sciences: an International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

Using linear algebraic techniques, we analyse the computational complexity of testing reachability in Petri nets for which markings can grow very fast. This leads to two subclasses of Petri nets for which the reachability problem is PSPACE-complete. These subclasses are not contained in any other subclass for which complexity of the reachability problem was known, such as those given in Esparza and Nielsen's survey [Esparza, J. and M. Nielsen, Decidability issues for Petri nets - a survey, J. Inform. Process. Cybernet. 30 (1994), pp. 143-160]. We give an example where further extension of our subclasses fails to maintain the upper bound.