Author:
Becchi Anna,Cimatti Alessandro
Abstract
AbstractThe analysis of legacy systems requires the automated extraction of high-level specifications. We propose a framework, called Abstraction Modulo Stability, for the analysis of transition systems operating in stable states, and responding with run-to-completion transactions to external stimuli. The abstraction captures, in the form of a finite state machine, the effects of external stimuli on the system state. This approach is parametric on a set of predicates of interest and on the definition of stability. We consider some possible stability definitions, which yield different practically relevant abstractions, and propose parametric algorithms for abstraction computation. The framework is evaluated in terms of expressivity and adequacy within an industrial project with the Italian Railway Network, on reverse engineering of relay-based interlocking circuits to extract specifications for a computer-based reimplementation.
Funder
Provincia Autonoma di Trento
NextGenerationEU
Università degli Studi di Trento
Publisher
Springer Science and Business Media LLC
Reference32 articles.
1. de Almeida Pereira DI (2020) Analysis and formal specification of relay-based railway interlocking systems. (analyse et spécification formelle des systèmes d’enclenchement ferroviaire basés sur les relais). PhD thesis, École centrale de Lille, Villeneuve-d’Ascq, France
2. Amendola A, Becchi A, Cavada R, et al. (2020) A model-based approach to the design, verification and deployment of railway interlocking system. In: ISoLA (3), lecture notes in computer science, vol 12478. Springer, pp 240–254
3. Amendola A, Becchi A, Cavada R, et al. (2022) NORMA: a tool for the analysis of relay-based railway interlocking systems. In: Fisman D, Rosu G (eds) tools and algorithms for the construction and analysis of systems - 28th international conference, TACAS 2022, held as Part of the European joint conferences on theory and practice of software, ETAPS 2022, Munich, Germany, Proceedings, Part I, Lecture Notes in Computer Science, vol 13243. Springer, pp 125–142, 2–7 April. https://doi.org/10.1007/978-3-030-99524-9_7
4. Barrett CW, Sebastiani R, Seshia SA, et al. (2009) Satisfiability modulo theories. In: Handbook of Satisfiability, Frontiers in Artificial Intelligence and Applications, vol 185. IOS Press, pp 825–885
5. Basagiannis S, Battista L, Becchi A, et al. (2023) Smt-based stability verification of an industrial switched pi control systems. In: 1st International Workshop on Verification & Validation of Dependable Cyber-Physical Systems