Abstract
Event-pattern reactive programs serve reactive components by pre-processing the input event stream and generating notifications according to temporal patterns. The declarative language PAR allows the expression of complex event-pattern reactions. Despite its simplicity and deterministic nature, PAR is expressively complete in the following sense: every event-pattern reactive system that can be described and implemented using finite memory can also be expressed in PAR
This research was supported in part by NSF grants CCR-01-21403, CCR-02-20134, CCR-02-09237, CNS-0411363, and CCF-0430102, by ARO grant DAAD19-01-1- 0723, and by NAVY/ONR contract N00014-03-1-0939.
Chapter PDF
Similar content being viewed by others
References
Hopcroft, J.E., Ullman, J.D.: Introduction to automata theory, languages and computation. Addison-Wesley, Reading (1979)
Pietzuch, P.R., Shand, B., Bacon, J.: Composite event detection as a generic middleware extension. IEEE Network 18(1) (2004)
Sánchez, C., Sankaranarayanan, S., Sipma, H.B., Zhang, T., Dill, D.L., Manna, Z.: 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., Sipma, H.B., Słanina, M., Manna, Z.: Final semantics for event-pattern reactive programs. In: Fiadeiro, J.L., Harman, N.A., Roggenbach, M., Rutten, J. (eds.) CALCO 2005. LNCS, vol. 3629, pp. 364–378. Springer, Heidelberg (2005)
Sánchez, C., Slanina, M., Sipma, H.B., Manna, Z.: Expressive completeness of an event-pattern reactive programming language, Stanford CS REACT Technical Report (2005), http://Theory.Stanford.EDU/~cesar/papers/completeness.html
Segall, B., Arnold, S.: Elvin has left the building: A publish/subscribe notification service with quenching. In: Queensland AUUG Summer Tech. Conf. (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 IFIP International Federation for Information Processing
About this paper
Cite this paper
Sánchez, C., Slanina, M., Sipma, H.B., Manna, Z. (2005). Expressive Completeness of an Event-Pattern Reactive Programming Language. In: Wang, F. (eds) Formal Techniques for Networked and Distributed Systems - FORTE 2005. FORTE 2005. Lecture Notes in Computer Science, vol 3731. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11562436_39
Download citation
DOI: https://doi.org/10.1007/11562436_39
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-29189-3
Online ISBN: 978-3-540-32084-5
eBook Packages: Computer ScienceComputer Science (R0)