Abstract
Timed Statecharts, which can efficiently specify explicit dense time, is an extension to the visual specification language Statecharts with real-time constructs. We give a definition of timed Statecharts that specifies explicit temporal behavior as timed automata does. It is very difficult to verify directly whether timed Statecharts satisfies the required properties. However, by compiling it into timed automata, timed Statecharts may be checked using Uppaal tool. In the paper, the state of timed Statecharts is represented by inductive term, and a step semantics of timed Statecharts is briefly described. The translation rules are shown by a compositional approach for formalizing the timed Statecharts semantics directly on sequences of micro steps. Timed automata corresponding to timed Statecharts was also discussed.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Harel, D.: Statecharts: a Visual Formalism for Complex Systems. Science of Computing 8, 231–274 (1987)
Jahanian, F., Mok, A.K.: A Graph-theoretic Approach for Timing Analysis and its Imple-mentation. IEEE Transactions on Computers C-36, 961–975 (1987)
Leveson, N.G., Heimdahl, M., Hildreth, H., Reese, J.D.: Requirements Specification for Process Control Systems. IEEE Transactions on Software Engineering 20, 684–707 (1994)
Clarke, E.M., Grumberg, O., Peled, D.A.: Model Checking. The MIT Press, Cambridge (2000)
Clarke, E.M., Emerson, E.A.: Synthesis of synchronization skeletons for branching time temporal logic. In: Kozen, D. (ed.) Logic of Programs 1981. LNCS, vol. 131, pp. 52–71. Springer, Heidelberg (1982)
Harel, D., Pnueli, A., Schmidt, J.P., Sherman, R.: On the Formal Semantics of Statecharts. In: Proceedings of the 2nd IEEE symposium on Logic in Computer science, Ithaca, New York, pp. 54–64 (1987)
Lüttgen, G., von der Beeck, M., Cleaveland, R.: Statecharts via process algebra. In: Baeten, J.C.M., Mauw, S. (eds.) CONCUR 1999. LNCS, vol. 1664, pp. 399–414. Springer, Heidelberg (1999)
Maggiolo-Schettini, A., Peron, A., Tini, S.: Equivalences of Statecharts. In: Sassone, V., Montanari, U. (eds.) CONCUR 1996. LNCS, vol. 1119, pp. 687–702. Springer, Heidelberg (1996)
Heckel, R., Kuster, J., Taentaer, G.: Towards Automatic Translation of UML Models into Semantic Domains. In: Proc. AGT 2002: Workshop on Applied Graph Transformation, Grenoble, France, pp. 11–21 (2002)
Lüttgen, G., von der Beeck, M., Cleaveland, R.: A Compositional Approach to State charts Semantics. NASA/CR-2000-2100086, ICASE Report No. 2000-12 (2000)
Pnueli, A., Shalev, M.: What is in a Step: on the Semantics of Statecharts. In: Ito, T., Meyer, A. (eds.) TACS 1991. LNCS, vol. 526, pp. 244–264. Springer, Heidelberg (1991)
Mikk, E., Lakhnech, Y., Siegel, M., et al.: Implementing Statecharts in PROMELA/SPIN. In: Proc of Workshop on Industrial-Strength Formal Specification Techniques(WIFT 1998). IEEE Computer Society, BocaRaton (1998)
Latella, D., Majzik, I., Massink, M.: Automatic Verification of UML Statechat Diagrams Using the SPIN Model-checker. Formal Aspects of Computing 11, 637–664 (1999)
Gnesi, S., Latella, D.: Model Checking UML Statechart Diagrams Using JACK. In: Proceedings of the 4th IEEE international Symposium on High-Assurance Systems Engineering, pp. 46–55 (1999)
Pap, Z., Majzik, I., Pataricza, A.: Checking general safety criteria on UML statecharts. In: Voges, U. (ed.) SAFECOMP 2001. LNCS, vol. 2187, pp. 46–55. Springer, Heidelberg (2001)
Chan, W., Anderson, R., Beame, P., Burns, S., et al.: Model Checking Large Software Specifications. IEEE Transactions on Software Engineering 24, 498–520 (1998)
Schmidt, A., Varro, D.: CheckVML: A tool for model checking visual modeling languages. In: Stevens, P., Whittle, J., Booch, G. (eds.) UML 2003. LNCS, vol. 2863, pp. 92–95. Springer, Heidelberg (2003)
David, A., Oliver Möller, M., Yi, W.: Formal verification of UML statecharts with real-time extensions. In: Kutsche, R.-D., Weber, H. (eds.) FASE 2002. LNCS, vol. 2306, pp. 218–232. Springer, Heidelberg (2002)
Giese, H., Burmester, S.: Real-Time Statechart Semantics. Technical Report tr-ri-03- 239, Computer Science Department, University of Paderborn (2003)
Alur, R., Dill, D.: A Theory of Timed Automata. Theoretical Computer Science 126, 183–235 (1994)
Plotkin, G.D.: A Structural Approach to Operational Semantics. Technical Report DAIMI FN-19, Computer Science Department, Aarhus University (1981)
Fokkink, W.: Introduction to Process Algebra. Springer, Heidelberg (2000)
Alur, R., Courcoubetis, C., Dill, D.: Model Checking in Dense Real-time. Information and Computation 104, 2–34 (1993)
Yovine, S.: Model Checking Timed Automata. In: Rozenberg, G. (ed.) EEF School 1996. LNCS, vol. 1494. Springer, Heidelberg (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 IFIP International Federation for Information Processing
About this paper
Cite this paper
Qian, J., Xu, B. (2005). Model Checking for Timed Statecharts. In: Wang, F. (eds) Formal Techniques for Networked and Distributed Systems - FORTE 2005. FORTE 2005. Lecture Notes in Computer Science, vol 3731. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11562436_20
Download citation
DOI: https://doi.org/10.1007/11562436_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-29189-3
Online ISBN: 978-3-540-32084-5
eBook Packages: Computer ScienceComputer Science (R0)