Distributed lyapunov functions in analysis of graph models of software
Author(s)
Roozbehani, Mardavij; Megretski, Alexandre; Frazzoli, Emilio; Feron, Eric
DownloadRoozbehani-2008-Distributed Lyapunov Functions.pdf (319.1Kb)
MIT_AMENDMENT
MIT Amendment
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.
Terms of use
Metadata
Show full item recordAbstract
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.
Date issued
2008-07Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science; Massachusetts Institute of Technology. Laboratory for Information and Decision SystemsJournal
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
ISBN
978-3-540-78928-4