A PVS-Simulink Integrated Environment for Model-Based Analysis of Cyber-Physical Systems

被引:35
作者
Bernardeschi, Cinzia [1 ]
Domenici, Andrea [1 ]
Masci, Paolo [2 ,3 ]
机构
[1] Univ Pisa, Dept Informat Engn, I-56126 Pisa, PI, Italy
[2] HASLab INESC TEC, P-4704553 Braga, Portugal
[3] Univ Minho, P-4704553 Braga, Portugal
关键词
Real-time and embedded systems; modeling techniques; specification; formal methods; IMPLANTABLE CARDIAC-PACEMAKERS; QUANTITATIVE VERIFICATION; MEDICAL DEVICES; TIMED AUTOMATA;
D O I
10.1109/TSE.2017.2694423
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
This paper presents a methodology, with supporting tool, for formal modeling and analysis of software components in cyber-physical systems. Using our approach, developers can integrate a simulation of logic-based specifications of software components and Simulink models of continuous processes. The integrated simulation is useful to validate the characteristics of discrete system components early in the development process. The same logic-based specifications can also be formally verified using the Prototype Verification System (PVS), to gain additional confidence that the software design complies with specific safety requirements. Modeling patterns are defined for generating the logic-based specifications from the more familiar automata-based formalism. The ultimate aim of this work is to facilitate the introduction of formal verification technologies in the software development process of cyber-physical systems, which typically requires the integrated use of different formalisms and tools. A case study from the medical domain is used to illustrate the approach. A PVS model of a pacemaker is interfaced with a Simulink model of the human heart. The overall cyber-physical system is co-simulated to validate design requirements through exploration of relevant test scenarios. Formal verification with the PVS theorem prover is demonstrated for the pacemaker model for specific safety aspects of the pacemaker design.
引用
收藏
页码:512 / 533
页数:22
相关论文
共 72 条
[1]   A THEORY OF TIMED AUTOMATA [J].
ALUR, R ;
DILL, DL .
THEORETICAL COMPUTER SCIENCE, 1994, 126 (02) :183-235
[2]  
[Anonymous], 1989, CWI-Quarterly
[3]  
[Anonymous], 2016, STAT REF
[4]   TAME: Using PVS strategies for special-purpose theorem proving [J].
Archer, M .
ANNALS OF MATHEMATICS AND ARTIFICIAL INTELLIGENCE, 2000, 29 (1-4) :139-181
[5]  
Attarzadeh Niaki Seyed Hosein, 2011, 2011 6th IEEE International Symposium on Industrial Embedded Systems (SIES), P238, DOI 10.1109/SIES.2011.5953667
[6]  
Back R.-J., 1998, Refinement Calculus: A Systematic Introduction
[7]  
Behrmann G, 2004, LECT NOTES COMPUT SC, V3185, P200
[8]  
Behrmann G, 2006, INT CONF QUANT EVAL, P125
[9]   Timed automata: Semantics, algorithms and tools [J].
Bengtsson, J ;
Yi, W .
LECTURES ON CONCURRENCY AND PETRI NETS: ADVANCES IN PETRI NETS, 2004, 3098 :87-124
[10]  
Bernardeschi Cinzia, 2014, Cardiotechnix 2014. 2nd International Congress on Cardiovascular Technologies, P55