2436 search results - page 52 / 488 » Comonadic Notions of Computation |
CONCUR
2009
Springer
14 years 4 months ago
2009
Springer
In this paper, we extend the classical notion of strategies in turn-based finite games by allowing several moves to be selected. We define and study a quantitative measure for pe...
QEST
2008
IEEE
14 years 4 months ago
2008
IEEE
We tackle the problem of non robustness of simulation and bisimulation when dealing with probabilistic processes. It is important to ignore tiny deviations in probabilities becaus...
STORAGESS
2005
ACM
14 years 3 months ago
2005
ACM
We study cryptographic modeling and encryption-based design techniques for guaranteeing privacy of data that is first stored in some type of computer memory and then deleted. We ...
ATVA
2006
Springer
14 years 1 months ago
2006
Springer
Testing is one of the fundamental techniques for verifying if a computing system conforms to its specification. We take a fresh look at the theory of testing for message-passing sy...
SIAMCOMP
2002
13 years 9 months ago
2002
This paper introduces a simple notion of layering as a tool for analyzing well-behaved runs of a given model of distributed computation. Using layering, a model-independent analysi...