Departmental Papers (CIS)

Document Type

Book Chapter

Date of this Version

September 2006

Comments

Postprint version. Published in Lecture Notes in Computer Science, Volume 4202, Formal Modeling and Analysis of Timed Systems, 2006, pages 171-186.
Publisher URL: http://dx.doi.org/10.1007/11867340

Abstract

In this paper, we consider a novel approach to the temporal logic verification problem of continuous dynamical systems. Our methodology has the distinctive feature that enables the verification of the temporal properties of a continuous system by verifying only a finite number of its (simulated) trajectories. The proposed framework comprises two main ideas. First, we take advantage of the fact that in metric spaces we can quantify how close are two different states. Based on that, we define robust, multi-valued semantics for MTL (and LTL) formulas. These capture not only the usual Boolean satisfiability of the formula, but also topological information regarding the distance from unsatisfiability. Second, we use the recently developed notion of bisimulation functions to infer the behavior of a set of trajectories that lie in the neighborhood of the simulated one. If the latter set of trajectories is bounded by the tube of robustness, then we can infer that all the trajectories in the neighborhood of the simulated one satisfy the same temporal specification as the simulated trajectory. The interesting and promising feature of our approach is that the more robust the system is with respect to the temporal logic specification, the less is the number of simulations that are required in order to verify the system.

Share

COinS
 

Date Posted: 11 December 2006

This document has been peer reviewed.