On a normal form of Petri nets

Țiplea Ferucio Laurenţiu and Katsura Masashi and Ito Masami: On a normal form of Petri nets. In: Acta cybernetica, (12) 3. pp. 295-308. (1996)

[thumbnail of cybernetica_012_numb_003_295-308.pdf]
Cikk, tanulmány, mű

Download (757kB) | Preview


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.

Item Type: Article
Journal or Publication Title: Acta cybernetica
Date: 1996
Volume: 12
Number: 3
ISSN: 0324-721X
Page Range: pp. 295-308
Language: English
Place of Publication: Szeged
Related URLs: http://acta.bibl.u-szeged.hu/38501/
Uncontrolled Keywords: Számítástechnika, Kibernetika
Additional Information: Bibliogr.: p. 307-308. ; összefoglalás angol nyelven
Subjects: 01. Natural sciences
01. Natural sciences > 01.02. Computer and information sciences
Date Deposited: 2016. Oct. 15. 12:26
Last Modified: 2022. Jun. 13. 14:52
URI: http://acta.bibl.u-szeged.hu/id/eprint/12562

Actions (login required)

View Item View Item