Glasgow automata illustrated: DEBS grand challenge

  • Authors:
  • Alexandros Koliousis;Joseph Sventek

  • Affiliations:
  • University of Glasgow;University of Glasgow

  • Venue:
  • Proceedings of the 6th ACM International Conference on Distributed Event-Based Systems
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

The challenge is solved using Glasgow automata, concise complex event processing engines executable in the context of a topic-based publish/subscribe cache of event streams and relations. The imperative programming style of the Glasgow Automaton Programming Language (GAPL) enables multiple, efficient realisations of the two challenge queries.