Optimal Label Splitting for Embedding an LTS into an arbitrary Petri Net Reachability Graph is NP-complete.
Uli SchlachterHarro WimmelPublished in: CoRR (2020)
Keyphrases
- petri net
- np complete
- polynomial time complexity
- manufacturing systems
- high level petri nets
- bounded treewidth
- randomly generated
- discrete event systems
- petri net model
- web service composition
- dynamic programming
- np hard
- fuzzy petri net
- process model
- concurrent systems
- stochastic petri net
- optimal solution
- colored petri nets
- computational complexity
- service composition
- knowledge based systems
- knowledge representation
- expert systems
- web services