{"product_id":"systems-dependability-assessment-modeling-with-graphs-and-finite-state-automata-hardback-9781848217652","title":"Systems Dependability Assessment; Modeling with Graphs and Finite State Automata (Hardback) 9781848217652","description":"\u003cfont face=\"Georgia\"\u003e\r\n\u003cp\u003e\u003cfont size=\"6\"\u003eSystems Dependability Assessment\u003c\/font\u003e\u003cbr\u003e\r\n\u003cfont size=\"5\"\u003eModeling with Graphs and Finite State Automata\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\r\n\r\n\r\n\u003cp\u003e\u003cfont size=\"4\"\u003eJean-Francois Aubry (Author), Nicolae Brinzei (Author)\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003e9781848217652, Wiley\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003eHardback, published 6 February 2015\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003e200 pages\u003cbr\u003e24.1 x 16.5 x 1.8 cm, 0.449 kg\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\r\n\r\n\r\n\r\n\u003cp align=\"justify\"\u003e\u003cstrong\u003e\u003cfont size=\"3\"\u003e\u003cp\u003ePresents recent developments of probabilistic assessment of systems dependability based on stochastic models, including graph theory, finite state automaton and language theory, for both dynamic and hybrid contexts.\u003c\/p\u003e\u003c\/font\u003e\u003c\/strong\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003e\u003cp\u003ePREFACE ix\u003c\/p\u003e \u003cp\u003eINTRODUCTION xiii\u003c\/p\u003e \u003cp\u003e\u003cb\u003ePART 1. PREDICTED RELIABILITY OF STATIC SYSTEMS; A GRAPH-THEORY BASED APPROACH 1\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e\u003cb\u003eCHAPTER 1. STATIC AND TIME INVARIANT SYSTEMS WITH BOOLEAN REPRESENTATION 3\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e1.1. Notations 3\u003c\/p\u003e \u003cp\u003e1.2. Order relation on U 4\u003c\/p\u003e \u003cp\u003e1.3. Structure of a system 6\u003c\/p\u003e \u003cp\u003e1.3.1. State diagram of a system 6\u003c\/p\u003e \u003cp\u003e1.3.2. Monotony of an SF, coherence of a system 7\u003c\/p\u003e \u003cp\u003e1.4. Cut-set and tie-set of a system 9\u003c\/p\u003e \u003cp\u003e1.4.1. Tie-set 9\u003c\/p\u003e \u003cp\u003e1.4.2. Cut-set 10\u003c\/p\u003e \u003cp\u003e\u003cb\u003eCHAPTER 2. RELIABILITY OF A COHERENT SYSTEM 13\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e2.1. Demonstrating example 15\u003c\/p\u003e \u003cp\u003e2.2. The reliability block diagram (RBD) 18\u003c\/p\u003e \u003cp\u003e2.3. The fault tree (FT) 21\u003c\/p\u003e \u003cp\u003e2.4. The event tree 26\u003c\/p\u003e \u003cp\u003e2.5. The structure function as a minimal union of disjoint monomials 28\u003c\/p\u003e \u003cp\u003e2.5.1. Ordered graph of a monotone structure function 29\u003c\/p\u003e \u003cp\u003e2.5.2. Maxima and minima of the ordered graph 31\u003c\/p\u003e \u003cp\u003e2.5.3. Ordered subgraphs of the structure function 32\u003c\/p\u003e \u003cp\u003e2.5.4. Introductory example 33\u003c\/p\u003e \u003cp\u003e2.5.5. Construction of the minimal Boolean form 37\u003c\/p\u003e \u003cp\u003e2.5.6. Complexity 43\u003c\/p\u003e \u003cp\u003e2.5.7. Comparison with the BDD approach 45\u003c\/p\u003e \u003cp\u003e2.6. Obtaining the reliability equation from the Boolean equation 49\u003cbr\u003e\u003cbr\u003e2.6.1. The traditional approach 49\u003c\/p\u003e \u003cp\u003e2.6.2. Comparison with the structure function by Kaufmann 50\u003c\/p\u003e \u003cp\u003e2.7. Obtain directly the reliability from the ordered graph 52\u003c\/p\u003e \u003cp\u003e2.7.1. Ordered weighted graph 53\u003c\/p\u003e \u003cp\u003e2.7.2. Algorithm 56\u003c\/p\u003e \u003cp\u003e2.7.3. Performances of the algorithm 59\u003c\/p\u003e \u003cp\u003e\u003cb\u003eCHAPTER 3. WHAT ABOUT NON-COHERENT SYSTEMS? 61\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e3.1. Example of a non-coherent supposed system 61\u003c\/p\u003e \u003cp\u003e3.2. How to characterize the non-coherence of a system? 63\u003c\/p\u003e \u003cp\u003e3.3. Extension of the ordered graph method 66\u003c\/p\u003e \u003cp\u003e3.3.1. Decomposition algorithm 67\u003c\/p\u003e \u003cp\u003e3.4. Generalization of the weighted graph algorithm 68\u003c\/p\u003e \u003cp\u003eCONCLUSION TO PART 1 73\u003c\/p\u003e \u003cp\u003e\u003cb\u003ePART 2. PREDICTED DEPENDABILITY OF SYSTEMS IN A DYNAMIC CONTEXT 75\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e\u003cb\u003eINTRODUCTION TO PART 2 77\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e\u003cb\u003eCHAPTER 4. FINITE STATE AUTOMATON 83\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e4.1. The context of discrete event system 83\u003c\/p\u003e \u003cp\u003e4.2. The basic model 84\u003c\/p\u003e \u003cp\u003e\u003cb\u003eCHAPTER 5. STOCHASTIC FSA 89\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e5.1. Basic definition 89\u003c\/p\u003e \u003cp\u003e5.2. Particular case: Markov and semi-Markov processes 90\u003c\/p\u003e \u003cp\u003e5.3. Interest of the FSA model 91\u003c\/p\u003e \u003cp\u003e5.4. Example of stochastic FSA 92\u003c\/p\u003e \u003cp\u003e5.5. Probability of a sequence 93\u003c\/p\u003e \u003cp\u003e5.6. Simulation with Scilab 94\u003c\/p\u003e \u003cp\u003e5.7. State\/event duality 95\u003c\/p\u003e \u003cp\u003e5.8. Construction of a stochastic SFA 96\u003c\/p\u003e \u003cp\u003e\u003cb\u003eCHAPTER 6. GENERALIZED STOCHASTIC FSA 101\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e\u003cb\u003eCHAPTER 7. STOCHASTIC HYBRID AUTOMATON 105\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e7.1. Motivation 105\u003c\/p\u003e \u003cp\u003e7.2. Formal definition of the model 105\u003c\/p\u003e \u003cp\u003e7.3. Implementation 107\u003c\/p\u003e \u003cp\u003e7.4. Example 109\u003c\/p\u003e \u003cp\u003e7.5. Other examples 116\u003c\/p\u003e \u003cp\u003e7.5.1. Control temperature of an oven 116\u003c\/p\u003e \u003cp\u003e7.5.2. Steam generator of a nuclear power plant 118\u003c\/p\u003e \u003cp\u003e7.6. Conclusion 120\u003c\/p\u003e \u003cp\u003e\u003cb\u003eCHAPTER 8. OTHER MODELS\/TOOLS FOR DYNAMIC DEPENDABILITY VERSUS SHA 121\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e8.1. The dynamic fault trees 121\u003c\/p\u003e \u003cp\u003e8.1.1. Principle 121\u003c\/p\u003e \u003cp\u003e8.1.2. Equivalence with the FSA approach 124\u003c\/p\u003e \u003cp\u003e8.1.3. Covered criteria 126\u003c\/p\u003e \u003cp\u003e8.2. The Boolean logic-driven Markov processes 126\u003c\/p\u003e \u003cp\u003e8.2.1. Principle 126\u003c\/p\u003e \u003cp\u003e8.2.2. Equivalence with the FSA approach 127\u003c\/p\u003e \u003cp\u003e8.2.3. Covered criteria 127\u003c\/p\u003e \u003cp\u003e8.3. The dynamic event trees (DETs) 128\u003c\/p\u003e \u003cp\u003e8.3.1. Principle 128\u003c\/p\u003e \u003cp\u003e8.3.2. Equivalence with the FSA approach 129\u003c\/p\u003e \u003cp\u003e8.3.3. Covered criteria 130\u003c\/p\u003e \u003cp\u003e8.4. The piecewise deterministic Markov processes 131\u003c\/p\u003e \u003cp\u003e8.4.1. Principle 131\u003c\/p\u003e \u003cp\u003e8.4.2. Equivalence with the FSA approach 131\u003c\/p\u003e \u003cp\u003e8.4.3. Covered criteria 132\u003c\/p\u003e \u003cp\u003e8.5. Other approaches 132\u003c\/p\u003e \u003cp\u003eCONCLUSION AND PERSPECTIVES 135\u003c\/p\u003e \u003cp\u003eAPPENDIX 137\u003c\/p\u003e \u003cp\u003eBIBLIOGRAPHY 173\u003c\/p\u003e \u003cp\u003eINDEX 181\u003c\/p\u003e\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003eSubject Areas: Economics [\u003ca title=\"See our other books on Economics\" href=\"https:\/\/freshlyprintedbooks.co.uk\/search?q=%22Economics%20%5BKC%5D%22\"\u003eKC\u003c\/a\u003e]\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\r\n\u003c\/font\u003e","brand":"Wiley-ISTE","offers":[{"title":"Brand New","offer_id":52449391739160,"sku":"9781848217652","price":100.57,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0730\/2037\/5320\/files\/9781848217652.jpg?v=1785197876","url":"https:\/\/freshlyprintedbooks.co.uk\/products\/systems-dependability-assessment-modeling-with-graphs-and-finite-state-automata-hardback-9781848217652","provider":"Freshly Printed Books","version":"1.0","type":"link"}