219 search results - page 12 / 44 » Time and Space Lower Bounds for Implementations Using k-CAS |
PODC
2011
ACM
12 years 11 months ago
2011
ACM
We study the time-complexity of robust atomic read/write storage from fault-prone storage components in asynchronous message-passing systems. Robustness here means wait-free tolera...
ECRTS
2005
IEEE
14 years 2 months ago
2005
IEEE
We present a wait-free protocol for the single-writer, multiple-reader problem in small-memory, embedded real-time systems. We analytically establish that our protocol requires le...
ENTCS
2006
13 years 8 months ago
2006
In this paper, we address the issue of the formal verification of real-time systems in the context of a preemptive scheduling policy. We propose an algorithm which computes the st...
FORMATS
2009
Springer
14 years 14 days ago
2009
Springer
Probabilistic timed automata (PTAs) are used for formal modelling and verification of systems with probabilistic, nondeterministic and real-time behaviour. For non-probabilistic ti...
DC
2008
13 years 8 months ago
2008
This paper introduces solo-valency, a variation on the valency proof technique originated by Fischer, Lynch, and Paterson. The new technique focuses on critical events that influe...