Plain, Bounded, Reversible, Persistent, and k-marked Petri Nets Have Marked Graph Reachability Graphs.
Eike BestHarro WimmelPublished in: RP (2016)
Keyphrases
- petri net
- graph theory
- graph representation
- directed graph
- graph structure
- bounded treewidth
- discrete event systems
- graph matching
- petri net model
- manufacturing systems
- weighted graph
- graph theoretic
- graph construction
- fuzzy petri net
- undirected graph
- graph databases
- graph structures
- labeled graphs
- bounded degree
- discrete dynamical systems
- ims ld
- state machines
- colored petri nets
- service composition
- graph data
- graph mining
- knowledge acquisition
- distributed systems