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...

Teljes leírás

Elmentve itt :
Bibliográfiai részletek
Szerzők: Țiplea Ferucio Laurenţiu
Katsura Masashi
Ito Masami
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
LEADER 01640nab a2200241 i 4500
001 acta12562
005 20220613145241.0
008 161015s1996 hu o 0|| eng d
022 |a 0324-721X 
040 |a SZTE Egyetemi Kiadványok Repozitórium  |b hun 
041 |a eng 
100 1 |a Țiplea Ferucio Laurenţiu 
245 1 3 |a On a normal form of Petri nets  |h [elektronikus dokumentum] /  |c  Țiplea Ferucio Laurenţiu 
260 |c 1996 
300 |a 295-308 
490 0 |a Acta cybernetica  |v 12 No. 3 
520 3 |a 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. 
650 4 |a Természettudományok 
650 4 |a Számítás- és információtudomány 
695 |a Számítástechnika, Kibernetika 
700 0 1 |a Katsura Masashi  |e aut 
700 0 1 |a Ito Masami  |e aut 
856 4 0 |u http://acta.bibl.u-szeged.hu/12562/1/cybernetica_012_numb_003_295-308.pdf  |z Dokumentum-elérés