Expressive Completeness of an Event-Pattern Reactive Programming Language

@inproceedings{Snchez2005ExpressiveCO,
  title={Expressive Completeness of an Event-Pattern Reactive Programming Language},
  author={C{\'e}sar S{\'a}nchez and Matteo Slanina and Henny B. Sipma and Zohar Manna},
  booktitle={FORTE},
  year={2005}
}
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. 
BETA

Topics from this paper.

References

Publications referenced by this paper.

Similar Papers

Loading similar papers…