Sciweavers

447 search results - page 11 / 90
» Bounded Model Checking with Parametric Data Structures
Sort
View
HYBRID
2010
Springer
13 years 9 months ago
Identifiability of discrete-time linear switched systems
In this paper we study the identifiability of linear switched systems (LSSs ) in discrete-time. The question of identifiability is central to system identification, as it sets the...
Mihály Petreczky, Laurent Bako, Jan H. van ...
DATE
2004
IEEE
128views Hardware» more  DATE 2004»
13 years 11 months ago
Enhanced Diameter Bounding via Structural
Bounded model checking (BMC) has gained widespread industrial use due to its relative scalability. Its exhaustiveness over all valid input vectors allows it to expose arbitrarily ...
Jason Baumgartner, Andreas Kuehlmann
ECCV
2004
Springer
14 years 9 months ago
A Robust Probabilistic Estimation Framework for Parametric Image Models
Models of spatial variation in images are central to a large number of low-level computer vision problems including segmentation, registration, and 3D structure detection. Often, i...
Maneesh Kumar Singh, Himanshu Arora, Narendra Ahuj...
ICPPW
2006
IEEE
14 years 1 months ago
Model Checking Control Communication of a FACTS Device
This paper concerns the design and verification of a realtime communication protocol for sensor data collection and processing between an embedded computer and a DSP. In such sys...
David A. Cape, Bruce M. McMillin, James K. Townsen...
LMCS
2007
132views more  LMCS 2007»
13 years 7 months ago
The Complexity of Model Checking Higher-Order Fixpoint Logic
Higher-Order Fixpoint Logic (HFL) is a hybrid of the simply typed λ-calculus and the modal µ-calculus. This makes it a highly expressive temporal logic that is capable of express...
Roland Axelsson, Martin Lange, Rafal Somla