Home > Information Control Problems in Manufacturing > 13th IFAC Symposium on Information Control Problems in Manufacturing > A Mathematical Programming Model for Safe T-Time Petri Nets
A Mathematical Programming Model for Safe T-Time Petri Nets
Information Control Problems in Manufacturing, Volume # 13 | Part# 1
Location: V.A. Trapeznikov Institute of Control Sciences, Russia
National Organizing Committee Chair: Bakhtadze, Natalia,
Dozortsev, Victor
International Program Committee Chair: Dolgui, Alexandre,
Pereira, Carlos Eduardo,
Mirkin, Evgeny A. ,
Kostyukov, Valentin E.
Conference Editor: Bakhtadze, Natalia,
Dolgui, Alexandre
Authors
Bourdeaud'huy, Thomas
Identifier
10.3182/20090603-3-RU-2001.00177
Index Terms
Integer Linear Programming; Dynamic Systems
Abstract
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
References
Berthomieu, B. and Diaz, M. (1991). Modeling and verification of time dependent systems using time petri nets. IEEE Trans. on Software Eng., 17(3), 259-273. Bourdeaud’huy, T. (2004). Techniques d’Abstraction pour l’Analyse et la Synthèse de Réseaux de Petri. Ph.D. thesis, Ecole Centrale de Lille. Bourdeaud’huy, T., Hanafi, S., and Yim, P. (2006). Scheduling of flexible manufacturing systems using timed petri nets and mathematical programming. In WODES’06,Workshop on Discrete Event Systems. Ann Arbor, Michigan, USA. Diaz, D. (2001). Les réseaux de Petri - Modèles fondamentaux. Hermes Science, Traité IC2. Li, X. and Lilius, J. (1999). Verifying time petri nets by linear programming. Technical Report TUCS-TR-259. URL citeseer.ist.psu.edu/368775.html. Merlin, P. (1974). A Study of the Recoverability of Computing Systems. Ph.D. thesis, Irvive. Roux, J. (1985). Modélisation et Analyse des Systèmes Distribués par les Réseaux de Petri Temporels. Ph.D. thesis, Institut National des Sciences Appliquées de Toulouse. Silva, M., Teruel, E., and Colom, J.M. (1998). Linear algebraic and linear programming techniques for the analysis of place/transition net systems. Lecture Notes in Computer Science: Lectures on Petri Nets I: Basic Models, 1491, 309-373.
