4 search results - page 1 / 1 » Monotonic and Downward Closed Games |
LOGCOM
2008
13 years 5 months ago
2008
In an earlier work [Abdulla et al. (2000, Information and Computation, 160, 109
TACAS
2009
Springer
13 years 11 months ago
2009
Springer
CEDAR (Counter Example Driven Antichain Refinement) is a new symbolic algorithm for computing weakest strategies for safety games of imperfect information. The algorithm computes ...
ENTCS
2002
13 years 4 months ago
2002
In this paper, we revisit the forward and backward approaches to the verification of extensions of infinite state Petri Nets. As contributions, we propose an efficient data struct...
ATAL
2006
Springer
13 years 8 months ago
2006
Springer
Abstract. We introduce take-it-or-leave-it auctions (TLAs) as an allocation mechanism that allows buyers to retain much of their private valuation information, yet generates close-...