56 search results - page 8 / 12 » Efficient Symbolic State-Space Construction for Asynchronous... |
STOC
2005
ACM
15 years 12 months ago
2005
ACM
The Write-All problem for an asynchronous shared-memory system has the objective for the processes to update the contents of a set of shared registers, while minimizing the mber o...
99
Voted
ICCAD
1999
IEEE
15 years 3 months ago
1999
IEEE
This paper presents a new method to synthesize timed asynchronous circuits directly from the specification without generating a state graph. The synthesis procedure begins with a ...
70
Voted
OPODIS
2004
15 years 1 months ago
2004
Consider an asynchronous system where each process begins with an arbitrary real value. Given some fixed > 0, an approximate agreement algorithm must have all non-faulty process...
ARTS
1997
Springer
15 years 3 months ago
1997
Springer
There have been significant advances on formal methods to verify complex systems recently. Nevertheless, these methods have not yet been accepted as a realistic alternative to the ...
97
Voted
FMCAD
2000
Springer
15 years 3 months ago
2000
Springer
Abstract. This paper presents a scalable method for parallel symbolic on-the-fly model checking in a distributed memory environment. Our method combines a scheme for on-the-fly mod...