CoReA: A synchronous calculus of parallel communicating reactive automata
Reactive systems often require temporal and logical safety, concurrency and determinism. Several asynchronous or strong synchronous answers have been proposed to this problem. However, “asynchronous” languages such as CSP or CCS generally force the user to choose between determinism and concurrency. On the other hand, strong synchronous implementations are mainly sequential. The aim of this paper is to present a new paradigm for concurrent reactive programming, weak synchronism, responding to both concurrency and determinism.
Unable to display preview. Download preview PDF.
- 1.M. Adelantado, F. Boniol, M. Cubero-Castan, V. David, B. Lécussan, and R. Porche. Synchronous/Asynchronous Approaches for Intelligent Real-Time Systems. In EUROMICRO'93 Workshop on Real-Time Systems, Oulu, Finland, June 1993.Google Scholar
- 2.M. Adelantado, F. Boniol, M. Cubero-Castan, N. Hifdi, B. Lécussan, V. David, and R. Porche. Projet SATURNE: Modèle de Programmation et Modèle d'Exécution pour un Système Temps-Réel d'Aide à la Décision. Technical Report 1/3447.00/DERI, CERT-ONERA Dépt. d'Informatique, Toulouse, January 1993.Google Scholar
- 3.A. Benveniste and G. Berry. The synchronous approach to reactive and realtime systems. Proceedings of IEEE, Another Look at Real-time programming, 79(9):1270–1282, September 1991.Google Scholar
- 4.G. Berry. Communicating Reactive Processes. In Proc. of the 20th Annual Symp. on Principles of Programming Languages, 1993.Google Scholar
- 7.R. Milner. Calculi for synchrony and asynchrony. Theoretical Computer Science, 25(3), 1983.Google Scholar