The formal design of distributed controllers with dSL and Spin

被引:4
作者
De Wachter, B [1 ]
Genon, A [1 ]
Massart, T [1 ]
Meuter, C [1 ]
机构
[1] Univ Libre Bruxelles, Dept Comp Sci, B-1050 Brussels, Belgium
关键词
industrial process control; transparent code distribution; verification; Spin;
D O I
10.1007/s00165-005-0066-9
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
We study the formal verification of programs written in dSL, an extension of the standard ST language used to program industrial controllers. It proposes a trade off between industrial and formal verification worlds. The main advantage Of dSL is to provide a transparent code distribution through low level communication mechanisms. The behavior of the synthesized distributed system can therefore be formally modeled, easily monitored and formally verified. The verification of a dSL program, realized with the Spin tool, is eased by the definition of a lattice of models linked with a simulation relation preserving next-free LTL formulae. We show that, although dSL is an industrial programming language, it gives the possibility to verify systems designed with it. We illustrate the benefit of our approach with a simple control system of two canal locks.
引用
收藏
页码:177 / 200
页数:24
相关论文
共 28 条
[1]  
Abrial J., 2005, The B-book: Assigning Programs to Meanings
[2]  
AUBRY P, 1997, THESIS IFSIC RENNES
[3]   THE SYNCHRONOUS APPROACH TO REACTIVE AND REAL-TIME SYSTEMS [J].
BENVENISTE, A ;
BERRY, G .
PROCEEDINGS OF THE IEEE, 1991, 79 (09) :1270-1282
[4]   THE ESTEREL SYNCHRONOUS PROGRAMMING LANGUAGE - DESIGN, SEMANTICS, IMPLEMENTATION [J].
BERRY, G ;
GONTHIER, G .
SCIENCE OF COMPUTER PROGRAMMING, 1992, 19 (02) :87-152
[5]  
BERRY G, 1989, INFORMATION PROCESSI, V89, P11
[6]  
Bonfatti F., 1997, IEC 1131 3 PROGRAMMI
[7]  
BRINKSMA H, 1995, S AFRICAN COMPUT J, V13, P2
[8]  
CASPI P, 1987, C REC 14 ANN ACM S P
[9]  
Castellani I., 1999, Foundations of Software Technology and Theoretical Computer Science. 19th Conference. Proceedings (Lecture Notes in Computer Science Vol.1738), P219
[10]   THE COMPLEXITY OF MULTITERMINAL CUTS [J].
DAHLHAUS, E ;
JOHNSON, DS ;
PAPADIMITRIOOU, CH ;
SEYMOUR, PD ;
YANNAKAKIS, M .
SIAM JOURNAL ON COMPUTING, 1994, 23 (04) :864-894