Sciweavers

279 search results - page 15 / 56
» Timed Concurrent Game Structures
Sort
View
SPDP
1993
IEEE
13 years 11 months ago
How to Share an Object: A Fast Timing-Based Solution
We consider the problem of transforming a given sequential implementation of a data structure into a wait-free concurrent implementation. Given the code for different operations ...
Rajeev Alur, Gadi Taubenfeld
ATAL
2007
Springer
14 years 1 months ago
Reinforcement learning in extensive form games with incomplete information: the bargaining case study
We consider the problem of finding optimal strategies in infinite extensive form games with incomplete information that are repeatedly played. This problem is still open in lite...
Alessandro Lazaric, Jose Enrique Munoz de Cote, Ni...
ATVA
2007
Springer
87views Hardware» more  ATVA 2007»
14 years 1 months ago
Latticed Simulation Relations and Games
Multi-valued Kripke structures are Kripke structures in which the atomic propositions and the transitions are not Boolean and can take values from some set. In particular, latticed...
Orna Kupferman, Yoad Lustig
DAC
1999
ACM
14 years 8 months ago
Synthesis of Embedded Software Using Free-Choice Petri Nets
Software synthesis from a concurrent functional specification is a key problem in the design of embedded systems. A concurrent specification is well-suited for medium-grained part...
Marco Sgroi, Luciano Lavagno
PPOPP
2012
ACM
12 years 3 months ago
A methodology for creating fast wait-free data structures
Lock-freedom is a progress guarantee that ensures overall program progress. Wait-freedom is a stronger progress guarantee that ensures the progress of each thread in the program. ...
Alex Kogan, Erez Petrank