Skip to main content
SpringerLink
Log in

Timed automata with urgent transitions

  • Published:
Acta Informatica Aims and scope Submit manuscript

Abstract.

We propose an extension to the formalism of timed automata by allowing urgent transitions. An urgent transition is a transition which must be taken within a fixed time interval from its enabling time and it has higher priority than other non-urgent transitions enabled in the same state. We give a set of rules formally describing the behavior of urgent transitions and we show that, from a language theoretic point of view, the addition of urgency does not improve the expressive power of timed automata. From a specification point of view, the use of urgent transitions allows shorter and clear specifications of behaviors involving urgency and priority. We use timed automata with urgent transitions for specifying a multicast protocol for mobile computing.

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. Aceto, L., Bouyer, P., Burgueño, A., Larsen, K.G. (1998) The power of reachability testing for timed automata. In: Proceedings of the 18th Conference on Foundations Software Technology and Theoretical Computer Science (FSTTCS’98), Lecture Notes in Computer Science, vol. 1530, pp. 245-256. Springer, Berlin

  2. Aceto, L., Burgueño, A., Guldstrand Larsen, K. (1998) Model checking via reachability testing for timed automata. In: Proceedings of the 4th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS’98), Lecture Notes in Computer Science, vol. 384, pp. 263-280. Springer, Berlin

  3. Alur, R. (1999) Timed automata. In: Proceedings of the 11th International Conference on Computer-Aided Verification (CAV’99), Lecture Notes in Computer Science, vol. 1633, pp. 8-22. Springer, Berlin

  4. Alur, R., Courcoubetis, C., Dill, D.L. (1993) Model-checking in dense real-time. Information and Computation 104: 2-34

    Article  MathSciNet  Google Scholar 

  5. Alur, R., Courcoubetis, C., Halbwachs, N., Dill, D.L., Wong-Toi, H. (1992) Minimization of timed transition systems. In: In Proceedings of the 3rd International Conference on Concurrency Theory (CONCUR’92), Lecture Notes in Computer Science, vol. 630, pp. 340-354. Springer, Berlin

  6. Alur, R., Courcoubetis, C., Henzinger, T.A. (1994) The observational power of clocks. In: Proceedings of the 5th International Conference on Concurrency Theory (CONCUR’94), Lecture Notes in Computer Science, vol. 836, pp. 162-177. Springer, Berlin

  7. Alur, R., Dill, D.L. (1990) Automata for modeling real-time systems. In: Proceedings of the 17th Colloquium on Automata, Languages and Programming (ICALP’90), Lecture Notes in Computer Science, vol. 443, pp. 322-335. Springer, Berlin

  8. Alur, R., Dill, D.L. (1994) A theory of timed automata. Theoretical Computer Science 126: 183-235

    Article  MathSciNet  Google Scholar 

  9. Alur, R., Fix, L., Henzinger, T.A. (1999) Event-clock automata: A determinizable class of timed automata. Theoretical Computer Science 211: 253-273

    Article  MathSciNet  Google Scholar 

  10. Alur, R., Henzinger, T.A. (1992) Back to the future: Towards a theory of timed regular languages. In: Proceedings of the 33th Annual IEEE Symposium on Foundations of Computer Science (FOCS’92), pp. 177-186. IEEE Computer Society Press

  11. Alur, R., Henzinger, T.A. (1994) A really temporal logic. Journal of the ACM 41: 181-204

    Article  Google Scholar 

  12. Anastasi, G., Bartoli, A., De Francesco, N., Santone, A. (2000) Efficient verification of a multicast protocol for mobile computing. The Computer Journal 44: 21-30

    Google Scholar 

  13. Cleaveland, R., Sims, S. (1996) The ncsu concurrency workbench. In: Proceedings of the 8th conference on Computer Aided Verification (CAV’96), Lecture Notes in Computer Science, vol. 1102, pp. 394-397. Springer, Berlin

  14. Barbuti, R., De Francesco, N., Tesei, L. (2001) Timed automata with non-instantaneous actions. Fundamenta Informaticae 47(3-4): 189-200

    Google Scholar 

  15. Barbuti, R., Tesei, L. (2001) Timed automata with urgent transitions. In: Corradini, F., Vogler, W. (eds.) Proceedings of the 2nd International Workshop on Models for Time-Critical systems (MTCS’01), vol. NS-01-5 in BRICS Notes, pp. 3-21. Department of Computer Science, Aarhus University Press

  16. Bengtsson, J., Larsen, K.G., Larsson, F., Pettersson, P., Yi, W. (1995) UPPAAL - a tool suite for automatic verification of real-time systems. In: Proceedings of the 4th DIMACS Workshop on Verification and Control of Hybrid Systems, Lecture Notes in Computer Science, vol. 1066, pp. 232-243. Springer, Berlin

  17. Bolognesi, T., Lucidi, F. (1992) Timed process algebras with urgent interactions and a unique powerful binary operator. In: Proceedings of Real-Time: Theory in Practice Workshop (REX Workshop 1991), Lecture Notes in Computer Science, vol. 600, pp. 124-148. Springer, Berlin

  18. Bornot, S., Sifakis, J. (1997) Relating time progress and deadlines in hybrid systems. In: Proceedings of International Workshop on Hybrid and Real-Time Systems (HART’97), Lecture Notes in Computer Science, vol. 1201, pp. 286-300. Springer, Berlin

  19. Bornot, S., Sifakis. J. (2000) An algebraic framework for urgency. Information and Computation 163(1): 172-202

    Article  MathSciNet  Google Scholar 

  20. Bornot, S., Sifakis, J., Tripakis, S. (1997) Modeling urgency in timed systems. In: Proceedings of Compositionality Meeting (COMPOS’97), Lecture Notes in Computer Science, vol. 1536, pp. 103-129. Springer, Berlin

  21. Brémond-Grégoire, P., Lee, I. (1997) A process algebra of communicating shared resources with dense time and priorities. Theoretical Computer Science 189(1-2): 179-219

    Google Scholar 

  22. Buchholtz, M., Andersen, J., Lovengreen, H.H. (2002) Towards a process algebra for shared processors. In: Corradini, F., Vogler, W. (eds.) Electronic Notes in Theoretical Computer Science, vol. 52. Elsevier

  23. Choffrut, C., Goldwurm, M. (2000) Timed automata with periodic clock constraints. Journal of Automata, Languages and Combinatorics 5(4): 371-403

    Google Scholar 

  24. Demichelis, F., Zielonka, W. (1998) Controlled timed automata. In: Proceedings of 9th International Conference on Concurrency Theory (CONCUR’98), Lecture Notes in Computer Science, vol. 1466, pp. 455-469. Springer, Berlin

  25. Fersman, E., Petterson, P., Yi, W. (2002) Timed automata with asynchronous processes: Schedulability and decidability. In: Proceedings of TACAS 2002, Lecture Notes in Computer Science, vol. 2280, pp. 67-82. Springer, Berlin

  26. Gupta, V., Henzinger, T.A., Jagadeesan, R. (1997) Robust timed automata. In: Proceedings of International Workshop on Hybrid and Real-Time Systems (HART’97), Lecture Notes in Computer Science, vol. 1201, pp. 331-345. Springer, Berlin

  27. Henzinger, T.A., Kopke, P.W. (1994) Verification methods for the divergent runs of clock systems. In: Proceedings of the 2nd International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems (FTRTFT’94), Lecture Notes in Computer Science, vol. 863, pp. 351-372. Springer, Berlin

  28. Henzinger, T.A., Nicollin, X., Sifakis, J., Yovine, S. (1994) Symbolic model checking for real-time systems. Information and Computation 111: 193-244

    Article  MathSciNet  Google Scholar 

  29. Lanotte, R., Maggiolo-Schettini, A., Peron, A. (2000) Timed cooperating automata. Fundamenta Informaticae 43: 153-173

    MathSciNet  Google Scholar 

  30. Milner, R. (1980) A Calculus of Communicating Systems. Springer, Berlin

  31. Yovine, S. (1996) Model checking timed automata. In: Lectures on Embedded Systems,Lecture Notes in Computer Science, vol. 1494, pp. 114-152. Springer, Berlin

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Informatica,, Universitá di Pisa,, via F. Buonarroti, 2 , 56127 , Pisa,, Italy

    Roberto Barbuti & Luca Tesei

Authors
  1. Roberto Barbuti
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Luca Tesei
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Roberto Barbuti.

Additional information

Received: 10 January 2003, Published online: 17 February 2004

A first version of this paper appeared in [15]

Rights and permissions

Reprints and permissions

About this article

Cite this article

Barbuti, R., Tesei, L. Timed automata with urgent transitions. Acta Informatica 40, 317–347 (2004). https://doi.org/10.1007/s00236-003-0135-6

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00236-003-0135-6

Keywords

Search

Navigation