On enumerating minimal siphons in Petri nets using CLP and SAT solvers: theoretical and practical complexity.
Faten NabliThierry MartinezFrançois FagesSylvain SolimanPublished in: Constraints An Int. J. (2016)
Keyphrases
- petri net
- sat solvers
- petri net model
- discrete event systems
- orders of magnitude
- propositional satisfiability
- max sat
- constraint satisfaction
- search space
- colored petri nets
- boolean satisfiability
- fuzzy petri net
- sat solving
- search strategies
- sat problem
- boolean formula
- service composition
- sat instances
- sat encodings
- search algorithm
- weighted max sat
- programmable logic controller
- answer sets
- ims ld
- practical problems
- state space
- artificial intelligence
- clause learning
- branch and bound
- constraint programming
- decision problems
- upper bound
- evolutionary algorithm
- computational complexity
- stochastic petri net