100 search results - page 14 / 20 » Foundations of Attack-Defense Trees |
QEST
2008
IEEE
14 years 1 months ago
2008
IEEE
We present Hintikka games for formulae of the probabilistic temporal logic PCTL and countable labeled Markov chains as models, giving an operational account of the denotational se...
ICDE
2006
IEEE
14 years 1 months ago
2006
IEEE
It is important to process the updates when nodes are inserted into or deleted from the XML tree. All the existing labeling schemes have high update cost, thus in this paper we pr...
SASN
2003
ACM
14 years 17 days ago
2003
ACM
In this paper we present SECTOR, a set of mechanisms for the secure verification of the time of encounters between nodes in multi-hop wireless networks. This information can be u...
ISRR
2001
Springer
13 years 11 months ago
2001
Springer
This paper describes the foundations and algorithms of a new probabilistic roadmap (PRM) planner that is: (1) singlequery –i.e., it does not pre-compute a roadmap, but uses the ...
INFOCOM
1999
IEEE
13 years 11 months ago
1999
IEEE
There is an increasing need for Internet hosts to be able to quickly and efficiently learn the distance, in terms of metrics such as latency or bandwidth, between Internet hosts. ...