Volume: 20, Issue: 4(2009)
pp. 581-596 DOI: 10.1142/S0129054109006759
|
|
Abstract |
Full Text (PDF, 275KB)
|
References
|
 |
| Title: |
PATH DECOMPOSITION AND SEMILINEARITY OF PETRI NETS |
| Author(s): |
HSU-CHUN YEN
Research supported in part by National Science Council Grant NSC-96-2221-E-002-028 and National Taiwan University Grant 95R0062-AE00-05.
Dept. of Electrical Engineering, National Taiwan University, Taipei, Taiwan, R.O.C.
Dept. of Computer Science, Kainan University, Taoyuan, Taiwan, R.O.C.
|
| History: |
Received 9 May 2009
Accepted 25 June 2009
|
| Abstract: |
Semilinearity plays a key role not only in formal languages but also in the study of Petri nets. Although the reachability set of a Petri net may not be semilinear in general, there are a wide variety of subclasses of Petri nets which enjoy having semilinear reachability sets. In this paper, we develop sufficient conditions for Petri nets under which semilinearity is guaranteed. Our approach, based on the idea of path decomposition, can be used for consolidating several existing semilinearity results as well as for deriving new results all under the same framework. |
| Keywords: |
Petri net; reachability; semilinear set
|
|
|
