DocumentCode
3428654
Title
The Confluence Property for Petri Nets and its Applications
Author
Leahu, Ioana ; Tiplea, Ferucio Laurentiu
Author_Institution
Fac. of Comput. Sci., "Al. I. Cuza" Univ. of Iasi
fYear
2006
fDate
Sept. 2006
Firstpage
430
Lastpage
436
Abstract
A Petri net is confluent if its firing relation is confluent, i.e., for any two reachable markings there exists a marking reachable from both of them. We prove that confluence is a decidable property for Petri nets and it is preserved by asynchronous parallel composition. Applications to Petri net structural transformations and term rewriting systems are then pointed out
Keywords
Petri nets; decidability; Petri nets; asynchronous parallel composition; confluence property; decidable property; firing relation; Algebra; Application software; Computer science; Mechanical factors; Petri nets;
fLanguage
English
Publisher
ieee
Conference_Titel
Symbolic and Numeric Algorithms for Scientific Computing, 2006. SYNASC '06. Eighth International Symposium on
Conference_Location
Timisoara
Print_ISBN
0-7695-2740-X
Type
conf
DOI
10.1109/SYNASC.2006.71
Filename
4090352
Link To Document