Sciweavers

40 search results - page 3 / 8
» Concurrent Games and Full Completeness
Sort
View
CORR
2010
Springer
93views Education» more  CORR 2010»
13 years 5 months ago
Randomness for Free
We consider two-player zero-sum games on graphs. These games can be classified on the basis of the information of the players and on the mode of interaction between them. On the ba...
Krishnendu Chatterjee, Laurent Doyen, Hugo Gimbert...
JANCL
2007
107views more  JANCL 2007»
13 years 5 months ago
Distributed knowledge
ABSTRACT. This paper provides a complete characterization of epistemic models in which distributed knowledge complies with the principle of full communication [HOE 99, GER 99]. It ...
Floris Roelofsen
AMAI
2004
Springer
13 years 5 months ago
Representing von Neumann-Morgenstern Games in the Situation Calculus
Sequential von Neumann-Morgernstern (VM) games are a very general formalism for representing multi-agent interactions and planning problems in a variety of types of environments. ...
Oliver Schulte, James P. Delgrande
LICS
2009
IEEE
13 years 11 months ago
Ludics with Repetitions (Exponentials, Interactive Types and Completeness)
Abstract. Ludics is peculiar in the panorama of game semantics: we first have the definition of interaction-composition and then we have semantical types, as a set of strategies ...
Michele Basaldella, Claudia Faggian
FSTTCS
1998
Springer
13 years 9 months ago
Partial Order Reductions for Bisimulation Checking
Partial order methods have been introduced to avoid the state explosion problem in veri cation resulting from the representation of multiple interleavings of concurrent transitions...
Michaela Huhn, Peter Niebert, Heike Wehrheim