Event mining with event processing networks

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1574, Issue , 1999, Pages 474-478

  Perrochon, Louis ^a   Mann, Walter ^a   Kasriel, Stephane ^a   Luckham, David C ^a  

^a STANFORD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATA STREAMS; DYNAMIC MODELS;

COMMUNICATION MECHANISMS; COMMUNICATION TOPOLOGIES; DYNAMIC ALLOCATIONS; DYNAMIC RE-CONFIGURATION; EVENT PROCESSING; EVENT-PROCESSING ENGINE; LOCATION INDEPENDENT; PATTERN LANGUAGES;

DATA MINING;

EID: 84947748735     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48912-6_63     Document Type: Conference Paper

References (6)

1. Pratt, V. R. Modeling concurrency with partial orders. Int. J. of Parallel Programming, 1986. 15(1): p. 33-71.
2. RAPIDE, Rapide 1.0 Pattern Language Reference Manual. Stanford University, Stanford, 1997.
3. Luckham, D. C. and Frasca, B., Complex Event Processing in Distributed Systems. Computer Systems Laboratory Technical Report CSL-TR-98-754. Stanford University, Stanford, 1998.
4. Santoro, A., et al., eJava - Extending Java with Causality. In Proceedings of 10th International Conference on Software Engineering and Knowledge Engineering (SEKE’98). 1998. Redwood City, CA, USA.
5. Fidge, C. J., Timestamps in message-passing systems that preserve the partial ordering. Australian Computer Science Communications, 1988. 10(1): p. 55-66.
6. Wolfson, O., et al., Incremental Evaluation of Rules and its Relationship to Parallelism. In Proceedings of SIGMOD’91 Conference on the Management of Data. 1991. Boulder, CO: ACM Press.