Concurrent Transaction Logic with Priority and Timing Constraints

Concurrent Transaction Logic (CTTZ) is a deductive language for programming database transaction applications that integrates queries, updates, and transaction composition in a complete logical framework. The language supports all the properties of classical trans­actions and the properties found in some new transaction models, e.g., sub-transactions, transaction rollback, and concurrent transactions. 

The contributions of this thesis are twofold. First, it extends CTTZ to account for timing-event-based prioritized concurrent systems in which transactions may have pri­ority and timing constraints. This extension of CTTZ, here called TV-CTTZ, provides a high-level logic programming framework for specifying and simulating executions of timed transactions and trigger-events commonly present in real-time concurrent appli­cations. Second, it describes a Prolog implementation of TV-CTTZ. The implemented TV-CTTZ prototype supports the translation from TV-CTTZ to CTTZ. Underlying this protocol, we use a simplified Rate-Monotonic algorithm [10] to schedule the execution of constraint concurrent transactions and built-in timing predicates to handle transaction time-relations.