A Sufficient Condition for Reachability in a General Petri Net

Authors:
Parthasarathy Ramachandran;Manjunath Kamath
Affiliations:
Department of Industrial and Management Engineering, Indian Institute of Technology Kanpur, Kanpur 208 016 UP India parthar@iitk.ac.in;School of Industrial Engineering and Management, Oklahoma State University, 322 Engineering North, Stillwater OK 74078 USA mkamath@okstate.edu
Venue:
Discrete Event Dynamic Systems
Year:
2004

Citing 10
Cited 0

A Predicate-Transition Net Model for Parallel Interpretation of Logic Programs

IEEE Transactions on Software Engineering
Branching processes of Petri nets

Acta Informatica
A technique of state space search based on unfolding

Formal Methods in System Design - Special issue on computer-aided verification (based on CAV'92 workshop)
An Improvement of McMillan's Unfolding Algorithm

TACAs '96 Proceedings of the Second International Workshop on Tools and Algorithms for Construction and Analysis of Systems
Deadlock Checking Using Net Unfoldings

CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
Decidability of reachability in vector addition systems (Preliminary Version)

STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
An acyclic transformation technique for the reachability analysis of petri nets

An acyclic transformation technique for the reachability analysis of petri nets
Unfolding Based Algorithms for the Reachability Problem

Fundamenta Informaticae - Concurrency Specification and Programming (CS&P'2000)
Reachability In Some Classes Of Acyclic Petri Nets

Fundamenta Informaticae
Reachability In Some Classes Of Acyclic Petri Nets

Fundamenta Informaticae

Quantified Score

Hi-index	0.01

Visualization

Abstract

Necessary and sufficient conditions for reachability exist only for special classes of Petri nets, acyclic Petri nets being one among them. We present a net transformation procedure that converts a general Petri net into an acyclic Petri net to utilize the available sufficient condition. We show the relationship between the reachable markings of the original Petri net and the associated acyclic Petri net. Given a firing count vector, we discuss how the sufficient condition for reachability in an acyclic Petri net could be utilized for a general Petri net. We also discuss the utility of the acyclic transformed net in determining the transition firing sequences of the reachable markings with known firing count vectors.