Distributed automata in an assumption-commitment framework

Assumption-Commitment in Automata

In the study of distributed systems, the assumption-commitment framework is crucial for compositional speciication of processes. The idea is that we reason about each process separately, making suitable assumptions about other processes in the system. Symmetrically, each process commits to certain actions which the other processes can rely on. We study such a framework from an automata-theoreti...

On Unifying Assumption { Commitment

Assumption{Commitment paradigms for speciication and veriication of concurrent programs have been proposed in the past. We show that two typical parallel composition rules for shared variable and message passing programs 8, 12] which hitherto required diierent formulations are instances of one general rule mainly inspired by Abadi & Lamport's composition theorem 1].

Extended Distributed Learning Automata An Automata-based Framework for Solving Stochastic Graph Optimization Problems

In this paper, a new structure for cooperative learning automata called extended learning automata (eDLA) is introduced. Based on the new structure, an iterative randomized heuristic algorithm using sampling is proposed for finding an optimal subgraph in a stochastic edge-weighted graph. Stochastic graphs are graphs in which the weights of edges have an unknown probability distribution. The pro...

Assumption-Commitment Specifications and Safety-Critical Systems

Quantum Bit Commitment from a Physical Assumption

Mayers and independently Lo and Chau have shown that unconditionally secure quantum bit commitment is impossible. In this paper we show that under the assumption that the sender is not able to perform generalized measurements involving more than n qubits coherently (n-coherent measurements) then quantum bit commitment is possible. A commitment scheme is δ-binding if for each execution there is ...