Sciweavers

20 search results - page 2 / 4
» Generating Polynomial Invariants for Hybrid Systems
Sort
View
VMCAI
2009
Springer
14 years 10 days ago
Synthesizing Switching Logic Using Constraint Solving
A new approach based on constraint solving techniques was recently proposed for verification of hybrid systems. This approach works by searching for inductive invariants of a give...
Ankur Taly, Sumit Gulwani, Ashish Tiwari
SAS
2005
Springer
132views Formal Methods» more  SAS 2005»
13 years 11 months ago
Generation of Basic Semi-algebraic Invariants Using Convex Polyhedra
A technique for generating invariant polynomial inequalities of bounded degree is presented using the abstract interpretation framework. It is based on overapproximating basic semi...
Roberto Bagnara, Enric Rodríguez-Carbonell,...
BIRTHDAY
2007
Springer
13 years 11 months ago
Generating Polynomial Invariants with DISCOVERER and QEPCAD
Abstract. This paper investigates how to apply the techniques on solving semi-algebraic systems to invariant generation of polynomial programs. By our approach, the generated invar...
Yinghua Chen, Bican Xia, Lu Yang, Naijun Zhan
HYBRID
2009
Springer
14 years 10 days ago
Periodically Controlled Hybrid Systems
Abstract. This paper introduces Periodically Controlled Hybrid Automata (PCHA) for describing a class of hybrid control systems. In a PCHA, control actions occur roughly periodical...
Tichakorn Wongpiromsarn, Sayan Mitra, Richard M. M...
HYBRID
2009
Springer
13 years 9 months ago
Trajectory Based Verification Using Local Finite-Time Invariance
Abstract. In this paper we propose a trajectory based reachability analysis by using local finite-time invariance property. Trajectory based analysis are based on the execution tra...
A. Agung Julius, George J. Pappas