Skip to main content
SpringerLink
Log in

Optimal infinite scheduling for multi-priced timed automata

  • Published:
Formal Methods in System Design Aims and scope Submit manuscript

Abstract

This paper is concerned with the derivation of infinite schedules for timed automata that are in some sense optimal. To cover a wide class of optimality criteria we start out by introducing an extension of the (priced) timed automata model that includes both costs and rewards as separate modelling features. A precise definition is then given of what constitutes optimal infinite behaviours for this class of models. We subsequently show that the derivation of optimal non-terminating schedules for such double-priced timed automata is computable. This is done by a reduction of the problem to the determination of optimal mean-cycles in finite graphs with weighted edges. This reduction is obtained by introducing the so-called corner-point abstraction, a powerful abstraction technique of which we show that it preserves optimal schedules.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Abdeddaïm Y, Maler O (2001) Job-shop scheduling using timed automata. In: Procedings of 13th international conference on computer aided verification (CAV’01). Lecture notes in computer science, vol 2102. Springer, Berlin, pp 478–492

    Google Scholar 

  2. Abdeddaïm Y, Maler O (2002) Preemptive job-shop scheduling using stopwatch automata. In: Proceedings of 8th international conference on tools and algorithms for the construction and analysis of systems (TACAS’02). Lecture notes in computer science, vol 2280. Springer, Berlin, pp 113–126

    Chapter  Google Scholar 

  3. Alur R, Dill D (1990) Automata for modeling real-time systems. In: Proceedings of 17th international colloquium on automata, languages and programming (ICALP’90). Lecture notes in computer science, vol 443. Springer, Berlin, pp 322–335

    Chapter  Google Scholar 

  4. Alur R, Dill D (1994) A theory of timed automata. Theor Comput Sci 126(2):183–235

    Article  MATH  MathSciNet  Google Scholar 

  5. Alur R, Bernadsky M, Madhusudan P (2004) Optimal reachability in weighted timed games. In: Proceedings of 31st international colloquium on automata, languages and programming (ICALP’04). Lecture notes in computer science, vol 3142. Springer, Berlin, pp 122–133

    Google Scholar 

  6. Alur R, La Torre S, Pappas GJ (2001) Optimal paths in weighted timed automata. In: Proceedings of 4th international workshop on hybrid systems: computation and control (HSCC’01). Lecture notes in computer science, vol 2034. Springer, Berlin, pp 49–62

    Chapter  Google Scholar 

  7. Applegate D, Cook W (1991) A computational study of the job-shop scheduling problem. OSRA J Comput 3:149–156

    MATH  Google Scholar 

  8. Asarin E, Maler O (1999) As soon as possible: Time optimal control for timed automata. In: Proceedings of 2nd international workshop on hybrid systems: computation and control (HSCC’99). Lecture notes in computer science, vol 1569. Springer, Berlin, pp 19–30

    Chapter  Google Scholar 

  9. Behrmann G, Fehnker A, Hune Th, Larsen KG, Pettersson P, Romijn J, Vaandrager F (2001) Efficient guiding towards cost-optimality in \(\mathsf{uppaal}\) . In: Proceedings of 7th international conference on tools and algorithms for the construction and analysis of systems (TACAS’01). Lecture notes in computer science, vol 2031. Springer, Berlin, pp 174–188

    Chapter  Google Scholar 

  10. Behrmann G, Fehnker A, Hune Th, Larsen KG, Pettersson P, Romijn J, Vaandrager F (2001) Minimum-cost reachability for priced timed automata. In: Proceedings of 4th international workshop on hybrid systems: computation and control (HSCC’01). Lecture notes in computer science, vol 2034. Springer, Berlin, pp 147–161

    Chapter  Google Scholar 

  11. Bengtsson J, Larsen KG, Larsson F, Pettersson P, Yi W, Weise C (1998) New generation of \(\mathsf{uppaal}\) . In: Proceedings of international workshop on software tools for technology transfer (STTT’98). BRICS notes series, pp 43–52

  12. Bouyer P, Brinksma E, Larsen KG (2004) Staying alive as cheaply as possible. In: Proceedings of 7th international workshop on hybrid systems: computation and control (HSCC’04). Lecture notes in computer science, vol 2993. Springer, Berlin, pp 203–218

    Google Scholar 

  13. Bouyer P, Cassez F, Fleury E, Larsen KG (2004) Optimal strategies in priced timed game automata. In: Proceedings of 24th conference on foundations of software technology and theoretical computer science (FST&TCS’04). Lecture notes in computer science, vol 3328. Springer, Berlin, pp 148–160

    Google Scholar 

  14. Brinksma E, Mader A, Fehnker A (2002) Verification and optimization of a PLC control schedule. J Softw Tools Technol Trans 4(1):21–33

    Article  Google Scholar 

  15. D’Argenio PR, Jeannet B, Jensen HE, Larsen KG (2001) Reachability analysis of probabilistic systems by successive refinements. In: Proceedings of 1st joint international workshop on process algebra and probabilistic methods, performance modeling and verification (PAPM-PROBMIV’01). Lecture notes in computer science, vol 2165. Springer, Berlin, pp 39–56

    Chapter  Google Scholar 

  16. D’Argenio PR, Jeannet B, Jensen HE, Larsen KG (2002) Reduction and refinement strategies for probabilistic analysis. In: Proceedings of 2nd joint international workshop on process algebra and probabilistic methods, performance modeling and verification (PAPM-PROBMIV’02). Lecture notes in computer science, vol 2399. Springer, Berlin, pp 57–76

    Chapter  Google Scholar 

  17. Dasdan A, Gupta RK (1998) Faster maximum and minimum mean cycle algorithms for system performance analysis. IEEE Trans Comput Aided Des Integr Circuits Syst 17(10):889–899

    Article  Google Scholar 

  18. Dasdan A, Irani S, Gupta RK (1999) Efficient algorithms for optimum cycle mean and optimum cost to time ratio problems. In: Proceedings of 36th ACM/IEEE design automation conference (DAC’99). ACM, New York, pp 37–42

    Chapter  Google Scholar 

  19. Fehnker A (1999) Scheduling a steel plant with timed automata. In: Proceedings of 6th international conference on real-time computing systems and applications (RTCSA’99). IEEE Computer Society, Los Alamitos, pp 280–286

    Google Scholar 

  20. Hune Th, Larsen KG, Pettersson P (2000) Guided synthesis of control programs using \(\mathsf{uppaal}\) . In: Proceedings of IEEE ICDS international workshop on distributes systems verification and validation. IEEE Computer Society, Los Alamitos, pp E15–E22

    Google Scholar 

  21. Karp RM (1978) A characterization of the minimum mean-cycle in a digraph. Discrete Math 23(3):309–311

    Article  MATH  MathSciNet  Google Scholar 

  22. La Torre S, Mukhopadhyay S, Murano A (2002) Optimal-reachability and control for acyclic weighted timed automata. In: Proceedings of 2nd IFIP international conference on theoretical computer science (TCS 2002). IFIP conference proceedings, vol 223. Kluwer Academic, Dordrecht, pp 485–497

    Google Scholar 

  23. Larsen KG, Pettersson P, Yi W (1997) UPPAAL in a nutshell. J Softw Tools Technol Transf 1(1–2):134–152

    Article  MATH  Google Scholar 

  24. Larsen KG, Behrmann G, Brinksma E, Fehnker A, Hune T, Pettersson P, Romijn J (2001) As cheap as possible: efficient cost-optimal reachability for priced timed automata. In: Proceedings of 13th international conference on computer aided verification (CAV’01). Lecture notes in computer science, vol 2102. Springer, Berlin, pp 493–505

    Google Scholar 

  25. Mader A (2004) Deriving schedules for a smart card personalisation system. Technical report TR-CTIT-04-05, Centre for Telematics and Information Technology, University of Twente, The Netherlands

  26. Niebert P, Yovine S (2001) Computing efficient operations schemes for chemical plants in multi-batch mode. Eur J Control 7(4):440–453

    Article  Google Scholar 

  27. Papadimitriou CH (1994) Computational complexity. Addison-Wesley, Reading

    MATH  Google Scholar 

  28. Zwick U, Paterson M (1996) The complexity of mean payoff games on graphs. Theor Comput Sci 158 (1–2):343–359

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LSV, CNRS & ENS de Cachan, UMR 8643, Cachan Cedex, France

    Patricia Bouyer

  2. Department of Computer Science, University of Twente, Enschede, The Netherlands

    Ed Brinksma

  3. BRICS, Aalborg University, Aalborg, Denmark

    Kim G. Larsen

Authors
  1. Patricia Bouyer
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ed Brinksma
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Kim G. Larsen
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Patricia Bouyer.

Additional information

This work has been mostly done while visiting CISS at Aalborg University in Denmark and has been supported by CISS and by ACI Cortos, a program of the French Ministry of Research.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Bouyer, P., Brinksma, E. & Larsen, K.G. Optimal infinite scheduling for multi-priced timed automata. Form Methods Syst Des 32, 3–23 (2008). https://doi.org/10.1007/s10703-007-0043-4

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10703-007-0043-4

Keywords

Search

Navigation