Sciweavers

2062 search results - page 161 / 413
» Derivatives of Logical Formulas
Sort
View
HYBRID
2003
Springer
15 years 9 months ago
Model Checking LTL over Controllable Linear Systems Is Decidable
Abstract. The use of algorithmic verification and synthesis tools for hybrid systems is currently limited to systems exhibiting simple continuous dynamics such as timed automata o...
Paulo Tabuada, George J. Pappas
PODS
1999
ACM
89views Database» more  PODS 1999»
15 years 8 months ago
Type Inference in the Polymorphic Relational Algebra
We give a polymorphic account of the relational algebra. We introduce a formalism of \type formulas" speci cally tuned for relational algebra expressions, and present an algo...
Jan Van den Bussche, Emmanuel Waller
ASPDAC
2007
ACM
158views Hardware» more  ASPDAC 2007»
15 years 8 months ago
Symbolic Model Checking of Analog/Mixed-Signal Circuits
This paper presents a Boolean based symbolic model checking algorithm for the verification of analog/mixedsignal (AMS) circuits. The systems are modeled in VHDL-AMS, a hardware des...
David Walter, Scott Little, Nicholas Seegmiller, C...
ECAI
2006
Springer
15 years 8 months ago
Compiling Possibilistic Knowledge Bases
Abstract. Possibilistic knowledge bases gather propositional formulas associated with degrees belonging to a linearly ordered scale. These degrees reflect certainty or priority, de...
Salem Benferhat, Henri Prade
DAGSTUHL
2007
15 years 5 months ago
Propositional Relevance through Letter-Sharing: Review and Contribution
The concept of relevance between classical propositional formulae, defined in terms of letter-sharing, has been around for a very long time. But it began to take on a fresh life i...
David Makinson