Abstract
Event-pattern reactive programs are small programs that process an input stream of events to detect and act upon given temporal patterns. These programs are used in distributed systems to notify components when they must react.
We present the reaction algebra, a declarative language to define finite-state reactions. We prove that the reaction algebra is complete in the following sense: every event-pattern reactive system that can be described and implemented – in any formalism – using finite memory, can also be described in the reaction algebra.
This research was supported in part by NSF grants CCR-02-20134, CCR-02-09237, CNS-0411363, CCF-0430102, and CSR- 0615449, and by NAVY/ONR contract N00014-03-1-0939.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Aguilera, M.K., et al.: Matching events in a content-based subscription system. In: Symposium on Principles of Distributed Computing, pp. 53–61 (1999)
Baeten, J.C.M., Weijland, W.P.: Process Algebra. Cambridge University Press, Cambridge (1990)
Berry, G.: Proof, language, and interaction: essays in honour of Robin Milner. In: The foundations of Esterel, pp. 425–454. MIT Press, Cambridge (2000)
Carzaniga, A., Rosenblum, D.S., Wolf, A.L.: Design and evaluation of a wide-area event notification service. ACM Transactions on Computer Systems 19(3), 332–383 (2001)
Conway, J.H.: Regular algebra and finite machines. Chapman and Hall, Boca Raton (1971)
Goldin, D., Smolka, S.A., Wegner, P. (eds.): Interactive Computation: the New Paradigm. Springer, Heidelberg (2006)
Harel, D.: Statecharts: A visual formalism for complex systems. Science of Computer Programming 8(3), 231–274 (1987)
Hoare, C.A.R.: Communicating Sequential Processes. Prentice-Hall, Englewood Cliffs (1985)
Hopcroft, J.E., Ullman, J.D.: Introduction to automata theory, languages and computation. Addison-Wesley, Reading (1979)
Hunleth, F., Cytron, R., Gill, C.D.: Building customizable middleware using aspect oriented programming. In: Works. on Advanced Separation of Concerns (OOPSLA 2001) (2001)
Kleene, S.C.: Representation of events in nerve nets and finite automata. In: Shannon, C.E., McCarthy, J. (eds.) Automata Studies, vol. 34, pp. 3–41. Princeton University Press, Princeton (1956)
Kozen, D.: A completeness theorem for kleene algebras and the algebra of regular events. Information and Computation 110(2), 366–390 (1994)
Lynch, N., Tuttle, M.: An introduction to Input/Output automata. CWI-Quarterly 2(3) (1989)
McNaughton, R.F., Yamada, H.: Regular expressions and state graphs for automata. IEEE Transactions on Electronic Computers 9, 39–47 (1960)
Mealy, G.H.: A method for synthesizing sequential circuits. Bell Systems Technical Journal 34(5), 1045–1079 (1955)
Milner, R.: Communication and Concurrency. Prentice-Hall, Englewood Cliffs (1989)
Moore, E.F.: Gedanken-Experiments on sequential machines. In: Automata Studies, pp. 129–153 (1956)
Plotkin, G.D.: A Structural Approach to Operational Semantics. Technical Report DAIMI FN-19, University of Aarhus (1981)
Rutten, J.J.: Automata and coinduction (an exercise in coalgebra). In: CONCUR (1998)
Salomaa, A.: Two complete axiom systems for the algebra of regular events. Journal of the ACM 13(1), 158–169 (1966)
Sánchez, C., et al.: Event correlation: Language and semantics. In: Alur, R., Lee, I. (eds.) EMSOFT 2003. LNCS, vol. 2855, pp. 323–339. Springer, Heidelberg (2003)
Sánchez, C., et al.: Final semantics for Event-Pattern Reactive Programs. In: Fiadeiro, J.L., et al. (eds.) CALCO 2005. LNCS, vol. 3629, pp. 364–378. Springer, Heidelberg (2005)
Sánchez, C., et al.: Expressive completeness of an event-pattern reactive programming language. In: Wang, F. (ed.) FORTE 2005. LNCS, vol. 3731, pp. 529–532. Springer, Heidelberg (2005)
Schmidt, D., Levine, D., Harrison, T.: The design and performance of a real-time CORBA object event service. In: Proc. of OOPSLA (1997)
Segall, B., Arnold, D.: Elvin has left the building: A publish/subscribe notification service with quenching. In: Queensland AUUG Summer Technical Conference, Brisbane, Australia (1997)
Tardieu, O.: A deterministic logical semantics for Esterel. In: Workshop on Structural Operational Semantics, SOS (2004)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Sánchez, C., Slanina, M., Sipma, H.B., Manna, Z. (2008). The Reaction Algebra: A Formal Language for Event Correlation. In: Avron, A., Dershowitz, N., Rabinovich, A. (eds) Pillars of Computer Science. Lecture Notes in Computer Science, vol 4800. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-78127-1_33
Download citation
DOI: https://doi.org/10.1007/978-3-540-78127-1_33
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-78126-4
Online ISBN: 978-3-540-78127-1
eBook Packages: Computer ScienceComputer Science (R0)