Towards Formal Reliability Analysis of Logistics Service Supply Chains using Theorem Proving

Logistics service supply chains (LSSCs) are composed of several nodes, with distinct behaviors, that ensure moving a product or service from a producer to consumer. Given the usage of LSSC in many safety-critical applications, such as hospitals, it is very important to ensure their reliable operation. For this purpose, many LSSC structures are modelled using Reliability Block Diagrams (RBDs) and their reliability is assessed using paperand-pencil proofs or computer simulations. Due to their inherent incompleteness, these analysis techniques cannot ensure accurate reliability analysis results. In order to overcome this limitation, we propose to use higher-order-logic (HOL) theorem proving to conduct the RBD-based reliability analysis of LSSCs in this paper. In particular, we present the higher-order-logic formalizations of LSSC with different and same types of capacities. As an illustrative example, we also present the formal reliability analysis of a simple three-node corporation.

[1]  Sofiène Tahar,et al.  Towards the Formal Reliability Analysis of Oil and Gas Pipelines , 2014, CICM.

[2]  Sofiène Tahar,et al.  Formal Verification Methods , 2015 .

[3]  Joanna Soszynska Reliability and risk evaluation of a port oil pipeline transportation system in variable operation conditions , 2010 .

[4]  Melvin Fitting,et al.  First-Order Logic and Automated Theorem Proving , 1990, Graduate Texts in Computer Science.

[5]  Osman Hasan,et al.  Towards Formal Fault Tree Analysis Using Theorem Proving , 2015, CICM.

[6]  Michael Norrish,et al.  A Brief Overview of HOL4 , 2008, TPHOLs.

[7]  Sofiène Tahar,et al.  Formal Reliability Analysis Using Theorem Proving , 2010, IEEE Transactions on Computers.

[8]  Johannes Hölzl,et al.  Three Chapters of Measure Theory in Isabelle/HOL , 2011, ITP.

[9]  Sofiène Tahar,et al.  An approach for lifetime reliability analysis using theorem proving , 2014, J. Comput. Syst. Sci..

[10]  MengChu Zhou,et al.  Automated Modeling of Dynamic Reliability Block Diagrams Using Colored Petri Nets , 2010, IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans.

[11]  Robin Milner,et al.  A Theory of Type Polymorphism in Programming , 1978, J. Comput. Syst. Sci..

[12]  Alonzo Church,et al.  A formulation of the simple theory of types , 1940, Journal of Symbolic Logic.

[13]  Geoff Sutcliffe,et al.  Automated Reasoning in Higher-Order Logic using the TPTP THF Infrastructure , 2010, J. Formaliz. Reason..

[14]  Michael J. C. Gordon,et al.  Mechanizing programming logics in higher order logic , 1989 .

[15]  Jonathan Billington,et al.  A Parametric State Space for the Analysis of the Infinite Class of Stop-and-Wait Protocols , 2006, SPIN.

[16]  J. Harrison Formalized Mathematics , 1996 .

[17]  Sofiène Tahar,et al.  Formal reliability analysis of wireless sensor network data transport protocols using HOL , 2015, 2015 IEEE 11th International Conference on Wireless and Mobile Computing, Networking and Communications (WiMob).

[18]  Sofiène Tahar,et al.  Formalization of Continuous Probability Distributions , 2007, CADE.

[19]  Sofiène Tahar,et al.  On the Formalization of the Lebesgue Integration Theory in HOL , 2010, ITP.

[20]  Joe Hurd,et al.  Formal verification of probabilistic algorithms , 2003 .