You are required to read and agree to the below before accessing a full-text version of an article in the IDE article repository.

The full-text document you are about to access is subject to national and international copyright laws. In most cases (but not necessarily all) the consequence is that personal use is allowed given that the copyright owner is duly acknowledged and respected. All other use (typically) require an explicit permission (often in writing) by the copyright owner.

For the reports in this repository we specifically note that

  • the use of articles under IEEE copyright is governed by the IEEE copyright policy (available at http://www.ieee.org/web/publications/rights/copyrightpolicy.html)
  • the use of articles under ACM copyright is governed by the ACM copyright policy (available at http://www.acm.org/pubs/copyright_policy/)
  • technical reports and other articles issued by M‰lardalen University is free for personal use. For other use, the explicit consent of the authors is required
  • in other cases, please contact the copyright owner for detailed information

By accepting I agree to acknowledge and respect the rights of the copyright owner of the document I am about to access.

If you are in doubt, feel free to contact webmaster@ide.mdh.se

A resource-efficient event algebra

Fulltext:


Authors:

Jan Carlson, Björn Lisper

Research group:

Programming Languages

Publication Type:

Journal article

Venue:

Science of Computer Programming

Publisher:

Elsevier

DOI:

http://dx.doi.org/doi:10.1016/j.scico.2010.06.010

Abstract

Events play many roles in computer systems, ranging from hardware interrupts, over event-based software architecture, to monitoring and managing of complex systems. In many applications, however, individual event occurrences are not the main point of concern, but rather the occurrences of certain event patterns. Such event patterns can be defined by means of an event algebra, i.e., expressions representing the patterns of interest are built from simple events and operators such as disjunction, sequence, etc.We propose a novel event algebra with intuitive operators (a claim which is supported by a number of algebraic properties). We also present an efficient detection algorithm that correctly detects any expression with bounded memory, which makes this algebra particularly suitable for resource-constrained applications such as embedded systems.

Bibtex

@article{Carlson1836,
author = {Jan Carlson and Bj{\"o}rn Lisper},
title = {A resource-efficient event algebra},
volume = {75},
number = {12},
pages = {1215--1234},
month = {December},
year = {2010},
journal = {Science of Computer Programming},
publisher = {Elsevier},
url = {http://www.es.mdu.se/publications/1836-}
}