From control law diagrams to Ada via

Ana Cavalcanti (1) , Phil Clayton (2, 3) , Colin O'Halloran (2)

1 University of York [York, UK]
2 Systems Assurance Group, QinetiQ
3 Veonix

Control engineers make extensive use of diagrammatic notations; control law diagrams are used in industry every day. Techniques and tools for analysis of these diagrams or their models are plentiful, but verification of their implementations is a challenge that has been taken up by few. We are aware only of approaches that rely on automatic code generation, which is not enough assurance for certification, and often not adequate when tailored hardware components are used. Our work is based on , a notation that combines Z, CSP, and a refinement calculus, and on industrial tools that produce partial Z and CSP models of discrete-time Simulink diagrams. We present a strategy to translate Simulink diagrams to , and a strategy to prove that a parallel Ada implementation refines the specification; we rely on a semantics for the program. By using a combined notation, we provide a specification that considers both functional and behavioural aspects of a large set of diagrams, and support verification of a large number of implementations. We can handle, for instance, arbitrarily large data types and dynamic scheduling.

Mots clés: CSP; Simulink; Refinement

Ana Cavalcanti, Phil Clayton, Colin O'Halloran. From control law diagrams to Ada via. Formal Aspects of Computing, 2011, 23 (4), pp.465-512. ⟨10.1007/s00165-010-0170-3⟩. ⟨hal-00658702⟩