Efficient reachability analysis of bounded Petri nets using constraint programming.
Thomas Bourdeaud'huyPascal YimSaïd HanafiPublished in: SMC (2) (2004)
Keyphrases
- constraint programming
- petri net
- reachability analysis
- constraint satisfaction problems
- combinatorial problems
- constraint satisfaction
- constraint propagation
- integer programming
- petri net model
- global constraints
- discrete event systems
- symmetry breaking
- search strategies
- fuzzy petri net
- arc consistency
- finite domain
- hard and soft constraints
- linear programming
- colored petri nets
- model checking