### 抜粋

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.

元の言語 | 英語 |
---|---|

ページ（範囲） | 3180-3185 |

ページ数 | 6 |

ジャーナル | Proceedings of the IEEE International Conference on Systems, Man and Cybernetics |

巻 | 4 |

出版物ステータス | 出版済み - 12 1 1996 |

イベント | Proceedings of the 1996 IEEE International Conference on Systems, Man and Cybernetics. Part 4 (of 4) - Beijing, China 継続期間: 10 14 1996 → 10 17 1996 |

### All Science Journal Classification (ASJC) codes

- Control and Systems Engineering
- Hardware and Architecture

## フィンガープリント Periodic structure and liveness of Petri net rings' の研究トピックを掘り下げます。これらはともに一意のフィンガープリントを構成します。

## これを引用

*Proceedings of the IEEE International Conference on Systems, Man and Cybernetics*,

*4*, 3180-3185.