Assertion-based analysis of hybrid systems with PVS

DMCA

Assertion-based analysis of hybrid systems with PVS (2001)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Erika Ábrahám-mumm , Ulrich Hannemann , Martin Steffen

Venue:	In Proc. of EuroCAST'2001, LNCS
Citations:	1 - 0 self

BibTeX

@INPROCEEDINGS{Ábrahám-mumm01assertion-basedanalysis,
    author = {Erika Ábrahám-mumm and Ulrich Hannemann and Martin Steffen},
    title = {Assertion-based analysis of hybrid systems with PVS},
    booktitle = {In Proc. of EuroCAST'2001, LNCS},
    year = {2001},
    publisher = {Springer-Verlag}
}

OpenURL

Abstract

Abstract. Hybrid systems are a well-established mathematical model for embedded systems. Such systems, which combine discrete and continuous behavior, are increasingly used in safety-critical 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 machine-assisted 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.

Keyphrases

hybrid system assertion-based analysis continuous behavior well-established mathematical model deductive assertional proof method general purpose theorem prover pvs machine-assisted proof safe functioning rigorous formalization parallel composition complete proof system model checking deductive technique formal verification technique safety-critical application embedded system proof system modular proof proof rule

DMCA