Sciweavers

4693 search results - page 28 / 939
» Verifying Hybrid Systems
Sort
View
JAR
2010
160views more  JAR 2010»
14 years 11 months ago
MetiTarski: An Automatic Theorem Prover for Real-Valued Special Functions
Many theorems involving special functions such as ln, exp and sin can be proved automatically by MetiTarski: a resolution theorem prover modified to call a decision procedure for ...
Behzad Akbarpour, Lawrence C. Paulson
DATE
1999
IEEE
134views Hardware» more  DATE 1999»
15 years 4 months ago
Verifying Imprecisely Working Arithmetic Circuits
If real number calculations are implemented as circuits, only a limited preciseness can be obtained. Hence, formal verification can not be used to prove the equivalence between th...
Michaela Huhn, Klaus Schneider, Thomas Kropf, Geor...
89
Voted
HYBRID
2004
Springer
15 years 5 months ago
On O-Minimal Hybrid Systems
This paper is driven by a general motto: bisimulate a hybrid system by a finite symbolic dynamical system. In the case of o-minimal hybrid systems, the continuous and discrete com...
Thomas Brihaye, Christian Michaux, Cédric R...
HYBRID
1999
Springer
15 years 4 months ago
A New Class of Decidable Hybrid Systems
Abstract. One of the most important analysis problems of hybrid systems is the reachability problem. State of the art computational tools perform reachability computation for timed...
Gerardo Lafferriere, George J. Pappas, Sergio Yovi...
HYBRID
2010
Springer
15 years 2 months ago
Monte-carlo techniques for falsification of temporal properties of non-linear hybrid systems
Truong Nghiem, Sriram Sankaranarayanan, Georgios E...