A Mathematical Programming Model for safe T-Time Petri Nets

Thomas Bourdeaud'Huy (1) , Said Hanafi

1 LAGIS-OSL

In this paper, we propose a mathematical programming model for the resolution of the reachability problem in Time Petri Nets. We are more particularly interested in unweighted Time Petri Nets with safe markings and weak time semantics

Domaines: Recherche opérationnelle [math.OC]

Thomas Bourdeaud'Huy, Said Hanafi. A Mathematical Programming Model for safe T-Time Petri Nets. 13th IFAC Symposium on Information Control Problems in Manufacturing, Jun 2009, Russia. pp.1073-1078, ⟨10.3182/20090603-3-RU-2001.00177⟩. ⟨hal-00802232⟩