The Confluence Property for Petri Nets and its Applications

  • Authors:

  • Ioana Leahu;Ferucio Laurentiu Tiplea

  • Affiliations:

  • "Al. I. Cuza" University of Iasi, Romania;"Al. I. Cuza" University of Iasi, Romania

  • Venue:
  • SYNASC '06 Proceedings of the Eighth International Symposium on Symbolic and Numeric Algorithms for Scientific Computing
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

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.