Sciweavers

167 search results - page 7 / 34
» Comparing Two Notions of Simulatability
Sort
View
LOGCOM
2010
143views more  LOGCOM 2010»
13 years 6 months ago
Vietoris Bisimulations
Building on the fact that descriptive frames are coalgebras for the Vietoris functor on the category of Stone spaces, we introduce and study the concept of a Vietoris bisimulation...
Nick Bezhanishvili, Gaëlle Fontaine, Yde Vene...
AAAI
2007
13 years 10 months ago
Prime Implicates and Prime Implicants in Modal Logic
The purpose of this paper is to extend the notions of prime implicates and prime implicants to the basic modal logic K. We consider a number of different potential definitions of...
Meghyn Bienvenu
ATVA
2006
Springer
83views Hardware» more  ATVA 2006»
13 years 11 months ago
A Fresh Look at Testing for Asynchronous Communication
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...
Puneet Bhateja, Paul Gastin, Madhavan Mukund
CANS
2010
Springer
150views Cryptology» more  CANS 2010»
13 years 5 months ago
Predicate Encryption with Partial Public Keys
Abstract. Predicate encryption is a new powerful cryptographic primitive which allows for fine-grained access control for encrypted data: the owner of the secret key can release pa...
Carlo Blundo, Vincenzo Iovino, Giuseppe Persiano
JSS
1998
87views more  JSS 1998»
13 years 7 months ago
On using similarity for concurrency control in real-time database systems
Most of the proposed concurrency control protocols for real-time database systems (RTDBS) are based on serializability theorem. Owing to the unique characteristics of real-time da...
Kam-yiu Lam, Wai-cheong Yau