{"title":"Convex Optimization and Numerical Issues","authors":"P. Garoche","doi":"10.2307/j.ctv80cd4v.12","DOIUrl":"https://doi.org/10.2307/j.ctv80cd4v.12","url":null,"abstract":"This chapter aims at providing the intuition behind convex optimization algorithms and addresses their effective use with floating-point implementation. It first briefly presents the algorithms, assuming a real semantics. As outlined in Chapter 4, convex conic programming is supported by different methods depending on the cone considered. The most known approach for linear constraints is the simplex method by Dantzig. While having an exponential-time complexity with respect to the number of constraints, the simplex method performs well in general. Another method is the set of interior point methods, initially proposed by Karmarkar and made popular by Nesterov and Nemirovski. They can be characterized as path-following methods in which a sequence of local linear problems are solved, typically by Newton's method. After these algorithms are considered, the chapter discusses approaches to obtain sound results.","PeriodicalId":402448,"journal":{"name":"Formal Verification of Control System Software","volume":"100 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127568662","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Index","authors":"","doi":"10.2307/j.ctv80cd4v.14","DOIUrl":"https://doi.org/10.2307/j.ctv80cd4v.14","url":null,"abstract":"","PeriodicalId":402448,"journal":{"name":"Formal Verification of Control System Software","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134162821","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Formal Methods","authors":"P. Garoche","doi":"10.23943/princeton/9780691181301.003.0002","DOIUrl":"https://doi.org/10.23943/princeton/9780691181301.003.0002","url":null,"abstract":"This chapter gives a brief overview of some formal methods and their use in the context of critical embedded systems development. While testing is a common practice for a lot of engineers as a way to evaluate whether the program they developed fulfills its needs, formal methods are less known and may require a little introduction to the non-expert. This chapter thus serves as a reasonable introduction to the control expert engineer. It first defines the semantics of programs: their basic properties and their meaning. Then, the chapter outlines different formal verifications and explains how they reason on the program artifact. A last part addresses the soundness of the analyses with respect to the actual semantics.","PeriodicalId":402448,"journal":{"name":"Formal Verification of Control System Software","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126413540","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Invariant Synthesis via Convex Optimization","authors":"P. Garoche","doi":"10.23943/princeton/9780691181301.003.0005","DOIUrl":"https://doi.org/10.23943/princeton/9780691181301.003.0005","url":null,"abstract":"This chapter focuses on the computation of invariant for a discrete dynamical system collecting semantics. Invariants or collecting semantics properties are properties preserved along all executions of a system and verified in all reachable states. A subset of these invariants are defined as inductive. Inductive invariants are properties, or relationships between variables, that are inductively preserved by one transition of considered systems. Intuitively, it is not required to consider a reachable state and all (or part of) its past while arguing about the validity of the invariant, but only the single state. Applying the induction principle, this chapter obtains that any state satisfying the property is mapped to a next state preserving that same property.","PeriodicalId":402448,"journal":{"name":"Formal Verification of Control System Software","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126451885","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Acknowledgments","authors":"","doi":"10.2307/j.ctv80cd4v.15","DOIUrl":"https://doi.org/10.2307/j.ctv80cd4v.15","url":null,"abstract":"","PeriodicalId":402448,"journal":{"name":"Formal Verification of Control System Software","volume":"82 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124177156","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Template-based Analyses and Min-policy Iteration","authors":"P. Garoche","doi":"10.2307/j.ctv80cd4v.8","DOIUrl":"https://doi.org/10.2307/j.ctv80cd4v.8","url":null,"abstract":"This chapter considers other configurations aside from the direct synthesis of invariants as bound templates. A first case arises when the methods shown in the previous chapter only synthesizes the template but not the bound. A second appears when one wants to analyze a system with multiple templates. This chapter looks at bounds on each variable and considers the templates 𝑝(𝑥) = 𝑥²𝑖 for each variable 𝑥𝑖 in state characterization 𝑥 ∈ Σ. The chapter thus proposes a policy iteration algorithm, based on sum-of-squares (SOS) optimization, to refine such template bounds. In practice, the chapter uses it by combining a Lyapunov-based template obtained using one of the previous methods with additional templates encoding bounds on some variables or property specific templates.","PeriodicalId":402448,"journal":{"name":"Formal Verification of Control System Software","volume":"411 ","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114058805","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"System-level Properties as Numerical Invariants","authors":"P. Garoche","doi":"10.2307/j.ctv80cd4v.9","DOIUrl":"https://doi.org/10.2307/j.ctv80cd4v.9","url":null,"abstract":"This chapter summarizes an attempt to express classical notions of control theory such as stability or robustness using the previously presented invariant-based tools. All numerical tools presented in previous chapters were focused on the precise over-approximation of reachable states. However, this chapter argues that it is important to be able to express higher level properties than just bounding reachable states. The idea that drove the invariants and template synthesis after all was this notion of Lyapunov functions and of Lyapunov stability. Assuming a control level property, it would be extremely interesting to be able to express this property over the code or model artifact. A main limitation for the study of these control level properties is the need for the plant description, which is generally not available when considering code artifact. As such, this chapter assumes the plant semantics is provided in a discrete fashion and therefore amenable to code level description as presented in Chapter 3.","PeriodicalId":402448,"journal":{"name":"Formal Verification of Control System Software","volume":"269 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115273010","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Invariant Synthesis via Convex Optimization:","authors":"","doi":"10.2307/j.ctv80cd4v.7","DOIUrl":"https://doi.org/10.2307/j.ctv80cd4v.7","url":null,"abstract":"","PeriodicalId":402448,"journal":{"name":"Formal Verification of Control System Software","volume":"104 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128604878","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Back Matter","authors":"","doi":"10.2307/j.ctv80cd4v.16","DOIUrl":"https://doi.org/10.2307/j.ctv80cd4v.16","url":null,"abstract":"","PeriodicalId":402448,"journal":{"name":"Formal Verification of Control System Software","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125718834","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Control Systems","authors":"P. Garoche","doi":"10.23943/princeton/9780691181301.003.0003","DOIUrl":"https://doi.org/10.23943/princeton/9780691181301.003.0003","url":null,"abstract":"This chapter sketches the typical development of control systems and refers the reader to classical books for more details on control system design. Historically, control design started in the continuous world: a system had to be controlled, and its dynamics was captured by the equations of physics, for example, using ordinary differential equations. Then, control theory provides means to build a controller: another system, used in combination with the system to be controlled, is able to move the system to the requested state. The chapter thus begins by presenting a typical process leading to the development of a controller in the aerospace domain. It then gives an idea of each step.","PeriodicalId":402448,"journal":{"name":"Formal Verification of Control System Software","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127323509","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}