Expressive completeness of an event-pattern reactive programming language

Authors:
César Sánchez;Matteo Slanina;Henny B. Sipma;Zohar Manna
Affiliations:
Computer Science Department, Stanford University, Stanford, CA;Computer Science Department, Stanford University, Stanford, CA;Computer Science Department, Stanford University, Stanford, CA;Computer Science Department, Stanford University, Stanford, CA
Venue:
FORTE'05 Proceedings of the 25th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
Year:
2005

Citing 3
Cited 6

Introduction To Automata Theory, Languages, And Computation

Introduction To Automata Theory, Languages, And Computation
Final semantics for event-pattern reactive programs

CALCO'05 Proceedings of the First international conference on Algebra and Coalgebra in Computer Science
Composite event detection as a generic middleware extension

IEEE Network: The Magazine of Global Internetworking

Temporal order optimizations of incremental joins for composite event detection

Proceedings of the 2007 inaugural international conference on Distributed event-based systems
Temporal constraints for rule-based event processing

Proceedings of the ACM first Ph.D. workshop in CIKM
EventJava: An Extension of Java for Event Correlation

Genoa Proceedings of the 23rd European Conference on ECOOP 2009 --- Object-Oriented Programming
The reaction algebra: a formal language for event correlation

Pillars of computer science
A resource-efficient event algebra

Science of Computer Programming
Reactive rules on the web

RW'07 Proceedings of the Third international summer school conference on Reasoning Web

Quantified Score

Hi-index	0.00

Visualization

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 inPAR