503 search results - page 28 / 101 » Verifying Quantitative Properties Using Bound Functions |
TOOLS
1999
IEEE
15 years 2 months ago
1999
IEEE
In this paper we enhance the SOFA Component Description Language with a semantic description of a component's functionality. There are two key requirements this description a...
HYBRID
2007
Springer
15 years 1 months ago
2007
Springer
Abstract. In this paper, we propose a new approach for formal verification of hybrid systems. To do so, we present a new refinement proof technique, a weak refinement using step in...
114
click to vote
CAV
2007
Springer
15 years 1 months ago
2007
Springer
Abstract. In this paper, we describe the features of the Timed Abstract State Machine toolset. The toolset implements the features of the Timed Abstract State Machine (TASM) langua...
NIPS
2001
14 years 11 months ago
2001
We give results about the learnability and required complexity of logical formulae to solve classification problems. These results are obtained by linking propositional logic with...
COCO
2001
Springer
15 years 2 months ago
2001
Springer
The quantum version of communication complexity allows the two communicating parties to exchange qubits and/or to make use of prior entanglement (shared EPRpairs). Some lower boun...