Sciweavers

777 search results - page 130 / 156
» Model Checking with Formula-Dependent Abstract Models
Sort
View
ESOP
2008
Springer
14 years 11 months ago
Cover Algorithms and Their Combination
This paper defines the cover of a formula with respect to a set of variables V in theory T to be the strongest quantifier-free formula that is implied by V : in theory T. Cover e...
Sumit Gulwani, Madan Musuvathi
WISES
2003
14 years 11 months ago
Automatic Recovery of the TTP/A Sensor/Actuator Network
Abstract — Since sensor/actuator networks are to be used in error-prone environments, it is required that media access protocols for such networks are tolerant to failures. Field...
Wilfried Steiner, Wilfried Elmenreich
PUK
2000
14 years 11 months ago
Heuristic Search Planning with BDDs
Abstract. In this paper we study traditional and enhanced BDDbased exploration procedures capable of handling large planning problems. On the one hand, reachability analysis and mo...
Stefan Edelkamp
GISCIENCE
2008
Springer
115views GIS» more  GISCIENCE 2008»
14 years 11 months ago
Validation and Storage of Polyhedra through Constrained Delaunay Tetrahedralization
Abstract. Closed, watertight, 3D geometries are represented by polyhedra. Current data models define these polyhedra basically as a set of polygons, leaving the test on intersectin...
Edward Verbree, Hang Si
EPEW
2010
Springer
14 years 10 months ago
Accurate Performance Estimation for Stochastic Marked Graphs by Bottleneck Regrowing
Abstract. The adequate system performance is usually a critical requirement to be checked during the verification phase of a system. Thus, accurately measuring the performance of c...
Ricardo J. Rodríguez, Jorge Júlvez