Sciweavers

5 search results - page 1 / 1
» On Termination for Faulty Channel Machines
Sort
View
CORR
2008
Springer
107views Education» more  CORR 2008»
13 years 5 months ago
On Termination for Faulty Channel Machines
A channel machine consists of a finite controller together with several fifo channels; the controller can read messages from the head of a channel and write messages to the tail of...
Patricia Bouyer, Nicolas Markey, Joël Ouaknin...
CORR
2008
Springer
97views Education» more  CORR 2008»
13 years 5 months ago
An Almost-Surely Terminating Polynomial Protocol for Asynchronous Byzantine Agreement with Optimal Resilience
Consider an asynchronous system with private channels and n processes, up to t of which may be faulty. We settle a longstanding open question by providing a Byzantine agreement pr...
Ittai Abraham, Danny Dolev, Joseph Y. Halpern
FOSSACS
2006
Springer
13 years 8 months ago
On Metric Temporal Logic and Faulty Turing Machines
Metric Temporal Logic (MTL) is a real-time extension of Linear Temporal Logic that was proposed fifteen years ago and has since been extensively studied. Since the early 1990s, it ...
Joël Ouaknine, James Worrell
FSTTCS
2007
Springer
13 years 11 months ago
Synthesis of Safe Message-Passing Systems
We show that any regular set of basic MSCs can be implemented by a deadlock-free communicating finite-state machine with local termination: Processes stop in local dead-states ind...
Nicolas Baudru, Rémi Morin
SPDP
1993
IEEE
13 years 9 months ago
Extended Distributed Genetic Algorithm for Channel Routing
In this paper, we propose a new parallel genetic alge rithm (GA), called Extended Distributed Genetic Algorithm (EDGA), for channel routing problem. The EDGA combines the advantag...
B. B. Prahlada Rao, R. C. Hansdah