Guarded transition systems: A new states/events formalism for reliability studies

States/events formalisms, such as Markov graphs or Petri nets, are widely used in reliability engineering studies. They have proved to be a very powerful tool both from conceptual and practical viewpoints. This article introduces a new states/events formalism, the so-called guarded transition system. The guarded transition system generalizes both block diagrams and Petri nets. It also makes it possible to handle looped systems, which no existing formalism is able to handle smoothly. Its use is illustrated by means of examples and several important issues such as composition and graphical representations are discussed. It is shown that current assessment methods for Markov graphs and Petri nets can be improved to a guarded transition system without a significant change of complexity.

[1]  Thomas R. Shiple,et al.  Constructive analysis of cyclic circuits , 1996, Proceedings ED&TC European Design and Test Conference.

[2]  Joon-Eon Yang,et al.  Analytic method to break logical loops automatically in PSA , 1997 .

[3]  Ivar Jacobson,et al.  The unified modeling language reference manual , 2010 .

[4]  D. Shier Network Reliability and Algebraic Structures , 1991 .

[5]  Ivar Jacobson,et al.  The Unified Modeling Language User Guide , 1998, J. Database Manag..

[6]  Yves Dutuit,et al.  The AltaRica data-flow language in use: modeling of production availability of a multi-state system , 2006, Reliab. Eng. Syst. Saf..

[7]  Yoshio Kawauchi,et al.  A new approach to production regularity assessment in the oil and chemical industries , 2002, Reliab. Eng. Syst. Saf..

[8]  John Andrews,et al.  Reliability and Risk Assessment , 1994 .

[9]  Y.-L. Cheng,et al.  On structured fault tree construction by modularizing control loops , 2000, Reliab. Eng. Syst. Saf..

[10]  Gerard J. Holzmann,et al.  Design and validation of computer protocols , 1991 .

[11]  Charles J. Colbourn,et al.  The Combinatorics of Network Reliability , 1987 .

[12]  Marco Ajmone Marsan,et al.  Modelling with Generalized Stochastic Petri Nets , 1995, PERV.

[13]  Martin Gogolla Unified Modeling Language , 2009, Encyclopedia of Database Systems.

[14]  Michael O. Ball,et al.  Computational Complexity of Network Reliability Analysis: An Overview , 1986, IEEE Transactions on Reliability.

[15]  R.K. Brayton,et al.  Analysis of combinational cycles in sequential circuits , 1996, 1996 IEEE International Symposium on Circuits and Systems. Circuits and Systems Connecting the World. ISCAS 96.

[16]  André Arnold,et al.  Finite transition systems , 1994 .

[17]  Javier Esparza,et al.  Decidability and Complexity of Petri Net Problems - An Introduction , 1996, Petri Nets.

[18]  Ivar Jacobson,et al.  Unified Modeling Language , 2020, Definitions.

[19]  Antoine Rauzy,et al.  Mode automata and their compilation into fault trees , 2002, Reliab. Eng. Syst. Saf..

[20]  J. Van Leeuwen,et al.  Handbook of theoretical computer science - Part A: Algorithms and complexity; Part B: Formal models and semantics , 1990 .

[21]  Olivier Coudert,et al.  Application of a new logically complete ATMS to digraph and network-connectivity analysis , 1994, Proceedings of Annual Reliability and Maintainability Symposium (RAMS).