On Qualitative Analysis of Fault Trees Using Structurally Persistent Nets
|
|
- Oscar McDonald
- 5 years ago
- Views:
Transcription
1 On Qualitative Analysis of Fault Trees Using Structurally Persistent Nets Ricardo J. Rodríguez Research Institute of Applied Sciences in Cybersecurity University of León, Spain June 10, 2015 XXIII Jornadas de Concurrencia y Sistemas Distribuidos Málaga (Spain) To appear in IEEE Trans. on Systems, Man, and Cybernetics: Systems doi: /TSMC
2 Agenda 1 Introduction 2 Definitions 3 Model Transformation 4 Fault Tree Analysis using P-Semiflows 5 Case Study: A Pressure Tank System 6 Related Work 7 Conclusions and Future Work R. J. Rodríguez On Qualitative Analysis of Fault Trees Using Structurally Persistent Nets JCSD / 29
3 Agenda 1 Introduction 2 Definitions 3 Model Transformation 4 Fault Tree Analysis using P-Semiflows 5 Case Study: A Pressure Tank System 6 Related Work 7 Conclusions and Future Work R. J. Rodríguez On Qualitative Analysis of Fault Trees Using Structurally Persistent Nets JCSD / 29
4 Introduction (I) Definition of Fault Tree Fault Tree Event-driven failure logic Top Event: undesired state the root) Gates: describe logic that relates events Event: different kind (next slide) R. J. Rodríguez On Qualitative Analysis of Fault Trees Using Structurally Persistent Nets JCSD / 29
5 Introduction (I) Definition of Fault Tree Fault Tree Event-driven failure logic Top Event: undesired state the root) Gates: describe logic that relates events Event: different kind (next slide) Coherent Fault Tree: logic restricted to AND/OR formulae R. J. Rodríguez On Qualitative Analysis of Fault Trees Using Structurally Persistent Nets JCSD / 29
6 Introduction (II) A bit more of Fault Trees... AND gate OR gate TRANSFER IN TRANSFER OUT BASIC CONDITIONING EXTERNAL UNDEVELOPED INTERMEDIATE event event event event event Graphical symbols AND / OR gates Event type: Basic: component/human fault; failure & repair data available Conditioning: gate triggered by an event External (or house): normally expected to occur Undeveloped: no further developed (e.g., no consequence, lack of data) Intermediate: middle/top event, generated by combination of others Transfer: to divide large FTs into smaller ones, or reduce duplication R. J. Rodríguez On Qualitative Analysis of Fault Trees Using Structurally Persistent Nets JCSD / 29
7 Introduction (III) Fault Tree Analysis Find event combinations out that leads to an undesired state Top-down deductive analysis technique, from the early 60s Used in safety and reliability engineering R. J. Rodríguez On Qualitative Analysis of Fault Trees Using Structurally Persistent Nets JCSD / 29
8 Introduction (III) Fault Tree Analysis Find event combinations out that leads to an undesired state Top-down deductive analysis technique, from the early 60s Used in safety and reliability engineering (Minimal) Cut Sets Set of basic events whose occurrence causes a system to fail Minimal Cut Set: it cannot be further reduced, and still leads to an undesired state R. J. Rodríguez On Qualitative Analysis of Fault Trees Using Structurally Persistent Nets JCSD / 29
9 Introduction (III) Fault Tree Analysis Find event combinations out that leads to an undesired state Top-down deductive analysis technique, from the early 60s Used in safety and reliability engineering (Minimal) Cut Sets Set of basic events whose occurrence causes a system to fail Minimal Cut Set: it cannot be further reduced, and still leads to an undesired state (Minimal) Path Sets Set of basic events whose nonoccurrence assures the nonoccurrence of TE Minimal Path Set: it cannot be further reduced, and still leads to an undesired state MPS are a dual set of MCS R. J. Rodríguez On Qualitative Analysis of Fault Trees Using Structurally Persistent Nets JCSD / 29
10 Introduction (IV) Recall the example... Six path sets: PS 1 = {E 1, E 2, E 3, E 4, E 5 } PS 2 = {E 1, E 2, E 3, E 5, E 6 } PS 3 = {E 1, E 2, E 3, E 5, E 7 } PS 4 = {E 1, E 2, E 3, E 4, E 5, E 6 } PS 5 = {E 1, E 2, E 3, E 6 } PS 6 = {E 1, E 2, E 3, E 6, E 7 } R. J. Rodríguez On Qualitative Analysis of Fault Trees Using Structurally Persistent Nets JCSD / 29
11 Introduction (IV) Recall the example... Six path sets: PS 1 = {E 1, E 2, E 3, E 4, E 5 } PS 2 = {E 1, E 2, E 3, E 5, E 6 } PS 3 = {E 1, E 2, E 3, E 5, E 7 } PS 4 = {E 1, E 2, E 3, E 4, E 5, E 6 } PS 5 = {E 1, E 2, E 3, E 6 } PS 6 = {E 1, E 2, E 3, E 6, E 7 } Not minimal! PS 2 PS 5, PS 4 PS 5 (or PS 4 PS 1 ), PS 6 PS 5 R. J. Rodríguez On Qualitative Analysis of Fault Trees Using Structurally Persistent Nets JCSD / 29
12 Introduction (IV) Recall the example... Six path sets: PS 1 = {E 1, E 2, E 3, E 4, E 5 } PS 2 = {E 1, E 2, E 3, E 5, E 6 } PS 3 = {E 1, E 2, E 3, E 5, E 7 } PS 4 = {E 1, E 2, E 3, E 4, E 5, E 6 } PS 5 = {E 1, E 2, E 3, E 6 } PS 6 = {E 1, E 2, E 3, E 6, E 7 } Not minimal! PS 2 PS 5, PS 4 PS 5 (or PS 4 PS 1 ), PS 6 PS 5 MPS: PS 1, PS 3, and PS 5 R. J. Rodríguez On Qualitative Analysis of Fault Trees Using Structurally Persistent Nets JCSD / 29
13 Introduction (IV) Recall the example... Six path sets: PS 1 = {E 1, E 2, E 3, E 4, E 5 } PS 2 = {E 1, E 2, E 3, E 5, E 6 } PS 3 = {E 1, E 2, E 3, E 5, E 7 } PS 4 = {E 1, E 2, E 3, E 4, E 5, E 6 } PS 5 = {E 1, E 2, E 3, E 6 } PS 6 = {E 1, E 2, E 3, E 6, E 7 } Not minimal! PS 2 PS 5, PS 4 PS 5 (or PS 4 PS 1 ), PS 6 PS 5 MPS: PS 1, PS 3, and PS 5 Five MCS: MCS 1 = {E 1 }, MCS 2 = {E 2 } MCS 3 = {E 3 }, MCS 4 = {E 5, E 6 } MCS 5 = {E 4, E 6, E 7 } R. J. Rodríguez On Qualitative Analysis of Fault Trees Using Structurally Persistent Nets JCSD / 29
14 Introduction (V) Fault Tree Assessment Qualitative analysis: extraction of MCS/MPS Enables to characterize a TE by a logic formula Quantitative analysis: for given data values, compute occurrence probability of the TE R. J. Rodríguez On Qualitative Analysis of Fault Trees Using Structurally Persistent Nets JCSD / 29
15 Introduction (V) Fault Tree Assessment Qualitative analysis: extraction of MCS/MPS Enables to characterize a TE by a logic formula Quantitative analysis: for given data values, compute occurrence probability of the TE Contributions Computation of MCS/MPS of a FT is equal to compute minimal p-semiflows of a Petri net, obtained by model transformation Minimal p-semiflows are computable in polynomial time (for the subclass of PN obtained) R. J. Rodríguez On Qualitative Analysis of Fault Trees Using Structurally Persistent Nets JCSD / 29
16 Agenda 1 Introduction 2 Definitions 3 Model Transformation 4 Fault Tree Analysis using P-Semiflows 5 Case Study: A Pressure Tank System 6 Related Work 7 Conclusions and Future Work R. J. Rodríguez On Qualitative Analysis of Fault Trees Using Structurally Persistent Nets JCSD / 29
17 Definitions (I) Formally defining a coherent Fault Tree Coherent fault tree F = E, G, G +, G, T, where: E, E 1: set of basic, undeveloped, or external events; G, G 1, G E = : set of intermediate events; G + : G (E G) {0, 1}: OR relationship between events G : G (E G) {0, 1}: AND relationship between events T = {g}, g G: top event R. J. Rodríguez On Qualitative Analysis of Fault Trees Using Structurally Persistent Nets JCSD / 29
18 Definitions (I) Formally defining a coherent Fault Tree Coherent fault tree F = E, G, G +, G, T, where: E, E 1: set of basic, undeveloped, or external events; G, G 1, G E = : set of intermediate events; G + : G (E G) {0, 1}: OR relationship between events G : G (E G) {0, 1}: AND relationship between events T = {g}, g G: top event Some notes... We denote G +, G, in matrix form, i.e., G +, G {0, 1} G ( E + G ) An event g G has only non-null components in either G + or G, and not both Self-feedback is not allowed in intermediate events R. J. Rodríguez On Qualitative Analysis of Fault Trees Using Structurally Persistent Nets JCSD / 29
19 Definitions (II) On Petri nets Petri nets A Petri net (PN) is a 4 tuple N = P, T, Pre, Post, where: P and T are disjoint non-empty sets of places and transitions; and Pre (Post) are the pre (post )incidence non-negative integer matrices of size P T R. J. Rodríguez On Qualitative Analysis of Fault Trees Using Structurally Persistent Nets JCSD / 29
20 Definitions (II) On Petri nets Petri nets A Petri net (PN) is a 4 tuple N = P, T, Pre, Post, where: P and T are disjoint non-empty sets of places and transitions; and Pre (Post) are the pre (post )incidence non-negative integer matrices of size P T A Petri net system S = N, m 0 is a Petri net N with an initial marking m 0 Reachability Set and Boundedness RS(N, m 0 ): set of markings reachable from m 0 in N A place p P is k bounded if m RS(N, m 0 ), m(p) k A net system S is k-bounded if each place is k-bounded A net system is bounded if some k for which it is k-bounded R. J. Rodríguez On Qualitative Analysis of Fault Trees Using Structurally Persistent Nets JCSD / 29
21 Definitions (IV) Identical and series places A place p is identical to a place p p if m 0 (p) = m 0 (p ), Pre(p, ) = Pre(p, ), and Post(p, ) = Post(p, ) Places p, p p, are series places if Pre(p, ) = Post(p, ) P-Semiflows y 0 such that y C = 0 Token conservation law independent of any firing of transitions Minimal p-semiflow: y = {i y(i) 0}, is not a proper superset of the support of any other p-semiflow, and the greatest common divisor of its elements is one Conservativeness: all places are covered by a p-semiflow R. J. Rodríguez On Qualitative Analysis of Fault Trees Using Structurally Persistent Nets JCSD / 29
22 Definitions (V) Transition conflicts Structural conflict: t t Effective conflict for a marking m: t, t in structural conflict and both enabled at m Persistent net For any reachable marking m and for all transitions t i, t j, t i t j, enabled in m, the sequence t i, t j is firable from m Structurally persistent net (SPN) When N, m 0 is persistent for all finite initial markings m 0 SPN are totally conflict-free, i.e., no pair of transitions is in structural or effective conflict. That is, p P, p 1 R. J. Rodríguez On Qualitative Analysis of Fault Trees Using Structurally Persistent Nets JCSD / 29
23 Agenda 1 Introduction 2 Definitions 3 Model Transformation 4 Fault Tree Analysis using P-Semiflows 5 Case Study: A Pressure Tank System 6 Related Work 7 Conclusions and Future Work R. J. Rodríguez On Qualitative Analysis of Fault Trees Using Structurally Persistent Nets JCSD / 29
24 Model Transformation: from a FT to a SPN N, m 0 P in N is divided into three disjoint sets P E, P G, P EG R. J. Rodríguez On Qualitative Analysis of Fault Trees Using Structurally Persistent Nets JCSD / 29
25 Model Transformation: from a FT to a SPN N, m 0 P in N is divided into three disjoint sets P E, P G, P EG Steps 1 Transform every event e E R. J. Rodríguez On Qualitative Analysis of Fault Trees Using Structurally Persistent Nets JCSD / 29
26 Model Transformation: from a FT to a SPN N, m 0 P in N is divided into three disjoint sets P E, P G, P EG Steps 1 Transform every event e E 2 Transform every event g G R. J. Rodríguez On Qualitative Analysis of Fault Trees Using Structurally Persistent Nets JCSD / 29
27 Model Transformation: from a FT to a SPN N, m 0 P in N is divided into three disjoint sets P E, P G, P EG Steps 1 Transform every event e E 2 Transform every event g G 3 Transform gate connections AND gate R. J. Rodríguez On Qualitative Analysis of Fault Trees Using Structurally Persistent Nets JCSD / 29
28 Model Transformation: from a FT to a SPN N, m 0 P in N is divided into three disjoint sets P E, P G, P EG Steps 1 Transform every event e E 2 Transform every event g G 3 Transform gate connections AND gate OR gate R. J. Rodríguez On Qualitative Analysis of Fault Trees Using Structurally Persistent Nets JCSD / 29
29 Model Transformation: from a FT to a SPN N, m 0 P in N is divided into three disjoint sets P E, P G, P EG Steps 1 Transform every event e E 2 Transform every event g G 3 Transform gate connections AND gate OR gate 4 Remove t g of place p g, g = T R. J. Rodríguez On Qualitative Analysis of Fault Trees Using Structurally Persistent Nets JCSD / 29
30 (b) Fusion of series places R. J. Rodríguez On Qualitative Analysis of Fault Trees Using Structurally Persistent Nets JCSD / 29 Model Transformation: from a FT to a SPN N, m 0 P in N is divided into three disjoint sets P E, P G, P EG Steps 1 Transform every event e E 2 Transform every event g G 3 Transform gate connections AND gate OR gate 4 Remove t g of place p g, g = T 5 Petri net reductions rules applied Elimination of identical places Fusion of series places (a) Elimination of identical places
31 Model Transformation: from a FT to a SPN N, m 0 P in N is divided into three disjoint sets P E, P G, P EG Steps 1 Transform every event e E 2 Transform every event g G 3 Transform gate connections AND gate OR gate 4 Remove t g of place p g, g = T 5 Petri net reductions rules applied Elimination of identical places Fusion of series places (a) Elimination of identical places Acyclic Bounded ( t T, t 1) (b) Fusion of series places R. J. Rodríguez On Qualitative Analysis of Fault Trees Using Structurally Persistent Nets JCSD / 29
32 Agenda 1 Introduction 2 Definitions 3 Model Transformation 4 Fault Tree Analysis using P-Semiflows 5 Case Study: A Pressure Tank System 6 Related Work 7 Conclusions and Future Work R. J. Rodríguez On Qualitative Analysis of Fault Trees Using Structurally Persistent Nets JCSD / 29
33 Starting at the top event, we can reach the basic events recursively... R. J. Rodríguez On Qualitative Analysis of Fault Trees Using Structurally Persistent Nets JCSD / 29 Fault Tree Analysis using P-Semiflows (I) FT-SPN S F = N, R, m 0 obtained by transformation Theorem An FT-SPN is conservative
34 Fault Tree Analysis using P-Semiflows (II) S F = N, R, m 0 obtained by transformation of F = E, G, G +, G, T Theorem The set of places p P E contained in the support of a minimal p-semiflow of N representing events e E defines a path set of F R. J. Rodríguez On Qualitative Analysis of Fault Trees Using Structurally Persistent Nets JCSD / 29
35 Fault Tree Analysis using P-Semiflows (III) Theorem A minimal p-semiflow y of a FT-SPN, after applying reduction rules, that includes p P E in its support, i.e., p y, can be computed by the following Linear Programming problem: maximize y(p) subject to y C = 0 y m 0 = 1 y 0 Proof. n Suppose that y = α i y i, α i > 0 i=1 R. J. Rodríguez On Qualitative Analysis of Fault Trees Using Structurally Persistent Nets JCSD / 29
36 Fault Tree Analysis using P-Semiflows (III) Theorem A minimal p-semiflow y of a FT-SPN, after applying reduction rules, that includes p P E in its support, i.e., p y, can be computed by the following Linear Programming problem: maximize y(p) subject to y C = 0 y m 0 = 1 y 0 Proof. Suppose that y = n α i y i, α i > 0 i=1 y m 0 = 1 n i=1 α i y i m 0 = α 1 y 1 m 0 + α 2 y 2 m α n y n m 0 = 1, α i > 0 R. J. Rodríguez On Qualitative Analysis of Fault Trees Using Structurally Persistent Nets JCSD / 29
37 Fault Tree Analysis using P-Semiflows (III) Theorem A minimal p-semiflow y of a FT-SPN, after applying reduction rules, that includes p P E in its support, i.e., p y, can be computed by the following Linear Programming problem: maximize y(p) subject to y C = 0 y m 0 = 1 y 0 Proof. Suppose that y = n α i y i, α i > 0 i=1 y m 0 = 1 n i=1 α i y i m 0 = α 1 y 1 m 0 + α 2 y 2 m α n y n m 0 = 1, α i > 0 m 0 (p) = 1, p P E, m 0 (p ) = 0, p P \ P E y i m 0 = y i (p), p P E, p y i α 1 y 1 (p) + α 2 y 2 (p) + + α n y n(p) = 1, α i > 0, where p P E, p y i, i = 1... n y > y i, y(p) for a given p P E, the value of y(p) is not maximum R. J. Rodríguez On Qualitative Analysis of Fault Trees Using Structurally Persistent Nets JCSD / 29
38 Fault Tree Analysis using P-Semiflows (IV) Corollary The computation of the minimal cut sets and minimal path sets of a coherent Fault Tree are solvable in polynomial time. R. J. Rodríguez On Qualitative Analysis of Fault Trees Using Structurally Persistent Nets JCSD / 29
39 Fault Tree Analysis using P-Semiflows (IV) Corollary The computation of the minimal cut sets and minimal path sets of a coherent Fault Tree are solvable in polynomial time. R. J. Rodríguez On Qualitative Analysis of Fault Trees Using Structurally Persistent Nets JCSD / 29
40 Agenda 1 Introduction 2 Definitions 3 Model Transformation 4 Fault Tree Analysis using P-Semiflows 5 Case Study: A Pressure Tank System 6 Related Work 7 Conclusions and Future Work R. J. Rodríguez On Qualitative Analysis of Fault Trees Using Structurally Persistent Nets JCSD / 29
41 Case Study: A Pressure Tank System (I) Relay K1 Switch S1 Relay K2 Timer relay Pressure switch Pressure sense line Outlet valve Fuse Pump motor Reservoir Pump Pressure tank Event Description Top Event Pressure tank rupture. E1 Pressure tank ruptures under load. E2 Tank ruptures due to improper installation. G1 Secondary failure of ruptured pressure tank. E3 Secondary failure of tank from some other out of tolerance conditions (e.g., mechanical, thermal). G2 K2 relay contacts remain closed for a time T > 60 seconds. E4 K2 relay contacts fail to open. E5 K2 relay secondary failure. G3 EMF to K2 relay coil for a time T > 60 seconds. G4 EMF remains on pressure switch (P/S) contacts when P/S contacts closed for a time T > 60 seconds. G5 P/S contacts closed, T > 60 seconds. G6 EMF through S1 switch contacts when P/S contacts closed, T > 60 seconds. G7 EMF through K1 relay contacts when P/S contacts closed, T > 60 seconds. E6 Pressure switch secondary failure. E7 Pressure switch contacts fail to open. E8 Excess pressure not sensed by pressure-activated switch. E9 S1 switch secondary failure. E10 S1 switch contacts fail to open. E11 External reset activation force remains on switch S1. E12 K1 relay contacts fail to open. E13 K1 relay secondary failure. G8 Timer relay contacts fail to open when P/S contacts closed, T > 60 seconds. E14 Timer does not timeout due to improper setting installation. E15 Timer relay contacts fail to open. E16 Timer relay secondary failure. R. J. Rodríguez On Qualitative Analysis of Fault Trees Using Structurally Persistent Nets JCSD / 29
42 Case Study: A Pressure Tank System (II) R. J. Rodríguez On Qualitative Analysis of Fault Trees Using Structurally Persistent Nets JCSD / 29
43 Case Study: A Pressure Tank System (II) R. J. Rodríguez On Qualitative Analysis of Fault Trees Using Structurally Persistent Nets JCSD / 29
44 Case Study: A Pressure Tank System (II) Place p Minimal p-semiflow MCS p E1 y1 = {p TopEvent, p E1 } {E1} p E2 y2 = {p TopEvent, p E2 } {E2} p E3 y3 = {p TopEvent, p G1, p E3} {E3} p E4 y4 = {p TopEvent, p G1, p G2, p E4} {E4} p E5 y5 = {p TopEvent, p G1, p G2, p E5} {E5} p E6 y6 = {p TopEvent, p G1, p G2, p G3, p G4, p G5, p E6, p G6, p E9} {E6, E9} p E7 y7 = {p TopEvent, p G1, p G2, p G3, p G4, p G5, p E7, p G6, p E9} {E7, E9} p E8 y8 = {p TopEvent, p G1, p G2, p G3, p G4, p G5, p E8, p G6, p E9} {E8, E9} p E9 y9 = y6 {E6, E9} p E10 y10 = {p TopEvent, p G1, p G2, p G3, p G4, p G5, p E6, p G6, p E10} {E6, E10} p E11 y11 = {p TopEvent, p G1, p G2, p G3, p G4, p G5, p E6, p G6, p E11} {E6, E11} p E12 y12 = {p TopEvent, p G1, p G2, p G3, p G4, p G5, p E6, p G7, p E12} {E6, E12} p E13 y13 = {p TopEvent, p G1, p G2, p G3, p G4, p G5, p E6, p G7, p E13} {E6, E13} p E14 y14 = {p TopEvent, p G1, p G2, p G3, p G4, p G5, p E6, p G7, p E14} {E6, E14} p E14 y15 = {p TopEvent, p G1, p G2, p G3, p G4, p G5, p E6, p G7, p E15} {E6, E15} p E16 y16 = {p TopEvent, p G1, p G2, p G3, p G4, p G5, p E6, p G7, p E16} {E6, E16} R. J. Rodríguez On Qualitative Analysis of Fault Trees Using Structurally Persistent Nets JCSD / 29
45 Case Study: A Pressure Tank System (II) Place p Minimal p-semiflow MCS p E1 y1 = {p TopEvent, p E1 } {E1} p E2 y2 = {p TopEvent, p E2 } {E2} p E3 y3 = {p TopEvent, p G1, p E3} {E3} p E4 y4 = {p TopEvent, p G1, p G2, p E4} {E4} p E5 y5 = {p TopEvent, p G1, p G2, p E5} {E5} p E6 y6 = {p TopEvent, p G1, p G2, p G3, p G4, p G5, p E6, p G6, p E9} {E6, E9} p E7 y7 = {p TopEvent, p G1, p G2, p G3, p G4, p G5, p E7, p G6, p E9} {E7, E9} p E8 y8 = {p TopEvent, p G1, p G2, p G3, p G4, p G5, p E8, p G6, p E9} {E8, E9} p E9 y9 = y6 {E6, E9} p E10 y10 = {p TopEvent, p G1, p G2, p G3, p G4, p G5, p E6, p G6, p E10} {E6, E10} p E11 y11 = {p TopEvent, p G1, p G2, p G3, p G4, p G5, p E6, p G6, p E11} {E6, E11} p E12 y12 = {p TopEvent, p G1, p G2, p G3, p G4, p G5, p E6, p G7, p E12} {E6, E12} p E13 y13 = {p TopEvent, p G1, p G2, p G3, p G4, p G5, p E6, p G7, p E13} {E6, E13} p E14 y14 = {p TopEvent, p G1, p G2, p G3, p G4, p G5, p E6, p G7, p E14} {E6, E14} p E14 y15 = {p TopEvent, p G1, p G2, p G3, p G4, p G5, p E6, p G7, p E15} {E6, E15} p E16 y16 = {p TopEvent, p G1, p G2, p G3, p G4, p G5, p E6, p G7, p E16} {E6, E16} y 1 ={p TopEvent, p G1, p G2, p G3, p G4, p G5, p E6 E 7 E 8, p G6, p E9 E 10 E 11 } y 2 ={p TopEvent, p G1, p G2, p G3, p G4, p G5, p E6 E 7 E 8, p G7, p G8, p E14 E 15 E 16 } y 3 ={p TopEvent, p G1, p G2, p G3, p G4, p G5, p E6 E 7 E 8, p G7, p E12 E 13 } y 4 ={p TopEvent, p G1, p G2, p E4 E 5 } y 5 ={p TopEvent, p G1, p E3 } y 6 ={p TopEvent, p E1 E 2 } MCS1 = {E6, E9} MCS11 = {E6, E15} MCS21 = {E7, E12} MCS2 = {E6, E10} MCS12 = {E6, E16} MCS22 = {E7, E13} MCS3 = {E6, E11} MCS13 = {E7, E14} MCS23 = {E8, E12} MCS4 = {E7, E9} MCS14 = {E7, E15} MCS24 = {E8, E13} MCS5 = {E7, E10} MCS15 = {E7, E16} MCS25 = {E4} MCS6 = {E7, E11} MCS16 = {E8, E14} MCS26 = {E5} MCS7 = {E8, E9} MCS17 = {E8, E15} MCS27 = {E3} MCS8 = {E8, E10} MCS18 = {E8, E16} MCS28 = {E1} MCS9 = {E8, E11} MCS19 = {E6, E12} MCS29 = {E2} MCS10 = {E6, E14} MCS20 = {E6, E13} TE occurrence formula: 29 MCS i i=1 R. J. Rodríguez On Qualitative Analysis of Fault Trees Using Structurally Persistent Nets JCSD / 29
46 Agenda 1 Introduction 2 Definitions 3 Model Transformation 4 Fault Tree Analysis using P-Semiflows 5 Case Study: A Pressure Tank System 6 Related Work 7 Conclusions and Future Work R. J. Rodríguez On Qualitative Analysis of Fault Trees Using Structurally Persistent Nets JCSD / 29
47 Related Work Computation of MCS/MPS is an NP-hard problem (in general) Two main approaches, depending on how the FT is analyzed Top-down Bottom-up MOCUS, CARA, DICOMICS, FATRAM, MICSUP... Other model transformation To Coloured PNs, or Reverse PNs: Reachability graph, reachability markings NP-hard problem, with exponential space requirements To Reliability Block Diagrams To BDDs Its computation may fail and does not avoid the exponential problem R. J. Rodríguez On Qualitative Analysis of Fault Trees Using Structurally Persistent Nets JCSD / 29
48 Agenda 1 Introduction 2 Definitions 3 Model Transformation 4 Fault Tree Analysis using P-Semiflows 5 Case Study: A Pressure Tank System 6 Related Work 7 Conclusions and Future Work R. J. Rodríguez On Qualitative Analysis of Fault Trees Using Structurally Persistent Nets JCSD / 29
49 Conclusions Computation of MCS/MPS of a coherent Fault Tree performed in linear time, by model transformation into a Petri net Constraints applied: Logic restricted to AND/OR formulae Only basic, undeveloped, external, and intermediate events considered R. J. Rodríguez On Qualitative Analysis of Fault Trees Using Structurally Persistent Nets JCSD / 29
50 Conclusions Computation of MCS/MPS of a coherent Fault Tree performed in linear time, by model transformation into a Petri net Constraints applied: Logic restricted to AND/OR formulae Only basic, undeveloped, external, and intermediate events considered Future work Implemented as module of PeabraiN tool (done!) Better characterize coherent FT whose MCS/MPS are solvable in polynomial time Compare to existing approaches Do the maths to avoid model transformation R. J. Rodríguez On Qualitative Analysis of Fault Trees Using Structurally Persistent Nets JCSD / 29
51 On Qualitative Analysis of Fault Trees Using Structurally Persistent Nets Ricardo J. Rodríguez Research Institute of Applied Sciences in Cybersecurity University of León, Spain June 10, 2015 XXIII Jornadas de Concurrencia y Sistemas Distribuidos Málaga (Spain) To appear in IEEE Trans. on Systems, Man, and Cybernetics: Systems doi: /TSMC
On Qualitative Analysis of Fault Trees Using Structurally Persistent Nets
SUBMITTED TO IEEE TRANSACTIONS ON SYSTEMS, MAN, AND CYBERNETICS: SYSTEMS 1 On Qualitative Analysis of Fault Trees Using Structurally Persistent Nets Ricardo J. Rodríguez Member, IEEE Abstract A Fault Tree
More informationAnalysis and Optimization of Discrete Event Systems using Petri Nets
Volume 113 No. 11 2017, 1 10 ISSN: 1311-8080 (printed version); ISSN: 1314-3395 (on-line version) url: http://www.ijpam.eu ijpam.eu Analysis and Optimization of Discrete Event Systems using Petri Nets
More informationStochastic Petri Net. Ben, Yue (Cindy) 2013/05/08
Stochastic Petri Net 2013/05/08 2 To study a formal model (personal view) Definition (and maybe history) Brief family tree: the branches and extensions Advantages and disadvantages for each Applications
More informationChapter 18 Section 8.5 Fault Trees Analysis (FTA) Don t get caught out on a limb of your fault tree.
Chapter 18 Section 8.5 Fault Trees Analysis (FTA) Don t get caught out on a limb of your fault tree. C. Ebeling, Intro to Reliability & Maintainability Engineering, 2 nd ed. Waveland Press, Inc. Copyright
More informationSafety and Reliability of Embedded Systems. (Sicherheit und Zuverlässigkeit eingebetteter Systeme) Fault Tree Analysis Obscurities and Open Issues
(Sicherheit und Zuverlässigkeit eingebetteter Systeme) Fault Tree Analysis Obscurities and Open Issues Content What are Events? Examples for Problematic Event Semantics Inhibit, Enabler / Conditioning
More informationCausal & Frequency Analysis
Causal & Frequency Analysis Arshad Ahmad arshad@utm.my Fishbone Diagram 2 The Cause and Effect (CE) Diagram (Ishikawa Fishbone) Created in 1943 by Professor Kaoru Ishikawa of Tokyo University Used to investigate
More informationRisk Analysis of Highly-integrated Systems
Risk Analysis of Highly-integrated Systems RA II: Methods (FTA, ETA) Fault Tree Analysis (FTA) Problem description It is not possible to analyse complicated, highly-reliable or novel systems as black box
More informationElementary Siphons of Petri Nets and Deadlock Control in FMS
Journal of Computer and Communications, 2015, 3, 1-12 Published Online July 2015 in SciRes. http://www.scirp.org/journal/jcc http://dx.doi.org/10.4236/jcc.2015.37001 Elementary Siphons of Petri Nets and
More information7. Queueing Systems. 8. Petri nets vs. State Automata
Petri Nets 1. Finite State Automata 2. Petri net notation and definition (no dynamics) 3. Introducing State: Petri net marking 4. Petri net dynamics 5. Capacity Constrained Petri nets 6. Petri net models
More informationReliability of Technical Systems
Reliability of Technical Systems Main Topics 1. Short Introduction, Reliability Parameters: Failure Rate, Failure Probability, etc. 2. Some Important Reliability Distributions 3. Component Reliability
More informationReliability of sequential systems using the causeconsequence diagram method
Loughborough University Institutional Repository Reliability of sequential systems using the causeconsequence diagram method This item was submitted to Loughborough University's Institutional Repository
More informationA REACHABLE THROUGHPUT UPPER BOUND FOR LIVE AND SAFE FREE CHOICE NETS VIA T-INVARIANTS
A REACHABLE THROUGHPUT UPPER BOUND FOR LIVE AND SAFE FREE CHOICE NETS VIA T-INVARIANTS Francesco Basile, Ciro Carbone, Pasquale Chiacchio Dipartimento di Ingegneria Elettrica e dell Informazione, Università
More information12 - The Tie Set Method
12 - The Tie Set Method Definitions: A tie set V is a set of components whose success results in system success, i.e. the presence of all components in any tie set connects the input to the output in the
More informationNONBLOCKING CONTROL OF PETRI NETS USING UNFOLDING. Alessandro Giua Xiaolan Xie
NONBLOCKING CONTROL OF PETRI NETS USING UNFOLDING Alessandro Giua Xiaolan Xie Dip. Ing. Elettrica ed Elettronica, U. di Cagliari, Italy. Email: giua@diee.unica.it INRIA/MACSI Team, ISGMP, U. de Metz, France.
More informationDES. 4. Petri Nets. Introduction. Different Classes of Petri Net. Petri net properties. Analysis of Petri net models
4. Petri Nets Introduction Different Classes of Petri Net Petri net properties Analysis of Petri net models 1 Petri Nets C.A Petri, TU Darmstadt, 1962 A mathematical and graphical modeling method. Describe
More informationTime(d) Petri Net. Serge Haddad. Petri Nets 2016, June 20th LSV ENS Cachan, Université Paris-Saclay & CNRS & INRIA
Time(d) Petri Net Serge Haddad LSV ENS Cachan, Université Paris-Saclay & CNRS & INRIA haddad@lsv.ens-cachan.fr Petri Nets 2016, June 20th 2016 1 Time and Petri Nets 2 Time Petri Net: Syntax and Semantic
More informationMethods for the specification and verification of business processes MPB (6 cfu, 295AA)
Methods for the specification and verification of business processes MPB (6 cfu, 295AA) Roberto Bruni http://www.di.unipi.it/~bruni 17 - Diagnosis for WF nets 1 Object We study suitable diagnosis techniques
More informationSafety and Reliability of Embedded Systems
(Sicherheit und Zuverlässigkeit eingebetteter Systeme) Fault Tree Analysis Mathematical Background and Algorithms Prof. Dr. Liggesmeyer, 0 Content Definitions of Terms Introduction to Combinatorics General
More informationSafety Analysis Using Petri Nets
Safety Analysis Using Petri Nets IEEE Transactions on Software Engineering (1987) Nancy G. Leveson and Janice L. Stolzy Park, Ji Hun 2010.06.21 Introduction Background Petri net Time petri net Contents
More information1. sort of tokens (e.g. indistinguishable (black), coloured, structured,...),
7. High Level Petri-Nets Definition 7.1 A Net Type is determined if the following specification is given: 1. sort of tokens (e.g. indistinguishable (black), coloured, structured,...), 2. sort of labeling
More informationMethods for the specification and verification of business processes MPB (6 cfu, 295AA)
Methods for the specification and verification of business processes MPB (6 cfu, 295AA) Roberto Bruni http://www.di.unipi.it/~bruni - Invariants Object We introduce two relevant kinds of invariants for
More informationApplications of Petri Nets
Applications of Petri Nets Presenter: Chung-Wei Lin 2010.10.28 Outline Revisiting Petri Nets Application 1: Software Syntheses Theory and Algorithm Application 2: Biological Networks Comprehensive Introduction
More informationSynchronizing sequences. on a class of unbounded systems using synchronized Petri nets
Synchronizing sequences 1 on a class of unbounded systems using synchronized Petri nets Marco Pocci, Isabel Demongodin, Norbert Giambiasi, Alessandro Giua Abstract Determining the state of a system when
More informationTime and Timed Petri Nets
Time and Timed Petri Nets Serge Haddad LSV ENS Cachan & CNRS & INRIA haddad@lsv.ens-cachan.fr DISC 11, June 9th 2011 1 Time and Petri Nets 2 Timed Models 3 Expressiveness 4 Analysis 1/36 Outline 1 Time
More informationMODELING AND SIMULATION BY HYBRID PETRI NETS. systems, communication systems, etc). Continuous Petri nets (in which the markings are real
Proceedings of the 2012 Winter Simulation Conference C. Laroque, J. Himmelspach, R. Pasupathy, O. Rose, and A. M. Uhrmacher, eds. MODELING AND SIMULATION BY HYBRID PETRI NETS Hassane Alla Latéfa Ghomri
More informationGeorg Frey ANALYSIS OF PETRI NET BASED CONTROL ALGORITHMS
Georg Frey ANALYSIS OF PETRI NET BASED CONTROL ALGORITHMS Proceedings SDPS, Fifth World Conference on Integrated Design and Process Technologies, IEEE International Conference on Systems Integration, Dallas,
More informationPetri Nets (for Planners)
Petri (for Planners) B. Bonet, P. Haslum... from various places... ICAPS 2011 & Motivation Petri (PNs) is formalism for modelling discrete event systems Developed by (and named after) C.A. Petri in 1960s
More informationbiological networks Claudine Chaouiya SBML Extention L3F meeting August
Campus de Luminy - Marseille - France Petri nets and qualitative modelling of biological networks Claudine Chaouiya chaouiya@igc.gulbenkian.pt chaouiya@tagc.univ-mrs.fr SML Extention L3F meeting 1-13 ugust
More informationCommunication in Petri nets
Communication in Petri nets Kamal Lodaya work in progress with Ramchandra Phawade The Institute of Mathematical Sciences, Chennai February 2010 Petri nets - introduction Mathematical model. Widely used
More informationReliability of Safety-Critical Systems 5.4 Petrinets
Reliability of Safety-Critical Systems 5.4 Petrinets Mary Ann Lundteigen and Marvin Rausand mary.a.lundteigen@ntnu.no &marvin.rausand@ntnu.no RAMS Group Department of Production and Quality Engineering
More informationUsing Shared-Resource Capacity for Robust Control of Failure-Prone Manufacturing Systems
IEEE TRANSACTIONS ON SYSTEMS, MAN, AND CYBERNETICS PART A: SYSTEMS AND HUMANS, VOL. 38, NO. 3, MAY 2008 605 Using Shared-Resource Capacity for Robust Control of Failure-Prone Manufacturing Systems Shengyong
More informationRELIABILITY ANALYSIS OF PISTON MANUFACTURING SYSTEM
Journal of Reliability and Statistical Studies; ISSN (Print): 0974-8024, (Online):2229-5666 Vol. 4, Issue 2 (2011): 43-55 RELIABILITY ANALYSIS OF PISTON MANUFACTURING SYSTEM Amit Kumar and Sneh Lata School
More informationSwitch Fabrics. Switching Technology S P. Raatikainen Switching Technology / 2004.
Switch Fabrics Switching Technology S38.65 http://www.netlab.hut.fi/opetus/s3865 L4 - Switch fabrics Basic concepts Time and space switching Two stage switches Three stage switches Cost criteria Multi-stage
More informationONE NOVEL COMPUTATIONALLY IMPROVED OPTIMAL CONTROL POLICY FOR DEADLOCK PROBLEMS OF FLEXIBLE MANUFACTURING SYSTEMS USING PETRI NETS
Proceedings of the IASTED International Conference Modelling, Identification and Control (AsiaMIC 2013) April 10-12, 2013 Phuket, Thailand ONE NOVEL COMPUTATIONALLY IMPROVED OPTIMAL CONTROL POLICY FOR
More informationMODELLING DYNAMIC RELIABILITY VIA FLUID PETRI NETS
MODELLING DYNAMIC RELIABILITY VIA FLUID PETRI NETS Daniele Codetta-Raiteri, Dipartimento di Informatica, Università di Torino, Italy Andrea Bobbio, Dipartimento di Informatica, Università del Piemonte
More informationSCOPE: A Situation Calculus Ontology of Petri Nets
SCOPE: A Situation Calculus Ontology of Petri Nets Xing TAN 1 Semantic Technologies Laboratory, Department of Mechanical and Industrial Engineering, University of Toronto Abstract. By axiomatizing the
More informationPROBABILISTIC AND POSSIBILISTIC FAULT TREE ANALYSIS
PROBABILISTIC AD POSSIBILISTIC FAULT TREE AALYSIS M. Ragheb 12/28/2017 ITRODUCTIO In the design of nuclear power plants, it is important to analyze the probable and possible mechanisms of failure. Fault
More informationPetri Net Modeling of Irrigation Canal Networks
Petri Net Modeling of Irrigation Canal Networks Giorgio Corriga, Alessandro Giua, Giampaolo Usai DIEE: Dip. di Ingegneria Elettrica ed Elettronica Università di Cagliari P.zza d Armi 09123 CAGLIARI, Italy
More informationRISK-INFORMED OPERATIONAL DECISION MANAGEMENT (RIODM): RISK, EVENT TREES AND FAULT TREES
22.38 PROBABILITY AND ITS APPLICATIONS TO RELIABILITY, QUALITY CONTROL AND RISK ASSESSMENT Fall 2005, Lecture 1 RISK-INFORMED OPERATIONAL DECISION MANAGEMENT (RIODM): RISK, EVENT TREES AND FAULT TREES
More informationNuclear reliability: system reliabilty
Nuclear reliability: system reliabilty Dr. Richard E. Turner (ret26@cam.ac.uk) December 3, 203 Goal of these two lectures failures are inevitable: need methods for characterising and quantifying them LAST
More informationResearch Article Research on Dynamic Reliability of a Jet Pipe Servo Valve Based on Generalized Stochastic Petri Nets
Aerospace Engineering Volume 2015, Article ID 171642, 8 pages http://dx.doi.org/10.55/2015/171642 Research Article Research on Dynamic Reliability of a Jet Pipe Servo Valve Based on Generalized Stochastic
More informationSafety analysis and standards Analyse de sécurité et normes Sicherheitsanalyse und Normen
Industrial Automation Automation Industrielle Industrielle Automation 9.6 Safety analysis and standards Analyse de sécurité et normes Sicherheitsanalyse und Normen Prof Dr. Hubert Kirrmann & Dr. B. Eschermann
More informationBinary Decision Diagrams
Binary Decision Diagrams Literature Some pointers: H.R. Andersen, An Introduction to Binary Decision Diagrams, Lecture notes, Department of Information Technology, IT University of Copenhagen Tools: URL:
More informationComplexity Analysis of Continuous Petri Nets
Fundamenta Informaticae 137 (2015) 1 28 1 DOI 10.3233/FI-2015-1167 IOS Press Complexity Analysis of Continuous Petri Nets Estíbaliz Fraca Instituto de Investigación en Ingeniería de Aragón (I3A) Universidad
More informationPreliminaries and Complexity Theory
Preliminaries and Complexity Theory Oleksandr Romanko CAS 746 - Advanced Topics in Combinatorial Optimization McMaster University, January 16, 2006 Introduction Book structure: 2 Part I Linear Algebra
More informationAssessing system reliability through binary decision diagrams using bayesian techniques.
Loughborough University Institutional Repository Assessing system reliability through binary decision diagrams using bayesian techniques. This item was submitted to Loughborough University's Institutional
More informationTime Petri Nets. Miriam Zia School of Computer Science McGill University
Time Petri Nets Miriam Zia School of Computer Science McGill University Timing Specifications Why is time introduced in Petri nets? To model interaction between activities taking into account their start
More informationFailures in Process Industries
Fault Tree Analysis Failures in Process Industries Single Component Failure Data for failure rates are compiled by industry Single component or single action Multiple Component Failure Failures resulting
More informationColoured Petri Nets Based Diagnosis on Causal Models
Coloured Petri Nets Based Diagnosis on Causal Models Soumia Mancer and Hammadi Bennoui Computer science department, LINFI Lab. University of Biskra, Algeria mancer.soumia@gmail.com, bennoui@gmail.com Abstract.
More informationc 2011 Nisha Somnath
c 2011 Nisha Somnath HIERARCHICAL SUPERVISORY CONTROL OF COMPLEX PETRI NETS BY NISHA SOMNATH THESIS Submitted in partial fulfillment of the requirements for the degree of Master of Science in Aerospace
More informationBasis Marking Representation of Petri Net Reachability Spaces and Its Application to the Reachability Problem
Basis Marking Representation of Petri Net Reachability Spaces and Its Application to the Reachability Problem Ziyue Ma, Yin Tong, Zhiwu Li, and Alessandro Giua June, 017 Abstract In this paper a compact
More informationMATHEMATICS (MIDDLE GRADES AND EARLY SECONDARY)
MATHEMATICS (MIDDLE GRADES AND EARLY SECONDARY) l. Content Domain Mathematical Processes and Number Sense Range of Competencies Approximate Percentage of Test Score 0001 0003 24% ll. Patterns, Algebra,
More informationResults on Equivalence, Boundedness, Liveness, and Covering Problems of BPP-Petri Nets
Results on Equivalence, Boundedness, Liveness, and Covering Problems of BPP-Petri Nets Ernst W. Mayr Jeremias Weihmann March 29, 2013 Abstract Yen proposed a construction for a semilinear representation
More informationADVANCED ROBOTICS. PLAN REPRESENTATION Generalized Stochastic Petri nets and Markov Decision Processes
ADVANCED ROBOTICS PLAN REPRESENTATION Generalized Stochastic Petri nets and Markov Decision Processes Pedro U. Lima Instituto Superior Técnico/Instituto de Sistemas e Robótica September 2009 Reviewed April
More informationStructural Analysis of Resource Allocation Systems with Synchronization Constraints
Structural Analysis of Resource Allocation Systems with Synchronization Constraints Spyros Reveliotis School of Industrial & Systems Engineering Georgia Institute of Technology Atlanta, GA 30332 USA Abstract
More informationSTRUCTURED SOLUTION OF STOCHASTIC DSSP SYSTEMS
STRUCTURED SOLUTION OF STOCHASTIC DSSP SYSTEMS J. Campos, S. Donatelli, and M. Silva Departamento de Informática e Ingeniería de Sistemas Centro Politécnico Superior, Universidad de Zaragoza jcampos,silva@posta.unizar.es
More informationHYPENS Manual. Fausto Sessego, Alessandro Giua, Carla Seatzu. February 7, 2008
HYPENS Manual Fausto Sessego, Alessandro Giua, Carla Seatzu February 7, 28 HYPENS is an open source tool to simulate timed discrete, continuous and hybrid Petri nets. It has been developed in Matlab to
More informationDISTINGUING NON-DETERMINISTIC TIMED FINITE STATE MACHINES
DISTINGUING NON-DETERMINISTIC TIMED FINITE STATE MACHINES Maxim Gromov 1, Khaled El-Fakih 2, Natalia Shabaldina 1, Nina Yevtushenko 1 1 Tomsk State University, 36 Lenin Str.. Tomsk, 634050, Russia gromov@sibmail.com,
More informationAdvanced topic: Space complexity
Advanced topic: Space complexity CSCI 3130 Formal Languages and Automata Theory Siu On CHAN Chinese University of Hong Kong Fall 2016 1/28 Review: time complexity We have looked at how long it takes to
More informationOn Controllability of Timed Continuous Petri Nets
On Controllability of Timed Continuous Petri Nets C Renato Vázquez 1, Antonio Ramírez 2, Laura Recalde 1, and Manuel Silva 1 1 Dep de Informática e Ingeniería de Sistemas, Centro Politécnico Superior,
More informationA Deadlock Prevention Policy for Flexible Manufacturing Systems Using Siphons
Proceedings of the 2001 IEEE International Conference on Robotics & Automation Seoul, Korea May 21-26, 2001 A Deadlock Prevention Policy for Flexible Manufacturing Systems Using Siphons YiSheng Huang 1
More informationc 2014 Vijayalakshmi Deverakonda
c 214 Vijayalakshmi Deverakonda DISJUNCTIVE NORMAL FORMULA BASED SUPERVISORY CONTROL POLICY FOR GENERAL PETRI NETS BY VIJAYALAKSHMI DEVERAKONDA THESIS Submitted in partial fulfillment of the requirements
More informationTHE simulation of a continuous or discrete time system
770 IEEE TRANSACTIONS ON SYSTEMS, MAN, AND CYBERNETICS PART B: CYBERNETICS, VOL. 28, NO. 6, DECEMBER 1998 Discrete Event Representation of Qualitative Models Using Petri Nets Alessandra Fanni, Member,
More informationLecture 5 Probability
Lecture 5 Probability Dr. V.G. Snell Nuclear Reactor Safety Course McMaster University vgs 1 Probability Basic Ideas P(A)/probability of event A 'lim n64 ( x n ) (1) (Axiom #1) 0 # P(A) #1 (1) (Axiom #2):
More informationModeling Continuous Systems Using Modified Petri Nets Model
Journal of Modeling & Simulation in Electrical & Electronics Engineering (MSEEE) 9 Modeling Continuous Systems Using Modified Petri Nets Model Abbas Dideban, Alireza Ahangarani Farahani, and Mohammad Razavi
More informationA Canonical Contraction for Safe Petri Nets
A Canonical Contraction for Safe Petri Nets Thomas Chatain and Stefan Haar INRIA & LSV (CNRS & ENS Cachan) 6, avenue du Président Wilson 935 CACHAN Cedex, France {chatain, haar}@lsvens-cachanfr Abstract
More informationProxel-Based Simulation of Stochastic Petri Nets Containing Immediate Transitions
Electronic Notes in Theoretical Computer Science Vol. 85 No. 4 (2003) URL: http://www.elsevier.nl/locate/entsc/volume85.html Proxel-Based Simulation of Stochastic Petri Nets Containing Immediate Transitions
More informationAnalysis and Simulation of Manufacturing Systems using SimHPN toolbox
Analysis and Simulation of Manufacturing Systems using SimHPN toolbox Jorge Júlvez, Cristian Mahulea, and Carlos-Renato Vázquez Abstract SimHP N is a software tool embedded in MAT- LAB that has been developed
More informationPolynomial Time Computation. Topics in Logic and Complexity Handout 2. Nondeterministic Polynomial Time. Succinct Certificates.
1 2 Topics in Logic and Complexity Handout 2 Anuj Dawar MPhil Advanced Computer Science, Lent 2010 Polynomial Time Computation P = TIME(n k ) k=1 The class of languages decidable in polynomial time. The
More informationDirect mapping of low-latency asynchronous
School of Electrical, Electronic & Computer Engineering Direct mapping of low-latency asynchronous controllers from STGs D.Sokolov, A.Bystrov, A.Yakovlev Technical Report Series NCL-EECE-MSD-TR-2006-110
More informationcachan.fr/publis/ Accepted for publication in Theoretical Computer Science
http://www.lsv.ens cachan.fr/publis/ Accepted for publication in Theoretical Computer Science A Polynomial -Bisimilar Normalization for Reset Petri Nets Catherine Dufourd y Alain Finkel y Abstract Reset
More informationModeling and Stability Analysis of a Communication Network System
Modeling and Stability Analysis of a Communication Network System Zvi Retchkiman Königsberg Instituto Politecnico Nacional e-mail: mzvi@cic.ipn.mx Abstract In this work, the modeling and stability problem
More informationSYNTHETIC TREE MODEL A FORMAL METHODOLOGY FOR FAULT TREE CONSTRUCTION A THESIS. Presented to. The Faculty of the Division of Graduate
In presenting the dissertation as a partial fulfillment of the requirements for an advanced degree from the Georgia Institute of Technology, I agree that the Library of the Institute shall make it available
More informationSleptsov Net Computing
International Humanitarian University http://mgu.edu.ua Sleptsov Net Computing Dmitry Zaitsev http://member.acm.org/~daze Write Programs or Draw Programs? Flow charts Process Charts, Frank and Lillian
More informationPetri nets. s 1 s 2. s 3 s 4. directed arcs.
Petri nets Petri nets Petri nets are a basic model of parallel and distributed systems (named after Carl Adam Petri). The basic idea is to describe state changes in a system with transitions. @ @R s 1
More informationPETRI NET MODELING OF FAULT ANALYSIS FOR PROBABILISTIC RISK ASSESSMENT. Andrew Lee
PETRI NET MODELING OF FAULT ANALYSIS FOR PROBABILISTIC RISK ASSESSMENT By Andrew Lee A Thesis Submitted in Partial Fulfillment of the Requirements for the Master of Applied Science in The Faculty of Energy
More informationCONTROL AND DEADLOCK RECOVERY OF TIMED PETRI NETS USING OBSERVERS
5 e Conférence Francophone de MOdélisation et SIMulation Modélisation et simulation pour l analyse et l optimisation des systèmes industriels et logistiques MOSIM 04 du 1 er au 3 septembre 2004 - Nantes
More informationA Structure Causality Relation for Liveness Characterisation in Petri Nets
Journal of Universal Computer Science, vol. 12, no. 2 (2006), 214-232 submitted: 4/10/04, accepted: 9/5/05, appeared: 28/2/06 J.UCS A Structure Causality Relation for Liveness Characterisation in Petri
More informationModule No. # 03 Lecture No. # 11 Probabilistic risk analysis
Health, Safety and Environmental Management in Petroleum and offshore Engineering Prof. Dr. Srinivasan Chandrasekaran Department of Ocean Engineering Indian Institute of Technology, Madras Module No. #
More informationImproving the Efficiency of Dynamic Fault Tree Analysis by Considering Gate FDEP as Static
Improving the Efficiency of Dynamic Fault Tree Analysis by Considering Gate FDEP as Static Guillaume Merle, Jean-Marc Roussel, Jean-Jacques Lesage To cite this version: Guillaume Merle, Jean-Marc Roussel,
More informationQuantitative evaluation of Dependability
Quantitative evaluation of Dependability 1 Quantitative evaluation of Dependability Faults are the cause of errors and failures. Does the arrival time of faults fit a probability distribution? If so, what
More informationA Review of Petri Net Modeling of Dynamical Systems
A Review of Petri Net Modeling of Dynamical Systems Arundhati Lenka S.O.A University,Bhubaneswar l_arundhati@yahoo.co.in Contact-+91-9861058591 Dr.Chakradhar Das S.I.E.T College,Dhenkanal dashchakradhar@gmail.com
More informationTESTING is one of the most important parts of the
IEEE TRANSACTIONS 1 Generating Complete Controllable Test Suites for Distributed Testing Robert M. Hierons, Senior Member, IEEE Abstract A test suite is m-complete for finite state machine (FSM) M if it
More informationSpecification models and their analysis Petri Nets
Specification models and their analysis Petri Nets Kai Lampka December 10, 2010 1 30 Part I Petri Nets Basics Petri Nets Introduction A Petri Net (PN) is a weighted(?), bipartite(?) digraph(?) invented
More informationIntegrated Fault Diagnosis Based on Petri Net Models
16th IEEE International Conference on Control Applications Part of IEEE Multi-conference on Systems and Control Singapore, 1-3 October 2007 TuC05.3 Integrated Fault Diagnosis Based on Petri Net Models
More informationLinear programming techniques for analysis and control of batches Petri nets
Linear programming techniques for analysis and control of batches Petri nets Isabel Demongodin, LSIS, Univ. of Aix-Marseille, France (isabel.demongodin@lsis.org) Alessandro Giua DIEE, Univ. of Cagliari,
More informationICS141: Discrete Mathematics for Computer Science I
ICS141: Discrete Mathematics for Computer Science I Dept. Information & Computer Sci., Jan Stelovsky based on slides by Dr. Baek and Dr. Still Originals by Dr. M. P. Frank and Dr. J.L. Gross Provided by
More informationAnalysis methods for fault trees that contain secondary failures
Loughborough University Institutional Repository Analysis methods for fault trees that contain secondary failures This item was submitted to Loughborough University's Institutional Repository by the/an
More informationQuantitative Reliability Analysis
Quantitative Reliability Analysis Moosung Jae May 4, 2015 System Reliability Analysis System reliability analysis is conducted in terms of probabilities The probabilities of events can be modelled as logical
More informationMiller Objectives Alignment Math
Miller Objectives Alignment Math 1050 1 College Algebra Course Objectives Spring Semester 2016 1. Use algebraic methods to solve a variety of problems involving exponential, logarithmic, polynomial, and
More informationPerformance Control of Markovian Petri Nets via Fluid Models: A Stock-Level Control Example
Performance Control of Markovian Petri Nets via Fluid Models: A Stock-Level Control Example C. Renato Vázquez Manuel Silva Abstract Petri nets is a well-know formalism for studying discrete event systems.
More informationChapter 5. System Reliability and Reliability Prediction.
Chapter 5. System Reliability and Reliability Prediction. Problems & Solutions. Problem 1. Estimate the individual part failure rate given a base failure rate of 0.0333 failure/hour, a quality factor of
More informationCycle Time Analysis for Wafer Revisiting Process in Scheduling of Single-arm Cluster Tools
International Journal of Automation and Computing 8(4), November 2011, 437-444 DOI: 10.1007/s11633-011-0601-5 Cycle Time Analysis for Wafer Revisiting Process in Scheduling of Single-arm Cluster Tools
More informationPotential reachability in commutative nets
Potential reachability in commutative nets Christoph Schneider 1, Joachim Wehler 2 6. Workshop Algorithmen und Werkzeuge für Petrinetze, Frankfurt/Main 1999 Abstract. Potential reachability is a question
More informationActive Fault Diagnosis for Uncertain Systems
Active Fault Diagnosis for Uncertain Systems Davide M. Raimondo 1 Joseph K. Scott 2, Richard D. Braatz 2, Roberto Marseglia 1, Lalo Magni 1, Rolf Findeisen 3 1 Identification and Control of Dynamic Systems
More informationReliability Analysis of Hydraulic Steering System with DICLFL Considering Shutdown Correlation Based on GO Methodology
2015 ICRSE&PHM-Beijing Reliability Analysis of Hydraulic Steering System with DICLFL Considering Shutdown Correlation Based on GO Methodology YI Xiaojian, SHI Jian, MU Huina, DONG Haiping, GUO Shaowei
More informationDynamic Fault Tree Analysis Based On The Structure Function
Author manuscript, published in "Annual Reliability and Maintainability Symposium 2011 (RAMS 2011), Orlando, FL : United States (2011)" Dynamic Fault Tree Analysis Based On The Structure Function Guillaume
More informationcse303 ELEMENTS OF THE THEORY OF COMPUTATION Professor Anita Wasilewska
cse303 ELEMENTS OF THE THEORY OF COMPUTATION Professor Anita Wasilewska LECTURE 1 Course Web Page www3.cs.stonybrook.edu/ cse303 The webpage contains: lectures notes slides; very detailed solutions to
More informationof an algorithm for automated cause-consequence diagram construction.
Loughborough University Institutional Repository Development of an algorithm for automated cause-consequence diagram construction. This item was submitted to Loughborough University's Institutional Repository
More informationThe Applications of Inductive Method in the Construction of Fault Trees MENG Qinghe 1,a, SUN Qin 2,b
The Applications of Inductive Method in the Construction of Fault Trees MENG Qinghe 1,a, SUN Qin 2,b 1 School of Aeronautics, Northwestern Polytechnical University, Xi an 710072, China 2 School of Aeronautics,
More information