ABSTRACT
The goal of this communication is to present an algorithm to compile Guarded Transition Systems into Boolean equations (Fault Trees). This work is done as a part of AltaRica 3.0 project, which aims to design a new version of AltaRica and to develop a complete set of authoring and assessment tools for this new version of the language. AltaRica 3.0 improves significantly the expressive power of AltaRica Data-Flow without decreasing the efficiency of its assessment algorithms. Its underlying mathematical model—Guarded Transition Systems (GTS) – makes it possible to design acausal components and to handle looped systems. GTS is a states/transitions formalism that generalizes classical safety formalisms, such as Reliability Block Diagrams and Markov chains. The compilation of GTS into Fault Trees is of interest for several reasons. First, some regulation authorities still require Fault Trees to support the certification process. Second, the automated generation of Fault Trees from higher level representations makes easier their maintenance through the life cycle of systems. Finally, assessment tools for Boolean models are much more efficient than those for states/transitions models.
