Optimal scheduling using priced timed automata
Authors:
- Gerd BehrmannGBGerd Behrmann
- Kim G. LarsenKLKim G. Larsen
Open Access
- 1 March 2005
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGMETRICS Performance Evaluation Review
- Vol. 32 (4) , 34-40
Abstract
This contribution reports on the considerable effort made recently towards extending and applying well-established timed automata technology to optimal scheduling and planning problems. The effort of the authors in this direction has to a large extent been carried out as part of the European projects VHS [20] and AMETIST [16] and are available in the recently released UPPAAL CORA [12], a variant of the real-time verification tool UPPAAL [18, 5] specialized for cost-optimal reachability for the extended model of so-called priced timed automata.Keywords
This publication has 9 references indexed in Scilit:
- Synthesis of Optimal Strategies Using HyTechElectronic Notes in Theoretical Computer Science, 2005
- Optimal Conditional Reachability for Multi-priced Timed AutomataLecture Notes in Computer Science, 2005
- Optimal Strategies in Priced Timed Game Automata2004
- Staying Alive as Cheaply as PossibleLecture Notes in Computer Science, 2004
- Resource-Optimal Scheduling Using Priced Timed AutomataLecture Notes in Computer Science, 2004
- As Cheap as Possible: Effcient Cost-Optimal Reachability for Priced Timed Automata2001
- Scheduling Aircraft Landings—The Static CaseTransportation Science, 2000
- Uppaal in a nutshellInternational Journal on Software Tools for Technology Transfer, 1997
- A theory of timed automataTheoretical Computer Science, 1994