The Reachability Problem for Acyclic Join-Free Petri nets is NP-complete.
Ronny TredupSophie WallnerPublished in: PNSE@Petri Nets (2021)
Keyphrases
- petri net
- np complete
- np hard
- petri net model
- discrete event systems
- satisfiability problem
- computational complexity
- colored petri nets
- manufacturing systems
- fuzzy petri net
- bounded treewidth
- conjunctive queries
- conp complete
- stochastic petri net
- ims ld
- discrete dynamical systems
- state machines
- polynomial time complexity
- learning process
- artificial intelligence
- concurrent systems
- service composition
- low cost
- sequence diagrams
- control system
- acyclic conjunctive queries