Formal methods can strongly contribute to improve dependability of controllers during design, by providing means to avoid flaws due to designers′ omissions or specifications misinterpretations. This paper presents a synthesis method dedicated to logic controllers. Its goal is to obtain the control laws from specifications given in natural language by symbolic computation. The formal framework that underlies this method is the Boolean algebra of n‐variable switching functions. In this algebra, thanks to relations and theorems presented in this paper, it is possible to formally express logical controllers specifications, to automatically detect inconsistencies in specifications, and to obtain automatically the set of solutions or to choose an optimal solution according to given optimization criteria. The application of this synthesis method to an example allows illustrating its main advantages.
17 February 2019 in Proceedings of the Institution of Mechanical Engineers, Part O: Journal of Risk and Reliability
Minimal cut sequences computation is the main objective of qualitative safety analysis of dynamic systems. This article shows first that the existing definitions of minimal cut sequences are not suitable when these systems are both repairable and reconfigurable. A new definition for this class of systems as well as an algorithm to compute these sequences from a safety analysis model, in the form of a Generalized Boolean logic Driven Markov Processes model, are then proposed. These contributions are illustrated on a case study from power industry. Comparison of the obtained minimal cut sequences to those which are yielded by algorithms based on the previous definitions permits to highlight the relevance of the approach.