A constraint programming model for solving reachability problem in timed Petri nets

Yongliang Huang (1) , Thomas Bourdeaud'Huy (2) , Pierre-Alain Yvars (3) , Armand Toguyeni (4)

1 STF - Systèmes Tolérants aux Fautes
2 LAGIS-OSL
3 LISMMA - Laboratoire d'Ingénierie des Systèmes Mécaniques et des MAtériaux
4 Centrale Lille

In this paper, we propose to use a constraint programming approach to address the reachability problem in Timed Petri Nets (TPNs). TPNs can be used to model a wide class of systems, from manufacturing issues to formal verification of embedded systems. Many of the considered problems can be modeled as reachability problems in TPNs. To reduce the space state explosion brought by the exploration of the TPN behaviour, we propose to follow the incremental methodoly proposed by (Bourdeaud'huy & Hanafi 2006), who translate the reachability graph of Timed PNs into a mathematical programming model using linearization techniques. We show how to adapt this model to the constraint programming paradigm by using reified contraints and compare the respective efficiency of the two models.

Domaines: Recherche opérationnelle [math.OC]

Yongliang Huang, Thomas Bourdeaud'Huy, Pierre-Alain Yvars, Armand Toguyeni. A constraint programming model for solving reachability problem in timed Petri nets. International Conference of Modeling, Optimization and Simulation, Jun 2012, France. ⟨hal-00802225⟩