Results 1 
4 of
4
Verification of hybrid systems: Formalization and proof rules in PVS
 in PVS. In: ICECCS, IEEE Computer Society
, 2001
"... Combining discrete statemachines with continuous behavior, hybrid systems are a wellestablished mathematical model for discrete systems acting in a continuous environment. As a priori infinite state systems, their computational properties are undecidable in the general model and the main line of r ..."
Abstract

Cited by 17 (1 self)
 Add to MetaCart
(Show Context)
Combining discrete statemachines with continuous behavior, hybrid systems are a wellestablished mathematical model for discrete systems acting in a continuous environment. As a priori infinite state systems, their computational properties are undecidable in the general model and the main line of research concentrates on model checking of finite abstractions of restricted subclasses of the general model. In our work, we use deductive methods, falling back upon the generalpurpose theorem prover PVS. To do so we extend the classical approach for the verification of statebased programs by developing an inductive proof method to deal with the parallel composition of hybrid systems. It covers shared variable communication, labelsynchronization, and especially the common continuous activities in the parallel composition of hybrid automata. Besides hybrid systems and their parallel composition, we formalized their operational step semantics and a number of proofrules within PVS, for one of which we give also a rigorous completeness proof. Moreover, the theory is applied to the verification of a number of examples.
Verification of Hybrid Controlled Processing Systems Based on Decomposition and Deduction
, 2001
"... While formal verification has been successfully used to analyze several academic examples of controlled hybrid systems, the application to realworld processing systems is largely restricted by the complexity of modeling and computation. This contribution aims at improving the applicability by using ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
While formal verification has been successfully used to analyze several academic examples of controlled hybrid systems, the application to realworld processing systems is largely restricted by the complexity of modeling and computation. This contribution aims at improving the applicability by using decomposition and deduction techniques: A given system is first decomposed into a set of physical and/or functional units and modeled by communicating timed automata or linear hybrid automata. The socalled Assumption/Commitment method allows to formulate requirements for the desired behavior of single modules or groups of modules.
Assertionbased analysis of hybrid systems with PVS
 In Proc. of EuroCAST'2001, LNCS
, 2001
"... Abstract. Hybrid systems are a wellestablished mathematical model for embedded systems. Such systems, which combine discrete and continuous behavior, are increasingly used in safetycritical applications. To guarantee safe functioning, formal verification techniques are crucial. While research in t ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
(Show Context)
Abstract. Hybrid systems are a wellestablished mathematical model for embedded systems. Such systems, which combine discrete and continuous behavior, are increasingly used in safetycritical applications. To guarantee safe functioning, formal verification techniques are crucial. While research in this area concentrates on model checking, deductive techniques attracted less attention. In this paper we use the general purpose theorem prover PVS for the rigorous formalization and analysis of hybrid systems. To allow for machineassisted proofs, we implement a deductive assertional proof method within PVS. The sound and complete proof system allows modular proofs in that it comprises a proof rule for the parallel composition. Besides hybrid systems and the proof system, a number of examples are formalized within PVS.