Análise de controle de concorrência e escalonamento de transações em bancos de dados em tempo-real usando redes de petri.

Abstract

This work presents a model to analyze the scheduling of transactions for real-time databases considering semantic concurrency control mechanisms. The model is based on a modeling method for real-time databases using Colored Petri nets (CPN). The features of a semantic concurrency control technique are supported by the restrictions of the compatibility functions that are enough to bound the resulting imprecision of the trade-off between both the traditional logical consistency constraints of data and transactions, and the additional temporal consistency constraints of data and transactions. The CPN Model for real-time databases is analyzed using scenarios and messages sequences charts as well as the generation of the states space for scenarios. Performance tests are executed to verify if the transactions have fulfilled their deadlines.