loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Eighth International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC'06)
The Confluence Property for Petri Nets and its Applications
Timisoara, Romania
September 26-September 29
ISBN: 0-7695-2740-X
Ioana Leahu, "Al. I. Cuza" University of Iasi, Romania
Ferucio Laurentiu Tiplea, "Al. I. Cuza" University of Iasi, Romania
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.
Citation:
Ioana Leahu, Ferucio Laurentiu Tiplea, "The Confluence Property for Petri Nets and its Applications," synasc, pp.430-436, Eighth International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC'06), 2006
Usage of this product signifies your acceptance of the Terms of Use.