From control law diagrams to Ada via Circus

TY - JOUR

T1 - From control law diagrams to Ada via Circus

AU - Cavalcanti, Ana

AU - Clayton, Phil

AU - O’Halloran , Colin

N1 - 10.1007/s00165-010-0170-3

PY - 2011/7

Y1 - 2011/7

N2 - 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 Circus, 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 Circus, and a strategy to prove that a parallel Ada implementation refines the Circus specification; we rely on a Circus 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.

AB - 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 Circus, 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 Circus, and a strategy to prove that a parallel Ada implementation refines the Circus specification; we rely on a Circus 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.

KW - Z, CSP, Simulink, refinement

UR - http://www.scopus.com/inward/record.url?scp=80054864674&partnerID=8YFLogxK

U2 - 10.1007/s00165-010-0170-3

DO - 10.1007/s00165-010-0170-3

M3 - Article

SN - 0934-5043

VL - 23

SP - 1

EP - 48

JO - Formal Aspects of Computing

JF - Formal Aspects of Computing

IS - 4

ER -