[go: up one dir, main page]
More Web Proxy on the site http://driver.im/
Skip to main content

The Reaction Algebra: A Formal Language for Event Correlation

  • Chapter
Pillars of Computer Science

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4800))

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 to check access.

Access this chapter

Subscribe and save

Springer+ Basic
£29.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
GBP 19.95
Price includes VAT (United Kingdom)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
GBP 71.50
Price includes VAT (United Kingdom)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
GBP 89.99
Price includes VAT (United Kingdom)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Aguilera, M.K., et al.: Matching events in a content-based subscription system. In: Symposium on Principles of Distributed Computing, pp. 53–61 (1999)

    Google Scholar 

  2. Baeten, J.C.M., Weijland, W.P.: Process Algebra. Cambridge University Press, Cambridge (1990)

    Google Scholar 

  3. Berry, G.: Proof, language, and interaction: essays in honour of Robin Milner. In: The foundations of Esterel, pp. 425–454. MIT Press, Cambridge (2000)

    Google Scholar 

  4. 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)

    Article  Google Scholar 

  5. Conway, J.H.: Regular algebra and finite machines. Chapman and Hall, Boca Raton (1971)

    MATH  Google Scholar 

  6. Goldin, D., Smolka, S.A., Wegner, P. (eds.): Interactive Computation: the New Paradigm. Springer, Heidelberg (2006)

    MATH  Google Scholar 

  7. Harel, D.: Statecharts: A visual formalism for complex systems. Science of Computer Programming 8(3), 231–274 (1987)

    Article  MATH  MathSciNet  Google Scholar 

  8. Hoare, C.A.R.: Communicating Sequential Processes. Prentice-Hall, Englewood Cliffs (1985)

    MATH  Google Scholar 

  9. Hopcroft, J.E., Ullman, J.D.: Introduction to automata theory, languages and computation. Addison-Wesley, Reading (1979)

    MATH  Google Scholar 

  10. Hunleth, F., Cytron, R., Gill, C.D.: Building customizable middleware using aspect oriented programming. In: Works. on Advanced Separation of Concerns (OOPSLA 2001) (2001)

    Google Scholar 

  11. 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)

    Google Scholar 

  12. Kozen, D.: A completeness theorem for kleene algebras and the algebra of regular events. Information and Computation 110(2), 366–390 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  13. Lynch, N., Tuttle, M.: An introduction to Input/Output automata. CWI-Quarterly 2(3) (1989)

    Google Scholar 

  14. McNaughton, R.F., Yamada, H.: Regular expressions and state graphs for automata. IEEE Transactions on Electronic Computers 9, 39–47 (1960)

    Article  Google Scholar 

  15. Mealy, G.H.: A method for synthesizing sequential circuits. Bell Systems Technical Journal 34(5), 1045–1079 (1955)

    MathSciNet  Google Scholar 

  16. Milner, R.: Communication and Concurrency. Prentice-Hall, Englewood Cliffs (1989)

    MATH  Google Scholar 

  17. Moore, E.F.: Gedanken-Experiments on sequential machines. In: Automata Studies, pp. 129–153 (1956)

    Google Scholar 

  18. Plotkin, G.D.: A Structural Approach to Operational Semantics. Technical Report DAIMI FN-19, University of Aarhus (1981)

    Google Scholar 

  19. Rutten, J.J.: Automata and coinduction (an exercise in coalgebra). In: CONCUR (1998)

    Google Scholar 

  20. Salomaa, A.: Two complete axiom systems for the algebra of regular events. Journal of the ACM 13(1), 158–169 (1966)

    Article  MATH  MathSciNet  Google Scholar 

  21. 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)

    Google Scholar 

  22. 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)

    Google Scholar 

  23. 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)

    Chapter  Google Scholar 

  24. Schmidt, D., Levine, D., Harrison, T.: The design and performance of a real-time CORBA object event service. In: Proc. of OOPSLA (1997)

    Google Scholar 

  25. 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)

    Google Scholar 

  26. Tardieu, O.: A deterministic logical semantics for Esterel. In: Workshop on Structural Operational Semantics, SOS (2004)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Arnon Avron Nachum Dershowitz Alexander Rabinovich

Rights and permissions

Reprints 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)

Publish with us

Policies and ethics