793 search results - page 108 / 159 » Argumentation and standards of proof |
CALCO
2009
Springer
14 years 5 months ago
2009
Springer
Abstract. Coalgebra automata, introduced by the second author, generalize the well-known automata that operate on infinite words/streams, trees, graphs or transition systems. This...
TARK
2009
Springer
14 years 5 months ago
2009
Springer
Brandenburger, Friedenberg, and Keisler provide an epistemic characterization of iterated admissibility (i.e., iterated deletion of weakly dominated strategies) where uncertainty ...
AINA
2007
IEEE
14 years 5 months ago
2007
IEEE
The random oracle model is an idealized theoretical model that has been successfully used for designing many cryptographic algorithms and protocols. Unfortunately, a series of res...
SEFM
2007
IEEE
14 years 5 months ago
2007
IEEE
We model security protocols as a game tree using concepts of game semantics. Using this model we ascribe semantics to protocols written in the standard simple arrow notation. Acco...
DSOM
2007
Springer
14 years 5 months ago
2007
Springer
Abstract. Experiences with the management of Grid specific monitoring and accounting data have shown that current approaches do not sufficiently support a distinction between prov...