Home Approaches to the Formal Verification of Hybrid Systems
Article
Licensed
Unlicensed Requires Authentication

Approaches to the Formal Verification of Hybrid Systems

  • St. Kowalewski , P. Herrmann , Sebastian Engell , R. Huuck , H. Krumm , Y. Lakhnech , B. Lukoschus and H. Treseler
Published/Copyright: September 25, 2009
at - Automatisierungstechnik
From the journal Volume 49 Issue 2

This paper presents two different approaches to the problem of formally verifying the correctness of control systems which consist of a logic controller and a continuous plant and, thus, constitute a hybrid system. One approach aims at algorithmic verification and combines Condition/Event Systems with Timed Automata. The first framework is used to model the controller and the plant in a block-diagram representation, which is then translated into the latter model for analysis by available tools. A second approach is presented which is based on deductive verification. It allows for a structured analysis of compositional specifications formulated in a temporal logic called cTLA. This logic is a compositional style of the Temporal Logic of Actions established in Computer Science by Lamport. Both approaches are introduced using a common example and the results of their application are discussed. As an outlook, a possible strategy for integrating algorithmic and deductive verification of hybrid systems is sketched at the end of the paper.

Published Online: 2009-09-25
Published in Print: 2001-02
Downloaded on 8.9.2025 from https://www.degruyterbrill.com/document/doi/10.1524/auto.2001.49.2.66/html
Scroll to top button