Expressive Completeness of an Event-Pattern Reactive Programming Language

Cesar Sanchez, Matteo Slanina, Henny B. Sipma, Zohar Manna

Event-pattern reactive programs serve reactive components by pre-processing the input event stream and generating notifications according to temporal patterns. Our general model of event-pattern reactions can express every ``reasonable'' model of message-passing reactive system, including input-output machines.

The declarative language PAR allows the expression of complex event-pattern reactions. PAR is a programming language and therefore is intrinsically deterministic. 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---in any formalism---using finite memory can also be described in PAR.

In Formal Techniques for Networked and Distributed Systems (FORTE 2005): 25th IFIP WG 6.1 International Conference, October 2005, Lecture Notes in Computer Science, Volume 3731, Springer Verlag, pp 529-532.

Postscript, PDF. © 2005, Springer Verlag.

© Henny Sipma /
Last modified: Thu Jan 12 14:40:50 PDT 2004