Sciweavers

161 search results - page 12 / 33
» Combining Algorithms for Deciding Knowledge in Security Prot...
Sort
View
ECAI
2000
Springer
14 years 29 days ago
Achieving Coordination through Combining Joint Planning and Joint Learning
There are two major approaches to activity coordination in multiagent systems. First, by endowing the agents with the capability to jointly plan, that is, to jointly generate hypot...
Gerhard Weiss
TPHOL
2009
IEEE
14 years 3 months ago
Formalising Observer Theory for Environment-Sensitive Bisimulation
Abstract. We consider a formalisation of a notion of observer (or intruder) theories, commonly used in symbolic analysis of security protocols. An observer theory describes the kno...
Jeremy E. Dawson, Alwen Tiu
MOBICOM
2006
ACM
14 years 2 months ago
On delivery guarantees of face and combined greedy-face routing in ad hoc and sensor networks
It was recently reported that all known face and combined greedy-face routing variants cannot guarantee message delivery in arbitrary undirected planar graphs. The purpose of this...
Hannes Frey, Ivan Stojmenovic
STACS
2007
Springer
14 years 2 months ago
Associative-Commutative Deducibility Constraints
We consider deducibility constraints, which are equivalent to particular Diophantine systems, arising in the automatic verification of security protocols, in presence of associati...
Sergiu Bursuc, Hubert Comon-Lundh, Stéphani...
JAR
2007
129views more  JAR 2007»
13 years 8 months ago
A Tableau Algorithm for Description Logics with Concrete Domains and General TBoxes
To use description logics (DLs) in an application, it is crucial to identify a DL that is sufficiently expressive to represent the relevant notions of the application domain, but f...
Carsten Lutz, Maja Milicic