Sciweavers

96 search results - page 8 / 20
» Reasoning About Systems with Transition Fairness
Sort
View
LICS
1999
IEEE
13 years 11 months ago
Proof Techniques for Cryptographic Processes
Contextual equivalences for cryptographic process calculi, like the spi-calculus, can be used to reason about correctness of protocols, but their definition suffers from quantific...
Michele Boreale, Rocco De Nicola, Rosario Pugliese
KI
1997
Springer
13 years 11 months ago
Agents in Proactive Environments
Abstract. Agents situated in proactive environments are acting autonomously while the environment is evolving alongside, whether or not the agents carry out any particular actions....
Dov M. Gabbay, Rolf Nossum, Michael Thielscher
JAIR
2008
130views more  JAIR 2008»
13 years 7 months ago
Axiomatic Foundations for Ranking Systems
Reasoning about agent preferences on a set of alternatives, and the aggregation of such preferences into some social ranking is a fundamental issue in reasoning about multi-agent ...
Alon Altman, Moshe Tennenholtz
ASIAN
2003
Springer
170views Algorithms» more  ASIAN 2003»
14 years 22 days ago
Model Checking Probabilistic Distributed Systems
Protocols for distributed systems make often use of random transitions to achieve a common goal. A popular example are randomized leader election protocols. We introduce probabilis...
Benedikt Bollig, Martin Leucker
PET
2009
Springer
14 years 2 months ago
APOD: Anonymous Physical Object Delivery
Delivery of products bought online can violate consumers’ privacy, although not in a straightforward way. In particular, delivery companies that have contracted with a website kn...
Elli Androulaki, Steven M. Bellovin