Abstract
We present a denotational, strictly syntax-directed, semantics for Statecharts, a graphical, mixed specification/programming language for real-time, developed by Harel [H]. This requires first of all defining a proper syntax for the graphical language. Apart from more conventional syntactical operators and their semantic counterparts, we encounter unconventional ones, dealing with the typical graphical structure of the language. The synchronous nature of Statecharts makes special demands on the semantics, especially with respect to the causal relation between simultaneous events, and requires a refinement of our techniques for obtaining a denotational semantics for OCCAM [HGR]. We prove that the model is fully abstract with respect to some natural notion of observable behaviour. The model presented will serve as a basis for a further study of specification and proof systems within the ESPRIT-project DESCARTES.
This research was carried out in the context of ESPRIT-project 937, DESCARTES (Debugging and Specification of Ada Real-Time Embedded Systems).
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. (1985), The Synchronous Programming Language ESTEREL and its Mathematical Semantics, in "Proc. CMU Seminar on Concurrency", LNCS 197, pp. 389–449, Springer-Verlag, New York.
Bergerand J.-L., Caspi P., Halbwachs N. (1985), Outline of a real-time dataflow language, in "Proc. IEEE-CS Real-Time systems Symposium", San Diego.
Damm W., Döhmen G. (1987), An axiomatic approach to the specification of distributed computer architectures, in "Proc. PARLE Parallel Architectures and Languages Europe, Vol I", LNCS 258, Springer Verlag, Berlin.
Gonthier G., (1988), Ph.D. Thesis, Institute Nationale de Récherche en Informatique et en Automatique, Sophia-Antipolis, to appear.
Gerth R., Boucher A., A Timed Failures Model for Extended Communicating Processes (1986), in "Proc. 14th Colloquium Automata, Languages and Programming ICALP", LNCS 267, pp. 95–114, Springer Verlag, Berlin.
Le Guernic P., Beneviste A., Bournal P., Ganthier T. (1985), SIGNAL: A Data Flow Oriented Language For Signal Processing, IRISA Report 246, IRISA, Rennes, France.
Harel D. (1987), Statecharts: A visual Approach to Complex Systems, Science of Computer Programming, Vol. 8-3, pp. 389–449, pp. 231–274.
Hennessy M., Plotkin G. (1979), Full Abstraction for a Simple Programming Language, in "Proc. Math. Foundat. of Comput. Science", LNCS 74, pp. 108–120, Springer Verlag, New York.
Huizing C., Gerth R., De Roever W.P., (1987), Full Abstraction of a Real-Time Denotational Semantics for an OCCAM-like language, in "Proc. 14th ACM Symposium on Principles of Programming Languages POPL", pp. 223–237.
Hooman J. (1987), A compositional proof theory for real-time distributed message passing, in "Proc. PARLE Parallel Architectures and Languages Europe, Vol II", LNCS 259, pp. 315–332.
Harel D., Pnueli A. (1985), On the Development of Reactive Systems, Logic and Models of Concurrent Systems, in "Proc. of the NATO Advanced Study Institute on Logics and Models for Verification and Specification of Concurrent Systems", NATO ASI Series F, Vol. 13, pp. 477–498 Springer Verlag, Berlin.
Harel D., Pnueli A., Pruzan-Schmidt J., Sherman R. (1987), On the Formal Semantics of Statecharts, in "Proc. Symposion on Logic in Computer Science (LICS)", pp. 54–64.
Hopcroft J.E., Ullman J.D. (1979), Introduction to automata theory, languages, and computation, Addison-Wesley, Reading.
Koymans R., Shyamasundar R.K., De Roever W.P., Gerth R., Arun-Kumar S. (1988), Compositional Semantics for Real-Time Distributed Computing, Information and Control, to appear.
Mazurkiewicz A., Proving algorithms by tail functions, Information and Control, 18, (1971), pp. 220–226.
Salwicki A., Müldner T. (1981), On the Algorithmic Properties of Concurrent Programs, in "Proc. Logic of Programs", LNCS 125, Springer Verlag, New York.
Strachey C., Wadsworth C.P., Continuations: A Mathematical Semantics for Handling Full Jumps, Technical Monograph PRG-11, Oxford University Computing Laboratory, Oxford.
Zwiers J. (1988), Compositionality and dynamic networks of processes: Investigating verification systems for DNP, Ph.D. Thesis, Eindhoven University of Technology, to appear.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1988 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Huizing, C., Gerth, R., de Roever, W.P. (1988). Modelling statecharts behaviour in a fully abstract way. In: Dauchet, M., Nivat, M. (eds) CAAP '88. CAAP 1988. Lecture Notes in Computer Science, vol 299. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0026110
Download citation
DOI: https://doi.org/10.1007/BFb0026110
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-19021-9
Online ISBN: 978-3-540-38930-9
eBook Packages: Springer Book Archive