Ioana Leahu

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
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(More)
  • 1