Sciweavers

413 search results - page 24 / 83
» Synthesis of Distributed Algorithms Using Asynchronous Autom...
Sort
View
FOSSACS
2009
Springer
15 years 4 months ago
Facets of Synthesis: Revisiting Church's Problem
In this essay we discuss the origin, central results, and some perspectives of algorithmic synthesis of nonterminating reactive programs. We recall the fundamental questions raised...
Wolfgang Thomas
JSAC
2006
88views more  JSAC 2006»
14 years 9 months ago
OSNR optimization in optical networks: modeling and distributed algorithms via a central cost approach
Abstract-- This paper addresses the problem of optical signalto-noise ratio (OSNR) optimization in optical networks. An analytical OSNR network model is developed for a general mul...
L. Pavel
SAC
2010
ACM
15 years 4 months ago
Asynchronous Byzantine consensus with 2f+1 processes
Byzantine consensus in asynchronous message-passing systems has been shown to require at least 3f + 1 processes to be solvable in several system models (e.g., with failure detecto...
Miguel Correia, Giuliana Santos Veronese, Lau Cheu...
CAV
2009
Springer
155views Hardware» more  CAV 2009»
15 years 10 months ago
Better Quality in Synthesis through Quantitative Objectives
Abstract. Most specification languages express only qualitative constraints. However, among two implementations that satisfy a given specification, one may be preferred to another....
Roderick Bloem, Krishnendu Chatterjee, Thomas A. H...
PODC
2003
ACM
15 years 2 months ago
Performing work with asynchronous processors: message-delay-sensitive bounds
This paper considers the problem of performing tasks in asynchronous distributed settings. This problem, called DoAll, has been substantially studied in synchronous models, but th...
Dariusz R. Kowalski, Alexander A. Shvartsman