Periodic structure and liveness of Petri net rings

Jianan Li, Ichiro Suzuki, Masafumi Yamashita

Research output: Contribution to journalConference article

Abstract

For k ≥ 2, let R k be the ring consisting of k identical copies C 0 , C 1 ,..., C k-1 of a component C, where C is given as a Petri net. Assume that all components of R k except possibly C 0 have an identical initial marking. We consider the problem of testing whether all rings R k , k ≥ 2, are live, for the case when the rings are either state machines or marked graphs. We present various sufficient conditions under which all rings are live, and discuss the complexity issue of testing the liveness of marked graph rings. Such conditions can greatly simplify the analysis of large scale process rings given as a Petri net.

Original languageEnglish
Pages (from-to)3180-3185
Number of pages6
JournalProceedings of the IEEE International Conference on Systems, Man and Cybernetics
Volume4
Publication statusPublished - Dec 1 1996
EventProceedings of the 1996 IEEE International Conference on Systems, Man and Cybernetics. Part 4 (of 4) - Beijing, China
Duration: Oct 14 1996Oct 17 1996

All Science Journal Classification (ASJC) codes

  • Control and Systems Engineering
  • Hardware and Architecture

Fingerprint Dive into the research topics of 'Periodic structure and liveness of Petri net rings'. Together they form a unique fingerprint.

  • Cite this