186 search results - page 4 / 38 » The x-Wait-Freedom Progress Condition |
CAV
2007
Springer
13 years 11 months ago
2007
Springer
Three-color parity games capture the disjunction of a B¨uchi and a co-B¨uchi condition. The most efficient known algorithm for these games is the progress measures algorithm by ...
HYBRID
1997
Springer
13 years 9 months ago
1997
Springer
Abstract. Time progress conditions in hybrid systems are usually speci ed in terms of invariants, predicates characterizing states where time can continuously progress or dually, d...
CORR
2010
Springer
13 years 3 months ago
2010
Springer
Finding approximate Nash equilibria in n × n bimatrix games is currently one of the main open problems in algorithmic game theory. Motivated in part by the lack of progress on wo...
IPPS
2010
IEEE
13 years 3 months ago
2010
IEEE
In this work we consider the problem of monitoring information streams for anomalies in a scalable and efficient manner. We study the problem in the context of network streams wher...
IFM
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. We present a fixpoint semantics of event systems. The semantics is presented in a general framework without concerns of fairness. Soundness and completeness of rules for...