1074 search results - page 156 / 215 » An ASM-Characterization of a Class of Distributed Algorithms |
CONCUR
2000
Springer
15 years 2 months ago
2000
Springer
Model checking based on the causal partial order semantics of Petri nets is an approach widely applied to cope with the state space explosion problem. One of the ways to exploit su...
STACS
1999
Springer
15 years 2 months ago
1999
Springer
Abstract. We advocate to analyze the average complexity of learning problems. An appropriate framework for this purpose is introduced. Based on it we consider the problem of learni...
102
click to vote
CONCUR
1997
Springer
15 years 1 months ago
1997
Springer
We apply the symbolic analysis principle to pushdown systems. We represent (possibly in nite) sets of con gurations of such systems by means of nite-state automata. In order to re...
SPAA
1990
ACM
15 years 1 months ago
1990
ACM
A wad-free implementation of a data object in shared memory is one that guarantees that any process can complete any operation in a finite number of steps, regardless of the execu...
PODC
2010
ACM
15 years 1 months ago
2010
ACM
We define two new classes of shared-memory objects: ratifiers, which detect agreement, and conciliators, which ensure agreement with some probability. We show that consensus can...