System analysis and robustness

Moggi, Eugenio, Farjudian, Amin and Taha, Walid (2019) System analysis and robustness. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 11200 . pp. 36-44. ISSN 0302-9743

PDF - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader
Download (344kB) | Preview


Software is increasingly embedded in a variety of physical contexts. This imposes new requirements on tools that support the design and analysis of systems. For instance, modeling embedded and cyber-physical systems needs to blend discrete mathematics, which is suitable for modeling digital components, with continuous mathematics, used for modeling physical components. This blending of continuous and discrete creates challenges that are absent when the discrete or the continuous setting are considered in isolation. We consider robustness, that is, the ability of an analysis of a model to cope with small amounts of imprecision in the model. Formally, we identify analyses with monotonic maps between complete lattices (a mathematical framework used for abstract interpretation and static analysis) and define robustness for monotonic maps between complete lattices of closed subsets of a metric space. © 2019, Springer Nature Switzerland AG.

Item Type: Article
Additional Information: Moggi E., Farjudian A., Taha W. (2019) System Analysis and Robustness. In: Margaria T., Graf S., Larsen K. (eds) Models, Mindsets, Meta: The What, the How, and the Why Not?. Lecture Notes in Computer Science, vol 11200. Springer, Cham.
Keywords: Analyses; Robustness; Domain theory
Schools/Departments: University of Nottingham Ningbo China > Faculty of Science and Engineering > School of Computer Science
Identification Number:
Depositing User: QIU, Lulu
Date Deposited: 29 Jul 2019 11:03
Last Modified: 29 Jul 2019 11:03

Actions (Archive Staff Only)

Edit View Edit View