Optimization of Timed Automata Models Using Mixed-Integer Programming

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2791, Issue , 2004, Pages 73-87

  Panek, Sebastian ^a   Stursberg, Olaf ^a   Engell, Sebastian ^a  

^a TU DORTMUND UNIVERSITY   (Germany)

Author keywords

Branch and bound techniques; Discrete optimization; Mixed integer programming; Scheduling; Timed automata

Indexed keywords

AUTOMATA THEORY; INDUSTRIAL RESEARCH; ITERATIVE METHODS; OPTIMIZATION; PROBLEM SOLVING; SCHEDULING; TIME SHARING SYSTEMS;

BRANCH AND BOUND TECHNIQUES; DISCRETE OPTIMIZATION; MIXED INTEGER PROGRAMMING; MIXED INTEGER PROGRAMMING (MIP); PERFORMANCE CRITERION; TIMED AUTOMATA; TIMED AUTOMATA MODELS; TRANSLATION PROCEDURES;

INTEGER PROGRAMMING;

EID: 35048841601     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-40903-8_7     Document Type: Article

References (18)

1. Y. Abdeddaim and O. Maler. Job-shop scheduling using timed automata. In Computer-Aided Verification, LNCS 2102, pages 478-492. Springer, 2001.
2. P. Baptiste, G. Le Pape, and W. Nuijten. Constraint-Based Scheduling: Applying Constraint Programming to Scheduling Problems. Kluwer Acad. Publisher, 2001.
3. G. Behrmann, A. Fehnker, T. S. Hune, P. Petterson, K. Larsen, and J. Romijn. Efficient guiding towards cost-optimality in UPPAAL. In Tools and Algor. for the Construction and Analysis of Syst., LNCS 2031, pages 174-188. Springer, 2001.
4. A. Brooke, D. Kendrick, A. Meeraus, and R. Raman. GAMS - A User's Guide. GAMS Development Corp., Washington, 1998.
5. R. Bruns. Scheduling. In T. Baeck, D. B. Fogel, and Z. Michalewicz, editors, Handbook of Evolutionary Computation, pages F1.5:1-9. Inst. of Physics Publishing, 1997.
6. CPLEX. Using the CPLEX Callable Library. ILOG Inc., Mountain View, CA, 2002.
7. S. Engell, A. Maerkert, G. Sand, and R. Schultz. Production planning in a multiproduct batch plant under uncertainty. In Progress in Industrial Mathematics, pages 526-531. Springer, 2002.
8. A. Fehnker. Citius, Vilius, Melius - Guiding and Cost-Optimality in Model Checking of Timed and Hybrid Systems. Dissertation, KU Nijmegen, 2002.
9. S. Graf, M. Bozga, and L. Mounier. If-2.0: A validation environment for component-based real-time systems. In Computer-Aided Verification, volume 2404 of LNCS, pages 343-348. Springer, 2002.
10. M. Groetschel, S. O. Krumke, and J. Rambau, editors. Online Optimzation of Large Scale Systems. Springer, 2001.
11. I. Harjunkoski and I.E. Grossmann. Decomposition techniques for multistage scheduling problems using mixed-integer and constraint programming methods. Computers and Chemical Enginnering, 26(11):1501-1647, 2002.
12. M. Ierapetritou and C. Floudas. Effective continuous-time formulation for short-term scheduling: Multipurpose batch processes. Industrial and Engineering Chemistry Research, 37:4341-4359, 1998.
13. E. Kondili, C. C. Pantelides, and R. W. H. Sargent. A general algorithm for short-term scheduling of batch operations: MILP formulation. Computers and Chemical Engineering, 17:211-227, 1993.
14. K. G. Larsen, P. Petterson, and W. Yi. UPPAAL in a nutshell. Int. Journal on Software Tools for Technology Transfer, 1(1):134-152, 1997.
15. N. Shah, C. C. Pantelides, and R. W. H. Sargent. A general algorithm for short-term scheduling of batch operations: Computational issues. Computers and Chemical Engineering, 17(2):229-244, 1993.
16. O. Stursberg and S. Panek. Control of switched hybrid systems based on disjunctive formulations. In Hybrid Systems: Computation and Control, LNCS 2289, pages 421-435. Springer, 2002.
17. H.P. Williams. Model Building in Mathematical Programming. Wiley, 1999.
18. S. Yovine. Kronos: A verification tool for real-time systems. Int. Journal of Software Tools for Technology Transfer, 1(1/2):123-133, October 1997.