Abstract
Statecharts is a visual formalism for the specification of reactive systems. The formalism has been endowed with a “step-semantics” which heavily bounds the complexity of the reaction in a step, does not model interrupts in a natural way and is not proper for investigating refinement. In this paper, a new model is proposed allowing to overcome the mentioned drawbacks. From a syntactic point of view statecharts are generalized by introducing real time features like delays and timeouts. Though occurrencies of actions are related to a dense time domain, the behaviour of statecharts is forced to be discrete. Classes of statecharts are investigated which intrinsically behave discretely.
This work has been partially supported by Project ESPRIT BRA 8130 LOMAPS
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Berry, G., Cosserat, L.: The Synchronous Programming Language Esterel and its Mathematical Semantics, Lecture Notes in Computer Science 197, Springer, Berlin, 1985, pp. 389–449.
Drusinsky, D., Harel, D.: Using Statecharts for Hardware Description and Synthesis, IEEE Transactions on Computer-Aided Design 8 (1989), pp. 798–807.
Ghezzi, C, Mandrioli, D., Morasca, S., Pezze, M.: A Unified Hight Level Petri Net Formalism for Time Critical Systems, IEEE Transactions on Software Engineering 17 (1991), pp. 160–172.
Harel, D.: Statecharts: A Visual Formalism for Complex Systems, Science of Computer Programming 8 (1987), pp. 231–274.
Harel, D., Lachover, H., Naamad, A., Pnueli, A., Politi, M., Sherman, R., Shtull-Trauring, A., Trakhtenbrot M.: Statemate: A Working Environment for the Development of Complex Reactive Systems, IEEE Transations on Software Engineering 16 (1990), pp. 403–414.
Harel, D., Pnueli, A., Schmidt, J. P., Sherman, R.: On the Formal Semantics of Statecharts, Proc. 2nd IEEE Symposium on Logic in Computer Science, IEEE CS Press, New York, 1987, pp. 54–64.
Huizing, C., Gerth, R.: Semantics of Reactive Systems in Abstract Time, Lecture Notes in Computer Science 600, Springer, Berlin, 1992, pp. 291–314.
Huizing, C., Gerth, R., de Roever, W.P.: Modelling Statechart Behaviour in a Fully Abstract Way, Lecture Notes in Computer Science 299, Springer, Berlin, 1988, pp. 271–294.
Kesten, Y., Pnueli A.: Timed and Hybrid Statecharts and their Textual Representation, Lecture Notes in Computer Sciences 571, Springer, Berlin, 1992, pp. 591–620.
Maggiolo-Schettini, A., Winkowski, J.: Towards an Algebra for Timed Behaviours, Theoretical Computer Science 103 (1992), pp. 335–363.
Maggiolo-Schettini, A., Peron, A.: Semantics for Statecharts Based on Graph Rewriting, in: Prinetto, P., Camurati, P., (Eds.), Correct Hardware Design Methodologies, North-Holland, Amsterdam, pp. 91–114, 1992.
Maraninchi, F.: Argonaute: Graphical Description, Semantics and Verification of Reactive Systems by Using a Process Algebra, Lecture Notes in Computer Science 408, Springer, Berlin, 1990, pp. 38–53.
Peron, A.: Synchronous and Asynchronous Models for Statecharts, Dipartimento di Informatica, Università di Pisa, PhD Thesis, TD 21/93, 1993.
Pnueli, A., Shalev, M.: What is in a Step: On the Semantics of Statecharts, Lecture Notes in Computer Science 525, Springer, 1991, Berlin, pp. 244–464.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Peron, A., Maggiolo-Schettini, A. (1994). Transitions as interrupts: A new semantics for timed statecharts. In: Hagiya, M., Mitchell, J.C. (eds) Theoretical Aspects of Computer Software. TACS 1994. Lecture Notes in Computer Science, vol 789. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57887-0_126
Download citation
DOI: https://doi.org/10.1007/3-540-57887-0_126
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57887-1
Online ISBN: 978-3-540-48383-0
eBook Packages: Springer Book Archive