Sciweavers

18 search results - page 3 / 4
» Feasible Proofs of Matrix Properties with Csanky's Algorithm
Sort
View
APSEC
2009
IEEE
13 years 4 months ago
A Formal Framework to Integrate Timed Security Rules within a TEFSM-Based System Specification
Abstract--Formal methods are very useful in software industry and are becoming of paramount importance in practical engineering techniques. They involve the design and the modeling...
Wissam Mallouli, Amel Mammar, Ana R. Cavalli
HYBRID
2004
Springer
14 years 2 days ago
Incremental Search Methods for Reachability Analysis of Continuous and Hybrid Systems
Abstract. In this paper we present algorithms and tools for fast and efficient reachability analysis, applicable to continuous and hybrid systems. Most of the work on reachability ...
Amit Bhatia, Emilio Frazzoli
AUTOMATICA
2008
167views more  AUTOMATICA 2008»
13 years 6 months ago
Stability and robustness analysis of nonlinear systems via contraction metrics and SOS programming
A wide variety of stability and performance questions about linear dynamical systems can be reformulated as convex optimization problems involving linear matrix inequalities (LMIs...
Erin M. Aylward, Pablo A. Parrilo, Jean-Jacques E....
DKE
2007
130views more  DKE 2007»
13 years 6 months ago
Enabling access-privacy for random walk based data analysis applications
Random walk graph and Markov chain based models are used heavily in many data and system analysis domains, including web, bioinformatics, and queuing. These models enable the desc...
Ping Lin, K. Selçuk Candan
AAAI
1993
13 years 8 months ago
On the Adequateness of the Connection Method
Roughly speaking, adequatness is the property of a theorem proving method to solve simpler problems faster than more difficult ones. Automated inferencing methods are often not ad...
Antje Beringer, Steffen Hölldobler