Abstract
For k ≥ 2, let Rk be the ring consisting of k identical copies C0, C1,..., Ck-1 of a component C, where C is given as a Petri net. Assume that all components of Rk except possibly C0 have an identical initial marking. We consider the problem of testing whether all rings Rk, 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 language | English |
---|---|
Pages (from-to) | 3180-3185 |
Number of pages | 6 |
Journal | Proceedings of the IEEE International Conference on Systems, Man and Cybernetics |
Volume | 4 |
Publication status | Published - 1996 |
Externally published | Yes |
Event | Proceedings of the 1996 IEEE International Conference on Systems, Man and Cybernetics. Part 4 (of 4) - Beijing, China Duration: Oct 14 1996 → Oct 17 1996 |
All Science Journal Classification (ASJC) codes
- Control and Systems Engineering
- Hardware and Architecture