The complexity of propositional linear temporal logics
Journal of the ACM (JACM)
On Gabbay's temporal fixed point operator
Theoretical Computer Science
Formalizing and validating behavioral models through the event calculus
Information Systems - Special issue: selected papers from the 9th International Conference on advanced information systems engineering (CA ISE '97)
Active Rules in Database Systems
Active Rules in Database Systems
Temporal Triggers in Active Databases
IEEE Transactions on Knowledge and Data Engineering
Implementing Temporal Integrity Constraints Using an Active DBMS
IEEE Transactions on Knowledge and Data Engineering
Composite Event Specification in Active Databases: Model & Implementation
VLDB '92 Proceedings of the 18th International Conference on Very Large Data Bases
Composite Events for Active Databases: Semantics, Contexts and Detection
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
Checking the temporal integrity of interactive multimedia documents
The VLDB Journal — The International Journal on Very Large Data Bases
On the Semantics of Complex Events in Active Database Management Systems
ICDE '99 Proceedings of the 15th International Conference on Data Engineering
Computation: finite and infinite machines
Computation: finite and infinite machines
Deterministic one-counter automata
Journal of Computer and System Sciences
Cordies: expressive event correlation in distributed systems
Proceedings of the Fourth ACM International Conference on Distributed Event-Based Systems
Seamless event and data stream processing: reconciling windows and consumption modes
DASFAA'11 Proceedings of the 16th international conference on Database systems for advanced applications - Volume Part I
| Hi-index | 0.00 |
A key facility of active database management systems is their ability to detect and react to the occurrence of events. Such events can be either atomic in nature, or specified using an event algebra to form complex events. An important role of an event algebra is to define the semantics of when events become invalid (event consumption). In this paper, we examine a simple event algebra and provide a logical framework for specification of various consumption policies. We then study the problems of equivalence and implication, identifying a powerful class of complex events for which equivalence is decidable. We then demonstrate how extensions of this class lead to undecidability.