Skip to main content

Dynamic Programming algorithm for Computing Temporal Logic Robustness

Abstract In this thesis we deal with the problem of temporal logic robustness estimation. We present a dynamic programming algorithm for the robust estimation problem of Metric Temporal Logic (MTL) formulas regarding a finite trace of time stated sequence. This algorithm not only tests if the MTL specification is satisfied by the given input which is a finite system trajectory, but also quantifies to what extend does the sequence satisfies or violates the MTL specification. The implementation of the algorithm is the DP-TALIRO toolbox for MATLAB. Currently it is used as the temporal logic robust computing engine of S-TALIRO which is a tool for MATLAB searching for trajectories of minimal robustness in Simulink/ Stateflow. DP-TALIRO is expected to hav... (more)
Created Date 2013
Contributor Yang, Hengyi (Author) / Fainekos, Georgios (Advisor) / Sarjoughian, Hessam (Committee member) / Shrivastava, Aviral (Committee member) / Arizona State University (Publisher)
Subject Computer science / Dynamic Programming / Linear & Metric Temporal Logic / Robustness
Type Masters Thesis
Extent 75 pages
Language English
Reuse Permissions All Rights Reserved
Note M.S. Computer Science 2013
Collaborating Institutions Graduate College / ASU Library
Additional Formats MODS / OAI Dublin Core / RIS

  Full Text
1.3 MB application/pdf
Download Count: 635

Description Dissertation/Thesis