TCC, with history

1Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Modern computer systems are awash in a sea of asynchronous events. There is an increasing need for a declarative language that can permit business users to specify complex event-processing rules. Such rules should be able to correlate different event streams, detect absence of events (negative information), permit aggregations over sliding windows, specify dependent sliding windows etc. For instance it should be possible to precisely state a rule such as "Every seventh trading session that DowJones has risen consecutively, and IBM's stock is off 3% over its average in this period, evaluate IBM position", "Declare the sensor as faulty if no reading has been received for 500 ms", etc. Further, the language should be implementable efficiently in an event-driven fashion. We propose the Timed (Default) Concurrent Constraint, TCC, programming framework as a foundation for such complex event processing. The framework (developed in the mid 90s) interprets computation as deduction in a fragment of linear temporal logic. It permits the programmer to write rules that can react instantaneously to incoming events and determine the "resumption" that will respond to subsequent events. The framework is very powerful in that it permits instantaneous pre-emption, and allows user-definable temporal operators ("multi-form time"). However, the TCC framework "forgets" information from one instant to the next. We make two extensions. First, we extend the TCC model to carry the store from previous time instants as "past" information in the current time instant. This permits rules to be written with rich queries over the past. Second, we show that many of the powerful properties of the agent language can be folded into the query language by permitting agents and queries to be defined mutually recursively, building on the testing interpretation of intuitionistic logic described in RCC [21]. We show that this permits queries to move "back and forth" in the past, e.g. "Order a review if the last time that IBM stock price dropped by 10% in a day, there was more than 20% increase in trading volume for Oracle the following day." We provide a formal semantics for TCC + Histories and establish some basic properties. © 2014 Springer International Publishing Switzerland.

Cite

CITATION STYLE

APA

Saraswat, V., Gupta, V., & Jagadeesan, R. (2014). TCC, with history. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8464 LNCS, pp. 458–475). Springer Verlag. https://doi.org/10.1007/978-3-319-06880-0_24

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free