Model Checking Prioritized Timed Automata
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.
KeywordsPrioritized timed automata DBM subtraction zone merging zone reduction
Unable to display preview. Download preview PDF.
- 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
- 8.Camilleri, J.: Introducing a priority operators to ccs. Technical Report 157, Cambridge (1989)Google Scholar
- 10.Clarke, E.M., Grumberg, O., Peled, D.A.: Model Checking. MIT Press, Cambridge (1999)Google Scholar
- 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.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
- 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.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.Lowe, G.: Probabilities and Priorities in Timed CSP. PhD thesis, St. Hugh’s College, University of Oxford, Hilary Term (1993)Google Scholar
- 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
- 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