The reaction algebra: a formal language for event correlation

Authors:
César Sánchez;Matteo Slanina;Henny B. Sipma;Zohar Manna
Affiliations:
Computer Science Department, Stanford University, Stanford, CA;Google Inc., Mountain View, CA;Computer Science Department, Stanford University, Stanford, CA;Computer Science Department, Stanford University, Stanford, CA
Venue:
Pillars of computer science
Year:
2008

Citing 15
Cited 0

Communicating sequential processes

Communicating sequential processes
Statecharts: A visual formalism for complex systems

Science of Computer Programming
Process algebra

Process algebra
A completeness theorem for Kleene algebras and the algebra of regular events

Papers presented at the IEEE symposium on Logic in computer science
The design and performance of a real-time CORBA event service

Proceedings of the 12th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
Matching events in a content-based subscription system

Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing
Two Complete Axiom Systems for the Algebra of Regular Events

Journal of the ACM (JACM)
The foundations of Esterel

Proof, language, and interaction
Design and evaluation of a wide-area event notification service

ACM Transactions on Computer Systems (TOCS)
Communication and Concurrency

Communication and Concurrency
Introduction to Automata Theory, Languages and Computability

Introduction to Automata Theory, Languages and Computability
Automata and Coinduction (An Exercise in Coalgebra)

CONCUR '98 Proceedings of the 9th International Conference on Concurrency Theory
Interactive Computation: The New Paradigm

Interactive Computation: The New Paradigm
Final semantics for event-pattern reactive programs

CALCO'05 Proceedings of the First international conference on Algebra and Coalgebra in Computer Science
Expressive completeness of an event-pattern reactive programming language

FORTE'05 Proceedings of the 25th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems

Quantified Score

Hi-index	0.00

Visualization

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.