The Multi-State Inclusion-Exclusion Principle: Conventional and Improved Versions| Chapter 9 | Research Highlights in Mathematics and Computer Science Vol. 5

 This branch considers an emergent variant of the chaste problem of calculating the chance of the union of n occurrences, or, more precisely, the anticipation of the disjunction (ORing) of n indicator variables for these occurrences, i.e., the contingency of this disjunction being prepared one. The variant existing herein everything with multi-valued variables, accompanying the required possibility representing the stability of a multi-state delivery network (MSDN), whose binary system gain is a two-valued function delineated in terms of multi-costly component successes. The chapter explains a simple order for dealing with the aforementioned question in terms of a standard instance MSDN, where achievement is defined as the disjunction of prime implicants or slightest paths of the appropriate network. This method engages the multi-state inclusion-exclusion (MS-IE) standard, which is guide a multi-state generalization of the ANDing movement's idempotency property. The method is illustrated with a itemized symbolic instance of a real-world record of what happened, and it yields a more precise report of the same numerical advantage obtained earlier. The example manifests the MS-IE method's well-known imperfections and extreme inefficiency, but it again reveals the way to alternative methods in which aforementioned a flaw is (incompletely) mitigated. The building of a multi-state probability-ready expression(MS-PRE)  is a famous example of these plans.  Applying the MS-IE principle to the union of minority (factored or composite) pathways that are convinced (at a low cost) to PRE form is another potential approach. An creative technique for fusing the MS-PRE and MS-IE standard together is used as a tertiary candidate design in this article. The use of MS-PRE is restricted to 'shellable' disjointing of ORed terms, and the happening partially orthogonalized disjunctive form is afterward subjected to MS-IE. This new approach avoids the issues brought on by either MS-PRE or MS-IE and form the most of two together of them. The identical actual-world issue that was met with the usual MS-IE is effectively exploited to depict the method.

Author(s) Details:

Ali Muhammad Ali Rushdi,
Department of Electrical and Computer Engineering, King Abdulaziz University, P. O. Box 80200, Jeddah, 21589, Saudi Arabia.

Motaz Hussain Amashah,
Department of Computer Engineering and Networks, College of Computer Science and Engineering, University of Jeddah, P. O. Box 80327, Jeddah, Saudi Arabia.

Please see the link here: https://stm.bookpi.org/RHMCS-V5/article/view/9546

Reliability Analysis of a Multi-State Delivery Network through the Symbolic Derivation of a Probability-Ready Expression | Chapter 12 | Recent Advances in Mathematical Research and Computer Science Vol. 4

 The dependability of a multi-state delivery network (MSDN) with different suppliers, transfer stations, and marketplaces (depicted as vertices) connected by branches of multi-state capabilities, delivering a specific commodity or service between their end vertices is the subject of this chapter. We use a symbolic logic interpretation of network success to meet market demand while staying within budget and manufacturing capacity constraints, even while the network is deteriorating. This system success is a two-valued function described in terms of multi-valued component successes, and it has been derived in minimum form as the disjunction of prime implicants or minimal pathways of the relevant network in the literature. This chapter's key contribution is a systematic method for transforming this minimum expression into a probability-ready expression (PRE). The PRE notion has been effectively extrapolated from the two-valued logical domain to the multi-valued logical domain. This concept is crucial because it enables a one-to-one transformation of a random logical expression to its statistical expectation form by simply replacing all logic variables with their statistical expectations, as well as substituting arithmetic multiplication and addition for their logical counterparts (ANDing and ORing). This chapter's running example for showing PRE derivation is admittedly long and tiresome. The statistical expectation of the statement is that it will be equal to 1, and this is referred to as network dependability. The proposed method is demonstrated using a thorough symbolic example of a real-life case study, and it yields a more precise version of the identical numerical value obtained previously by another method. This chapter is part of a larger project to create educational materials for a variety of prospective methodologies for measuring multi-state reliability.

Author(S) Details

Ali Muhammad Ali Rushdi
Department of Electrical and Computer Engineering, King Abdulaziz University, Faculty of Engineering, P. O. Box 80200, Jeddah 21589, Kingdom of Saudi Arabia.

Motaz Hussain Amashah
Department of Computer Engineering and Networks, College of Computer Science and Engineering, University of Jeddah, P.O.Box 80327, Jeddah, Saudi Arabia.

View Book:- https://stm.bookpi.org/RAMRCS-V4/article/view/4878

Complementation of Multi-State System Success to Obtain System Failure and Utilization of Both Boolean Functions in Checking Reliability Expressions | Chapter 11 | Novel Perspectives of Engineering Research Vol. 3

 This chapter addresses two important contributions that extend binary reliability techniques to multi-state reliability techniques: (a) the problem of complementation or inversion of the function of system success to that of system failure (or, equivalently, of deriving the logical minimal cutsets in terms of the logical minimal paths), and (b) the associated problem of hand-checking of a symbolic reliability expression, which relies on complete knowledge of the logical minimal paths. The research focuses on the resiliency of a multi-state distribution network with various suppliers and dwindling production capacity. It demonstrates two complementation techniques, one using multi-state De Morgan's rules and the other using the multi-state Boole-Shannon expansion. The chapter also presents a way for testing the stability of a multi-state system in terms of its logical minimal paths and logical minimal cutsets, which is a common use case for this complementation.

Author(S) Details

Ali Muhammad Ali Rushdi
Department of Electrical and Computer Engineering, King Abdulaziz University, Faculty of Engineering, P.O.Box 80200, Jeddah 21589, Saudi Arabia.

Motaz Hussain Amashah
Department of Computer Engineering and Networks, College of Computer Science and Engineering, University of Jeddah, P.O.Box 80327, Jeddah, Saudi Arabia.

View Book:- https://stm.bookpi.org/NPER-V3/article/view/4762