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 [22] and Ametist [17] and are available in the recently released Uppaal Cora [12], a variant of the real-time verification tool Uppaal [20,5] specialized for cost-optimal reachability for the extended model of priced timed automata.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Abdeddaim, Y., Kerbaa, A., Maler, O.: Task graph scheduling using timed automata. In: Proc. of International Parallel and Distributed Processing Symposium, pp. 8–15 (2003)
Alur, R., Dill, D.: A theory of timed automata. Theoretical Computer Science 126(2), 183–235 (1994)
Alur, R., La Torre, S., Pappas, G.: Optimal paths in weighted timed automata. In: Di Benedetto, M.D., Sangiovanni-Vincentelli, A.L. (eds.) HSCC 2001. LNCS, vol. 2034, pp. 49–62. Springer, Heidelberg (2001)
Beasley, J.E., Krishnamoorthy, M., Sharaiha, Y.M., Abramson, D.: Scheduling aircraft landings - the static case. Transportation Science 34(2), 180–197 (2000)
Behrmann, G., David, A., Larsen, K.: A tutorial on Uppaal. In: Bernardo, M., Corradini, F. (eds.) SFM-RT 2004. LNCS, vol. 3185, pp. 200–236. Springer, Heidelberg (2004)
Behrmann, G., Fehnker, A., Hune, T., Larsen, K., Pettersson, P., Romijn, J.: Efficient guiding towards cost-optimality in Uppaal. In: Margaria, T., Yi, W. (eds.) TACAS 2001. LNCS, vol. 2031, pp. 174–188. Springer, Heidelberg (2001)
Behrmann, G., Fehnker, A., Hune, T., Larsen, K.G., Pettersson, P., Romijn, J.M.T., Vaandrager, F.W.: Minimum-cost reachability for priced timed automata. In: Di Benedetto, M.D., Sangiovanni-Vincentelli, A.L. (eds.) HSCC 2001. LNCS, vol. 2034, pp. 147–161. Springer, Heidelberg (2001)
Bouyer, P., Brinksma, E., Larsen, K.: Staying alive as cheaply as possible. In: Alur, R., Pappas, G.J. (eds.) HSCC 2004. LNCS, vol. 2993, pp. 203–218. Springer, Heidelberg (2004)
Bouyer, P., Cassez, F., Fleury, E., Larsen, K.: Optimal strategies in priced timed game automata. In: Lodaya, K., Mahajan, M. (eds.) FSTTCS 2004. LNCS, vol. 3328, pp. 148–160. Springer, Heidelberg (2004)
Bouyer, P., Cassez, F., Fleury, E., Larsen, K.G.: Synthesis of optimal strategies using hytech. In: Workshop on Games in Design and Verification, Boston, MA, USA, July 2004. Electronic Notes in Theoretical Computer Science, vol. 119(1), pp. 11–31. Elsevier Science Publishers, Amsterdam (2004)
Bozga, M., Daws, C., Maler, O., Olivero, A., Tripakis, S., Yovine, S.: Kronos: A model-checking tool for real-time systems. In: Vardi, M.Y. (ed.) CAV 1998. LNCS, vol. 1427, pp. 546–550. Springer, Heidelberg (1998)
UPPAAL CORA (January 2005), http://www.cs.aau.dk/~behrmann/cora
Dill, D.L.: Timing assumptions and verification of finite-state concurrent systems. In: Sifakis, J. (ed.) Proc. Of Automatic Verification Methods for Finite State Systems. Lecture Notex in Computer Science, vol. 407, pp. 197–212. Springer, Heidelberg (1989)
Fehnker, A.: Scheduling a steel plant with timed automata. In: Proc. of Real-Time and Embedded Computing Systems and Applications, p. 280. IEEE Computer Society, Los Alamitos (1999)
Hune, T., Larsen, K., Pettersson, P.: Guided synthesis of control programs using Uppaal. Nordic Journal of Computing 8(1), 43–64 (2001)
IF (January 2005), http://www-verimag.imag.fr/~async/IF
Advanced Methods in Timed Systems (AMETIST) (January 2005), http://ametist.cs.utwente.nl
Karp, R.M.: A characterization of the minimum mean-cycle in a digraph. Discrete Mathematics 23(3), 309–311 (1978)
Larsen, K., Behrmann, G., Brinksma, E., Fehnker, A., Hune, T., Pettersson, P., Romijn, J.: As cheap as possible: Efficient cost-optimal reachability for priced timed automata. In: Berry, G., Comon, H., Finkel, A. (eds.) CAV 2001. LNCS, vol. 2102, p. 493. Springer, Heidelberg (2001)
Larsen, K., Pettersson, P., Yi, W.: Uppaal in a nutshell. Int. Journal on Software Tools for Technology Transfer 1(1,2), 134–152 (1997)
Larsen, K., Rasmussen, J.: Optimal conditional reachability for multi-priced timed automata. In: Sassone, V. (ed.) FOSSACS 2005. LNCS, vol. 3441, pp. 234–249. Springer, Heidelberg (2005)
Verification of Hybrid Systems (VHS) (January 2005), http://www-verimag.imag.fr/VHS/
Rasmussen, J., Larsen, K., Subramani, K.: Resource-optimal scheduling using priced timed automata. In: Jensen, K., Podelski, A. (eds.) TACAS 2004. LNCS, vol. 2988, pp. 220–235. Springer, Heidelberg (2004)
Stobbe, M.: Results on scheduling the sidmar steel plant using constraint programming. Internal report (2000)
UPPAAL (January 2005), http://www.uppaal.com
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Behrmann, G., Larsen, K.G., Rasmussen, J.I. (2005). Priced Timed Automata: Algorithms and Applications. In: de Boer, F.S., Bonsangue, M.M., Graf, S., de Roever, WP. (eds) Formal Methods for Components and Objects. FMCO 2004. Lecture Notes in Computer Science, vol 3657. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11561163_8
Download citation
DOI: https://doi.org/10.1007/11561163_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-29131-2
Online ISBN: 978-3-540-31939-9
eBook Packages: Computer ScienceComputer Science (R0)