Sciweavers

4047 search results - page 668 / 810
» Algebraic Model Checking
Sort
View
DALT
2005
Springer
15 years 10 months ago
Complete Axiomatizations of Finite Syntactic Epistemic States
An agent who bases his actions upon explicit logical formulae has at any given point in time a finite set of formulae he has computed. Closure or consistency conditions on this se...
Thomas Ågotnes, Michal Walicki
FOSSACS
2005
Springer
15 years 10 months ago
Composition and Decomposition in True-Concurrency
The idea of composition and decomposition to obtain computability results is particularly relevant for true-concurrency. In contrast to the interleaving world, where composition an...
Sibylle B. Fröschle
WIDM
2004
ACM
15 years 10 months ago
Measuring similarity between collection of values
In this paper, we propose a set of similarity metrics for manipulating collections of values occuring in XML documents. Following the data model presented in TAX algebra, we treat...
Carina F. Dorneles, Carlos A. Heuser, Andrei E. N....
SCN
2004
Springer
102views Communications» more  SCN 2004»
15 years 10 months ago
On the Size of Monotone Span Programs
Abstract. Span programs provide a linear algebraic model of computation. Monotone span programs (MSP) correspond to linear secret sharing schemes. This paper studies the properties...
Ventzislav Nikov, Svetla Nikova, Bart Preneel
ATS
2003
IEEE
75views Hardware» more  ATS 2003»
15 years 10 months ago
An Enhanced Test Generator for Capacitance Induced Crosstalk Delay Faults
Capacitive crosstalk can give rise to slowdown of signals that can propagate to a circuit output and create a functional error. A test generation methodology, called XGEN, was dev...
Arani Sinha, Sandeep K. Gupta, Melvin A. Breuer