Search Results

In Girard's original presentation, proof structures of Linear Logic are hypergraphs whose hyperedges are labeled by logical rules and vertices represent the connections between these logical rules. Presentations of proof structures based on interaction ...

The process-aware information systems run in dynamic environments, so it must support changes at runtime. The changes of process model may result in process instances migrating to the modified process model, which is prone to introduce executing ...

The capability to dynamically adapt in-progress workflows (WF) is an essential requirement for any workflow management system (WfMS). This fact has been recognized by the WF community for a long time and different approaches in the area of adaptive ...

In a lazy master replicated database, a transaction can commit after updating one replica copy (primary copy) at some master node. After the transaction commits, the updates are propagated towards the other replicas (secondary copies), which are updated ...

How to exploit application semantics to improve the performance of a real-time data-intensive application has been an active research topic in the past few years. Weaker correctness criteria and semantics-based concurrency control algorithms were ...

Concurrency control protocols based on multiversions have been used in some commercial transaction processing systems in order to provide the serializable executions of transactions. In the existing protocols, transactions are allowed to read only the ...

a Abstract: Data replication is often considered in distributed database systems to enhance availability and performance. The benefit of data replication, however can only be realized at the cost of maintaining the consistency of data. In particular, ...

Supported by the Comissao de Aperfeicoamento de Pessoal de Nivel Superior (CAPES) and Universidade Federal da Paraiba, Brazil.In this paper we present a new cooperative transaction model. The model has been developed using a data-driven approach, where ...

Traditional transaction models ensure robustness for distributed applications through the properties of view and failure atomicity. It has generally been felt that such atomicity properties are restrictive for a wide range of application domains; this ...

ACTA is a comprehensive transaction framework that facilitates the formal description of properties of extended transaction models. Specifically, using ACTA, one can specify and reason about (1) the effects of transactions on objects and (2) the ...

It is shown that a combination of specification and program refinement may be applied to deriving efficient concurrent rule-based programs. Specification refinement is used to generate an initial rule-based program that is refined into a program which ...