Abstract
We propose an axiomatic semantics for the synchronous language Gentzen, which is an instantiation of the paradigm Timed Concurrent Constraint Programming. We view Gentzen as a prototype of the class of state-oriented synchronous languages, since it offers the basic constructs that are shared by the languages in the class. Since synchronous concurrency cannot be simulated by arbitrary interleaving, we cannot exploit “head normal forms”, on which axiomatic theories for asynchronous process calculi are based.
Research partially supported by ESPRIT Working Group COTIC, Project Number 23677, and by MURST Progetto Cofinanziato TOSCA.
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
Aceto, L.: Deriving complete inference systems for a class of GSOS languages generating regular behaviors. Proc. of CONCUR’ 94, Springer LNCS 836, 1994.
Aceto, L., Bloom, B. and Vaandrager, F.: Turning SOS rules into equations. Information and Computation 111, 1994.
André, C.: Representation and analysis of reactive behaviors: a synchronous approach. Presented at CESA’ 96, IEEE-SMC, Lille, France, 1996.
Benveniste, A. and Berry, G. (editors): Another look at real-time systems. Proceedings of the IEEE 79, 1991.
Bergstra, J.A. and Klop, J.W.: A complete inference system for regular processes with silent moves. Proc. of Logic Colloquium 1986, North Holland, 1988.
Bergstra, J.A. and Klop, J.W.: Process algebra for synchronous communication. Information and Computation 60, 1984.
Berry, G.: The constructive semantics of pure Esterel. Version 3.0, 1999. URL: http://www.inria.fr/meije/personnel/Gerard.Berry.html.
Berry, G. and Gonthier, G.: The Esterel synchronous programming language: design, semantics, implementation. Science of Computer Programming 19, 1992.
Caspi, P., Halbwachs, N., Pilaud, P. and Plaice, J.: Lustre, a declarative language for programming synchronous systems. Proc. of POPL’ 87, ACM Press, 1987.
Gonthier, G: Sémantique et modèles d’exécution des langages réactifs synchrones; application à Esterel. Thèse d’ informatique, Univesité d’Orsay, France, 1988.
Halbwachs, N.: Synchronous programming of reactive systems. Kluwer Academic Publishers, Dordrecht, 1993.
Harel, D.: Statecharts: A visual formalism for complex systems. Science of Computer Programming 8, 1987.
Harel, D. and Naamad, A.: The Statemate semantics of Statecharts. ACM Transactions on Software Engineering Methodologies 5, 1996.
Harel, D. and Pnueli, A.: On the development of reactive systems. In K.R. Apt editor, Logic and Models of Concurrent Systems, NATO, ASI-13, Springer, 1985.
Huizing, C. and Gerth, R.: Semantics of reactive systems in abstract time. Proc. of REX Workshop “Real Time: Theory in Practice”, Springer LNCS 600, 1992.
Maraninchi, F.: Operational and compositional semantics of synchronous automaton composition. Proc. of CONCUR’ 92, Springer LNCS 630, 1992.
Milner, R.: A complete inference system for a class of regular behaviors. Journal of Computer and System Sciences 28, 1984.
Moller, F.: The importance of the left merge operator in process algebras. Proc. of ICALP’ 90, Springer LNCS 443, 1990.
Plotkin, G.: A structural approach to operational semantics. Technical Report DAIMI FN-19, University of Aarhus, Denmark, 1981.
Pnueli, A. and Shalev, M.: What is a step: On the semantics for Statecharts. Proc. of TACS’ 91, Springer LNCS 526, 1991.
Saraswat, V.A., Jagadeesan, R. and Gupta, V.: Default timed concurrent constraint programming. Proc. of POPL’ 95, ACM Press, 1995.
Saraswat, V.A., Jagadeesan, R. and Gupta, V.: Timed default concurrent constraint programming. Journal of Symbolic Computation 11, 1996.
Scholtz, P., Nazareth, D. and Regensburger, F.: Mini-Statecharts: A compositional way to model parallel systems. In 9th Int. Conf. on Parallel and Distributed Computing Systems, Dijon, France, 1997.
de Simone, R.: Higher level synchronizing devices in SCCS-Meije. Theoretical Computer Science 37, 1985.
Tini, S.: On the expressiveness of Timed Concurrent Constraint Programming. Proc. of Express’ 99, Electronic Notes in Theoretical Computer Science 27, 1999.
Tini, S.: Structural Operational Semantics for Synchronous Languages. Ph.D. Thesis, Dipartimento di Informatica, University of Pisa, Italy, 2000.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Tini, S. (2001). An Axiomatic Semantics for the Synchronous Language Gentzen . In: Honsell, F., Miculan, M. (eds) Foundations of Software Science and Computation Structures. FoSSaCS 2001. Lecture Notes in Computer Science, vol 2030. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45315-6_26
Download citation
DOI: https://doi.org/10.1007/3-540-45315-6_26
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41864-1
Online ISBN: 978-3-540-45315-4
eBook Packages: Springer Book Archive