Model Checking Prioritized Timed Automata

  • Shang-Wei Lin
  • Pao-Ann Hsiung
  • Chun-Hsian Huang
  • Yean-Ru Chen
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3707)


Priorities are often used to resolve conflicts in timed systems. However, priorities are not directly supported by state-of-art model checkers. Often, a designer has to either abstract the priorities leading to a high degree of non-determinism or model the priorities using existing primitives. In this work, it is shown how prioritized timed automata can make modelling prioritized timed systems easier through the support for priority specification and model checking. The verification of prioritized timed automata requires a subtraction operation to be performed on two clock zones, represented by DBMs, for which we propose an algorithm to generate the minimal number of zones partitioned. After the application of a series of DBM subtraction operations, the number of zones generated become large. We thus propose an algorithm to reduce the final number of zones partitioned by merging some of them. A typical bus arbitration example is used to illustrate the benefits of the proposed algorithms. Due to the support for prioritization and zone reduction, we observe that there is a 50% reduction in the number of modes and 44% reduction in the number of transitions.


Prioritized timed automata DBM subtraction zone merging zone reduction 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Altisen, K., Gössler, G., Sifakis, J.: A methodology for the construction of scheduled systems. In: Joseph, M. (ed.) FTRTFT 2000. LNCS, vol. 1926, pp. 106–120. Springer, Heidelberg (2000)CrossRefGoogle Scholar
  2. 2.
    Altisen, K., Gössler, G., Sifakis, J.: Scheduler modeling based on the controller synthesis paradigm. Real-Time Systems 23, 55–84 (2002)MATHCrossRefGoogle Scholar
  3. 3.
    Alur, R., Courcoubetis, C., Dill, D.L.: Model-checking for real-time systems. In: Proceedings of the 5th Annual Symposium on Logic in Computer Science, pp. 414–425. IEEE Computer Society Press, Los Alamitos (1990)CrossRefGoogle Scholar
  4. 4.
    Alur, R., Dill, D.L.: A theory of timed automata. Theoretical Computer Science 126(2), 183–235 (1994)MATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    Baeten, J.C.M., Bergstra, J.A., Klop, J.W.: Syntax and defining equations for an interrupt mechanism in process algebra. Technical Report CS-R8503, Centre for Mathematics and Computer Science, Amsterdam, The Netherlands (1985)Google Scholar
  6. 6.
    Bengtsson, J., Larsen, K., Larsson, F., Pettersson, P., Wang, Y.: UPPAAL: a tool suite for automatic verification of real-time systems. In: Alur, R., Sontag, E.D., Henzinger, T.A. (eds.) HS 1995. LNCS, vol. 1066, pp. 232–243. Springer, Heidelberg (1996)CrossRefGoogle Scholar
  7. 7.
    Bryant, R.E.: Graph-based algorithms for Boolean function manipulation. IEEE Transactions on Computers C-35(8), 677–691 (1986)CrossRefGoogle Scholar
  8. 8.
    Camilleri, J.: Introducing a priority operators to ccs. Technical Report 157, Cambridge (1989)Google Scholar
  9. 9.
    Clarke, E.M., Emerson, E.A.: Design and sythesis of synchronization skeletons using branching time temporal logic. In: Kozen, D. (ed.) Logic of Programs 1981. LNCS, vol. 131, pp. 52–71. Springer, Heidelberg (1982)CrossRefGoogle Scholar
  10. 10.
    Clarke, E.M., Grumberg, O., Peled, D.A.: Model Checking. MIT Press, Cambridge (1999)Google Scholar
  11. 11.
    Cleaveland, R., Hennessy, M.: Priorities in process algebra. In: Proceedings of the 3rd Symposium on Logic in Computer Science, Edinburgh (1988)Google Scholar
  12. 12.
    Dill, D.L.: Dill. Timing assumptions and verification of finite-state concurrent systems. In: Sifakis, J. (ed.) CAV 1989. LNCS, vol. 407, pp. 197–212. Springer, Heidelberg (1990)Google Scholar
  13. 13.
    Gössler, G., Sifakis, J.: Priority systems. In: de Boer, F.S., Bonsangue, M.M., Graf, S., de Roever, W.-P. (eds.) FMCO 2003. LNCS, vol. 3188, pp. 314–329. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  14. 14.
    Hsiung, P.-A., Lin, S.-W.: Model checking timed systems with priorities. In: Proceedings of the 11th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA, Hong-Kong, China), August 2005. IEEE Computer Society Press, Los Alamitos (2005)Google Scholar
  15. 15.
    Hsiung, P.-A., Wang, F.: A state-graph manipulator tool for real-time system specification and verification. In: Proceedings of the 5th International Conference on Real-Time Computing Systems and Applications (RTCSA) (October 1998)Google Scholar
  16. 16.
    Lowe, G.: Probabilities and Priorities in Timed CSP. PhD thesis, St. Hugh’s College, University of Oxford, Hilary Term (1993)Google Scholar
  17. 17.
    Milner, R.: Communication and Concurrency. Prentice Hall International, Englewood Cliffs (1989)MATHGoogle Scholar
  18. 18.
    Queille, J.-P., Sifakis, J.: Specification and verification of concurrent systems in CESAR. In: Dezani-Ciancaglini, M., Montanari, U. (eds.) Programming 1982. LNCS, vol. 137, pp. 337–351. Springer, Heidelberg (1982)Google Scholar
  19. 19.
    Sifakis, J.: The compositional specification of timed systems. In: Halbwachs, N., Peled, D.A. (eds.) CAV 1999. LNCS, vol. 1633, pp. 2–7. Springer, Heidelberg (1999)CrossRefGoogle Scholar
  20. 20.
    Sifakis, J.: Modeling real-time systems — challenges and work directions. In: Henzinger, T.A., Kirsch, C.M. (eds.) EMSOFT 2001. LNCS, vol. 2211, pp. 373–389. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  21. 21.
    Wang, F.: RED: Model-checker for timed automata with clock-restriction diagram. In: Proceedings of the Workshop on Real-Time Tools (August 2001); Technical Report 2001-014, ISSN 1404-3203, Department of Information Technology, Uppsala UniversityGoogle Scholar
  22. 22.
    Wang, F., Hsiung, P.-A.: Efficient and user-friendly verification. IEEE Transactions on Computers 51(1), 61–83 (2002)CrossRefMathSciNetGoogle Scholar
  23. 23.
    Yovine, S.: Kronos: A verification tool for real-time systems. International Journal of Software Tools for Technology Transfer 1(1/2), 123–133 (1997)MATHCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Shang-Wei Lin
    • 1
  • Pao-Ann Hsiung
    • 1
  • Chun-Hsian Huang
    • 1
  • Yean-Ru Chen
    • 1
  1. 1.Department of Computer Science and Information EngineeringNational Chung Cheng UniversityChiayiTaiwan, ROC

Personalised recommendations