Classifications of Petri net transitions and their application to firing sequence and reachability problems

Author

Huang, Jeng S. ; Murata, Tadao

Author_Institution

Dept. of Electr. Eng. & Comput. Sci., Illinois Univ., Chicago, IL, USA

Volume

1

fYear

1997

fDate

12-15 Oct 1997

Firstpage

263

Abstract

Introduces behavioral and structural classifications of transitions that are useful for finding “legal” transition sequences in Petri nets. Our classifications provide some useful information on whether or not firing a transition can lead to any token-free siphon (or deadlock) in a net. As an application, we consider the general reachability problem formulated in terms of nonnegative integer solutions of the state equation and their net representations, and show how proofs of existing reachability theorems can be simplified, and that they can be extended to a more general case

Keywords

Petri nets; computational complexity; Petri net transitions; behavioral classifications; deadlock; firing sequence; general reachability problem; legal transition sequences; net representations; nonnegative integer solutions; reachability problems; state equation; structural classifications; token-free siphon; Circuits; Equations; Fires; Instruments; Law; Legal factors; Petri nets; Reachability analysis; Sufficient conditions; System recovery;

fLanguage

English

Publisher

ieee

Conference_Titel

Systems, Man, and Cybernetics, 1997. Computational Cybernetics and Simulation., 1997 IEEE International Conference on

Conference_Location

Orlando, FL

ISSN

1062-922X

Print_ISBN

0-7803-4053-1

Type

conf

DOI

10.1109/ICSMC.1997.625760

Filename

625760