Fixed Parameter Tractability and Polynomial Time Results for the Synthesis of b-bounded Petri Nets.
Ronny TredupPublished in: Petri Nets (2019)
Keyphrases
- petri net
- fixed parameter tractable
- fixed parameter tractability
- np hard
- computational problems
- bounded treewidth
- np complete
- global constraints
- petri net model
- single peaked
- discrete event systems
- colored petri nets
- conjunctive queries
- service composition
- approximation algorithms
- special case
- ims ld
- constraint satisfaction problems
- abstract argumentation
- computational complexity
- vertex set
- optimal solution
- worst case
- lower bound
- knowledge base
- reasoning tasks
- integer programming
- query answering
- temporal information
- fuzzy petri net
- stochastic petri net
- programmable logic controller