Verifying average dwell time of hybrid systems
ACM Transactions on Embedded Computing Systems (TECS)
A Formalized Theory for Verifying Stability and Convergence of Automata in PVS
TPHOLs '08 Proceedings of the 21st International Conference on Theorem Proving in Higher Order Logics
Periodically Controlled Hybrid Systems
HSCC '09 Proceedings of the 12th International Conference on Hybrid Systems: Computation and Control
Modeling and verification of stochastic hybrid systems using HIOA: a case study on DNA replication
Proceedings of the 13th ACM international conference on Hybrid systems: computation and control
Decomposing broadcast algorithms using abstract MAC layers
Proceedings of the 6th International Workshop on Foundations of Mobile Computing
MAC design for analog network coding
FOMC '11 Proceedings of the 7th ACM ACM SIGACT/SIGMOBILE International Workshop on Foundations of Mobile Computing
Towards a verification framework for faulty message passing systems in PVS
Innovations in Systems and Software Engineering
Lyapunov abstractions for inevitability of hybrid systems
Proceedings of the 15th ACM international conference on Hybrid Systems: Computation and Control
Computing bounded reach sets from sampled simulation traces
Proceedings of the 15th ACM international conference on Hybrid Systems: Computation and Control
Verification of Periodically Controlled Hybrid Systems: Application to an Autonomous Vehicle
ACM Transactions on Embedded Computing Systems (TECS) - Special Section on CAPA'09, Special Section on WHS'09, and Special Section VCPSS' 09
Decomposing broadcast algorithms using abstract MAC layers
Ad Hoc Networks
Hi-index | 0.00 |
Combining discrete state transitions with differential equations, Hybrid system models provide an expressive formalism for describing software systems that interact with a physical environment. Automatically checking properties, such as invariance and stability, is extremely hard for general hybrid models, and therefore current research focuses on models with restricted expressive power. In this thesis we take a complementary approach by developing proof techniques that are not necessarily automatic, but are applicable to a general class of hybrid systems. Three components of this thesis, namely, (i) semantics for ordinary and probabilistic hybrid models, (ii) methods for proving invariance, stability, and abstraction, and (iii) software tools supporting (i) and (ii), are integrated within a common mathematical framework. (i) For specifying nonprobabilistic hybrid models, we present Structured Hybrid I/O Automata (SHIOAs) which adds control theory-inspired structures, namely state models, to the existing Hybrid I/O Automata, thereby facilitating description of continuous behavior. We introduce a generalization of SHIOAs which allows both nondeterministic and stochastic transitions and develop the trace-based semantics for this framework. (ii) We present two techniques for establishing lower-bounds on average dwell time (ADT) for SHIOA models. This provides a sufficient condition of establishing stability for SHIOAs with stable state models. A new simulation-based technique which is sound for proving ADT-equivalence of SHIOAs is proposed. We develop notions of approximate implementation and corresponding proof techniques for Probabilistic I/O Automata. Specifically, a PIOA A is an ε-approximate implementation of B , if every trace distribution of A is ε-close to some trace distribution of B —closeness being measured by a metric on the space of trace distributions. We present a new class of real-valued simulation fund ions for proving ε-approximate implementations, and demonstrate their utility in quantitatively reasoning about, probabilistic safety and termination. (iii) We introduce a specification language for SHIOAs and a theorem prover interface for this language. The latter consists of a translator to typed high order logic and a set of PVS-strategies that partially automate the above verification techniques within the INS theorem prover. (Copies available exclusively from MIT Libraries, Rm. 14-0551, Cambridge, MA 02139-4307. Ph. 617-253-5668; Fax 617-253-1690.)