Distributed lyapunov functions in analysis of graph models of software
Name
Roozbehani-2008-Distributed Lyapunov Functions.pdf
Size
319.11 KB
Format
Adobe PDF
Checksum (MD5)
5386d45b2c98546634cd3e5d991d3351
Author(s)
Roozbehani, Mardavij
Megretski, Alexandre
Frazzoli, Emilio
Feron, Eric
Date Issued
July 2008
Journal
Hybrid Systems: Computation and Control
Publisher
Spring Berlin/Heidelberg
Citation
Roozbehani, Mardavij et al. “Distributed Lyapunov Functions in Analysis of Graph Models of Software.” Hybrid Systems: Computation and Control. Ed. Magnus Egerstedt & Bud Mishra. Berlin, Heidelberg: Springer Berlin Heidelberg, 2008. 443-456. © 2008 Springer
Version
Final published version
Abstract
In previous works, the authors introduced a framework for software analysis, which is based on optimization of Lyapunov invariants. These invariants prove critical software properties such as absence of overflow and termination in finite time. In this paper, graph models of software are introduced and the software analysis framework is further developed and extended on graph models. A distributed Lyapunov function is assigned to the software by assigning a Lyapunov function to every node on its graph model. The global decremental condition is then enforced by requiring that the Lyapunov functions on each node decrease as transitions take place along the arcs. The concept of graph reduction and optimality of graphs for Lyapunov analysis is briefly discussed.
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Massachusetts Institute of Technology. Laboratory for Information and Decision Systems
Terms of Use
Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1007/978-3-540-78929-1_32
