On a normal form of Petri nets
A Petri net is called (n, m)-transition restricted if its weight function takes values in {0,1 } and 1 < |*£| < n and 1 < |i*| < m for all transitions t. Using the results from [6] it has been proved ([13]) that any A-labelled Petri net is equivalent to a A-labelled (2, 2)-transition res...
Elmentve itt :
| Szerzők: | |
|---|---|
| Dokumentumtípus: | Cikk |
| Megjelent: |
1996
|
| Sorozat: | Acta cybernetica
12 No. 3 |
| Kulcsszavak: | Számítástechnika, Kibernetika |
| Tárgyszavak: | |
| Online Access: | http://acta.bibl.u-szeged.hu/12562 |
| Tartalmi kivonat: | A Petri net is called (n, m)-transition restricted if its weight function takes values in {0,1 } and 1 < |*£| < n and 1 < |i*| < m for all transitions t. Using the results from [6] it has been proved ([13]) that any A-labelled Petri net is equivalent to a A-labelled (2, 2)-transition restricted Petri net, with respect to the finite transition sequence behaviour. This one may be considered as a normal form of Petri nets, called the super-normal form of Petri nets, and the question is whether it preserves or not the partial words and processes of Petri nets ([13]). In this paper we show that the answer to this question is positive for partial words and negative for processes. Then some infinite hierarchies of families of partial languages generated by (labelled) (n, m)- transition restricted Petri nets, are obtained. |
|---|---|
| Terjedelem/Fizikai jellemzők: | 295-308 |
| ISSN: | 0324-721X |