Search
Now showing items 1-10 of 55
Hybrid Atomicity for Nested Transactions
(1992-10)
This paper defines the notion of hybrid atomicity for nested transaction systems, and presents and verifies an algorithm providing this property. Hybrid atomicity is a modular property; it allows the correctness of a system ...
Forward and Backward Simulations Part I: Untimed Systems (Replaces TM-486)
(1993-03)
A unified, comprehensive presentation of simulation techniques for verification of concurrent systems is given, in terms of a simple untimed automaton model. In particular, (1) refinements, (2) forward and backward ...
Compositionality for Probabilistic Automata
We establish that on the dfomain of probabilistic automata, the trace distribution preorder coincides with the simulation preorder.
Consensus in the Presence of Partial Synchrony
(1985-10)
The concept of partial synchrony in a distributed system is introduced. Partial synchrony lies between the cases of a synchronous system and an asynchronous system. In a synchronous system, there is a known fixed upper ...
Early-Delivery Dynamic Atomic Broadcast
(2002-04)
Relativization of the Theory of Computational Complexity
(1972-06)
Blum's machine-independent treatment of the complexity of partial recursive functions is extended to relative algorithms (as represented by Turing machines with oracles). We prove relativizations of several results of ...
Hybrid I/O Automata*
(2003-01)
Hybrid systems are systems that exhibit a combination of discrete and continuous behavior. Typical hybrid systems include computer components, which operate in discrete program steps, and real-world components, whose ...