• English
    • français
  • Help
  •  | 
  • Contact
  •  | 
  • About
  •  | 
  • Login
  • HAL portal
  •  | 
  • Pages Pro
  • EN
  •  / 
  • FR
View Item 
  •   LillOA Home
  • Liste des unités
  • Centre de Recherche en Informatique, Signal et Automatique de Lille (CRIStAL) - UMR 9189
  • View Item
  •   LillOA Home
  • Liste des unités
  • Centre de Recherche en Informatique, Signal et Automatique de Lille (CRIStAL) - UMR 9189
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

A constraint programming model for solving ...
  • BibTeX
  • CSV
  • Excel
  • RIS

Document type :
Communication dans un congrès avec actes
Title :
A constraint programming model for solving reachability problem in timed Petri nets
Author(s) :
Huang, Yongliang [Auteur]
Systèmes Tolérants aux Fautes [STF]
Bourdeaud'Huy, Thomas [Auteur]
LAGIS-OSL
Yvars, Pierre-Alain [Auteur]
Laboratoire d'Ingénierie des Systèmes Mécaniques et des MAtériaux [LISMMA]
Toguyeni, Armand [Auteur] refId
Centrale Lille
Conference title :
International Conference of Modeling, Optimization and Simulation
Country :
France
Start date of the conference :
2012-06-06
Book title :
Performance, interoperability and safety for sustainable development
Publication date :
2012-06-08
HAL domain(s) :
Computer Science [cs]/Operations Research [math.OC]
English abstract : [en]
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 ...
Show more >
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.Show less >
Language :
Anglais
Peer reviewed article :
Oui
Audience :
Internationale
Popular science :
Non
Collections :
  • Centre de Recherche en Informatique, Signal et Automatique de Lille (CRIStAL) - UMR 9189
Source :
Harvested from HAL
Université de Lille

Mentions légales
Accessibilité : non conforme
Université de Lille © 2017