95 search results - page 10 / 19 » On Notions of Completeness Weaker than Kripke Completeness |
TKDE
2010
13 years 8 months ago
2010
— Tampering of a database can be detected through the use of cryptographically-strong hash functions. Subsequently-applied forensic analysis algorithms can help determine when, w...
CONCUR
2009
Springer
14 years 4 months ago
2009
Springer
We present a new algorithm for computing the winning region of a parity game played over the configuration graph of a pushdown system. Our method gives the first extension of the...
CIE
2005
Springer
14 years 3 months ago
2005
Springer
We argue that there is currently no satisfactory general framework for comparing the extensional computational power of arbitrary computational models operating over arbitrary doma...
AAAI
1992
13 years 11 months ago
1992
We propose a representation of concurrent actions; rather than invent a new formalism, we model them within the standard situation calculus by introducing the notions of global ac...
ENTCS
2007
13 years 10 months ago
2007
We develop a general testing scenario for probabilistic processes, giving rise to two theories: probabilistic may testing and probabilistic must testing. These are applied to a si...