Norman H. Cohen
Karl Trygve Kalleberg
ABSTRACT
EventScript is a simple but powerful language for programming reactive processes. A stream of incoming events is matched against a regular expression. Actions embedded within the regular expression are executed in response to the matching of patterns of events. These actions include assigning computed values to variables and emitting output events. The definition of EventScript presented a number of novel and interesting language-design choices. EventScript has an efficient implementation, and has been used in a development environment for complex event-based applications. We have used EventScript to program both small examples and large industrial applications. Readers of EventScript programs find them easy to understand, and are comfortable with the familiar model of matching regular expressions.
- Adi, Asaf, Botzer, David, and Etzion, Opher. The situation manager component of Amit-active middleware technology. In Alon Halevy and Avigdor Gal, eds., Next Generation Information Systems and Technologies: 5th International Workshop, NGITS 2002, Caesarea, Israel, June 24-25 2002, Proceedings. LNCS 2382, Springer, Berlin, 2002, 158--168. Google Scholar
Digital Library
- Amini, Lisa, Jain, Navendu, Sehgal, Anshul, Silber, Jeremy, and Verscheure, Olivier. Adaptive control of extreme-scale stream processing systems. 26th IEEE International Conference on Distributed Computing Systems (ICDCS '06), 2006, 71--77. Google ScholarDigital Library
- Benveniste, Albert, Caspi, Paul, Edwards, Stephen A., Halbwachs, Nicolas, le Guernic, Paul, and de Simone, Robert. The synchronous languages 12 years later. Proc. IEEE 91, No. 1 (Jan. 2003), 64--83.Google ScholarCross Ref
- Berry, Gérard. The Esterel v5 Language Primer: Version 5.21 release 2.0. Centre de Mathématiques Appliquées, Sophia-Antipolis, France, Apr. 1999. ftp://ftp-sop.inria.fr/meije/esterel/papers/primer.pdfGoogle Scholar
- Bruggemann-Klein, Anne, and Wood, Derick. One-unambiguous regular languages. Information and Computation 142, 2 (1998), 182--206. Google ScholarDigital Library
- Brzozowski, Janusz A. Derivatives of regular expressions. J. ACM 11, 4 (Oct. 1964), 481--194. Google ScholarDigital Library
- Chakavarthy, Sharma, and Mishra, Deepak. Snoop: an expressive event specification language for active databases. Tech. report UF-CIS-TR-93-007, Dept. of Comp. and Inf. Sci., U. of Florida, Mar. 1993.Google Scholar
- Chen, H., Chou, P.B., Cohen, N.H., Duri, S.S., and Jung, C.W. A distributed responsive infrastructure virtualization environment for sensor and actuator applications. IBM Sys. J. 47, No. 2 (May 2008).Google ScholarDigital Library
- Cohen, Norman H. EventScript: Using regular expressions to program event-processing agents. IBM Research Report RC 24387, October 23, 2007Google Scholar
- Collet, Christine, and Coupaye, Thierry. Primitive and Composite Events in NAOS. Actes des 12e Journées Bases de Données Avancées, Cassis (France), August 1996, 331--349.Google Scholar
- Dayal, U., Blaustein, B., Buchmann, A., Chakravarthy, U., Hsu, M., Ledin, R., McCarthy, D., Rosenthal, A., Sarin, S., Carey, M. J., Livny, M., and Jauhari, R. The HiPAC project: combining active databases and timing constraints. SIGMOD Rec. 17, 1 (Mar. 1988), 51--70. Google ScholarDigital Library
- Dittrich, Klaus R., Fritschi, Hans, Gatziu, Stella, Geppert, Andreas, and Vaduva, Anca. SAMOS in hindsight: experiences in building an active object-oriented DBMS. Technical report 2000.05, Database Technology Research Group, University of Zurich Department of Information Technology, ftp://ftp.ifi.unizh.ch/pub/techreports/TR-2000/ifi-2000.05.pdf Google ScholarDigital Library
- Gehani, Narain, Jagadish, H. V., and Shmueli, O. COMPOSE: a system for composite event specification and detection. In Adam, Nabil R., and Bhargava, Barat K., eds., Advanced Database Systems, LNCS 759, 1994, 3--15. Google ScholarDigital Library
- Glushkov, V.M. The abstract theory of automata. Russian Mathematical Surveys 16 (1961), 1--53.Google ScholarCross Ref
- Halbwachs, Nicolas, Caspi, Paul, Raymond, Pascal, and Pilaud, Daniel. The synchronous data flow language LUSTRE. Proc. IEEE 79, No. 9 (Sep. 1991), 1305--1320.Google ScholarCross Ref
- Harel, David. Statecharts: a visual formalism for complex systems. Science of Computer Programming 8 (1987) 231--274. Google ScholarDigital Library
- Kappel, Gerti, Rausch-Schott, Stefan, and Retschitzegger, Werner. A tour on the TriGS active database system--architecture and implementation. In Proceedings of the 1998 ACM Symposium on Applied Computing (SAC '98), Atlanta, Georgia, Feb. 27 - Mar. 1, 1998, 211--219. Google ScholarDigital Library
- Luckham, David. The Rapide pattern language. In The Power of Events: An Introduction to Complex Event Processing in Distributed Enterprise Systems. Addison-Wesley, Boston, 2002, chapter 8.Google ScholarDigital Library
- Maraninchi, F. The Argos language: graphical representation of automata and description of reactive systems. Proceedings, IEEE Workshop on Visual Languages, Kobe, Japan, Oct. 1991.Google Scholar
- McNaughton, R., and Yamada, H. Regular expressions and state graphs for automata. IRE Transactions on Electronic Computers EC-9, 1 (Mar. 1960), 39--47.Google ScholarCross Ref
- Rabin, M.O., and Scott, D. Finite automata and their decision problems. IBM Journal of Research and Development 3, 2 (April 1959), 114--125.Google ScholarDigital Library
- Thompson, Ken. Regular expression search algorithm. Commun. ACM 11, 6 (June 1968), 419--422. Google ScholarDigital Library
Index Terms
- EventScript: an event-processing language based on regular expressions with actions
Recommendations
EventScript: an event-processing language based on regular expressions with actions
LCTES '08EventScript is a simple but powerful language for programming reactive processes. A stream of incoming events is matched against a regular expression. Actions embedded within the regular expression are executed in response to the matching of patterns of ...
Union-Complexities of Kleene Plus Operation
Descriptional Complexity of Formal SystemsAbstractUnion-free expressions are used in union normal form to decompose any regular language to a finite union of union-free languages. Based on the automata characterisation of the union-free languages, by restricting the 1CFPAs not to have transitions ...
Construction of fuzzy automata from fuzzy regular expressions
Li and Pedrycz have proved fundamental results that provide different equivalent ways to represent fuzzy languages with membership values in a lattice-ordered monoid, and generalize the well-known results of the classical theory of formal languages. In ...
Comments