Sciweavers

182 search results - page 17 / 37
» Infinite Possibilities
Sort
View
JAIR
2008
92views more  JAIR 2008»
13 years 7 months ago
On the Expressiveness of Levesque's Normal Form
Levesque proposed a generalization of a database called a proper knowledge base (KB), which is equivalent to a possibly infinite consistent set of ground literals. In contrast to ...
Yongmei Liu, Gerhard Lakemeyer
JALC
2006
61views more  JALC 2006»
13 years 7 months ago
Random Polynomial-Time Attacks and Dolev-Yao Models
In this paper we present an extension of Dolev-Yao models for security protocols with a notion of random polynomial-time (Las Vegas) computability. First we notice that Dolev-Yao ...
Mathieu Baudet
CONCUR
2010
Springer
13 years 8 months ago
Obliging Games
Abstract. Graph games of infinite length provide a natural model for open reactive systems: one player (Eve) represents the controller and the other player (Adam) represents the en...
Krishnendu Chatterjee, Florian Horn, Christof L&ou...
ORL
2010
167views more  ORL 2010»
13 years 2 months ago
An embedded Markov chain approach to stock rationing
Rationing is an inventory policy that allows prioritization of demand classes. It enables the inventory system to provide higher service levels for critical demand classes. In thi...
Mehmet Murat Fadiloglu, Önder Bulut
ESORICS
2002
Springer
14 years 7 months ago
Analysing a Stream Authentication Protocol Using Model Checking
Abstract. In this paper, we consider how one can analyse a stream authentication protocol using model checking techniques. In particular, we will be focusing on the Timed Efficient...
Philippa J. Broadfoot, Gavin Lowe