Aurorisk FR

Chapter 1 · Lesson 1.3

Overview of dynamic models

Four main families of models deal with time, order and dependencies. They complement each other more than they exclude each other.

Dynamic fault trees

They keep the tree reading and add gates that express dynamics (Dugan and his colleagues proposed them in the early 1990s):

They are readable for an engineer used to trees, but their exact calculation generally goes through an underlying Markov chain.

Markov chains

The system is described by a set of states (pumps running, failed, under repair) and transition rates between states. If the rates are constant (exponential durations), the calculation is exact: availability, reliability, mean time to failure. Limitation: the number of states grows very quickly with the number of components. This is chapter 2.

Petri nets

They describe the system with places (conditions), transitions (events) and tokens (resources, states). They naturally represent concurrency (the shared repairer), queues and sequences. Stochastic Petri nets, whose transitions have random durations, reduce to a Markov chain when the durations are exponential. This is chapter 3.

Monte Carlo simulation

The model is run thousands of times by drawing durations at random, then the quantities sought are estimated by averages. There is no restriction on the distributions or the size, but the result is an estimate with an uncertainty, and very rare events are costly to estimate. It is the method of last resort, and often of checking.

A few mentions

Richer formalisms exist: BDMPs (Boolean logic Driven Markov Processes) combine the tree reading and Markov dynamics, and the AltaRica language describes systems made of components and flows. They rely on specialised tools whose names, licences and versions change: check them before any choice for a project.

ModelWhat it represents wellResultMain limitation
Dynamic treeOrder, standby, dependency, while keeping the shape of a treeExact or approximateCalculation often via Markov
Markov chainStates, repair, standby, testsExactState explosion; constant rates
Petri netShared resources, sequences, queuesExact (reachability) or simulatedReadability of a large net
Monte CarloEverything, including arbitrary distributionsEstimated with uncertaintyRare events, computing time
Key takeaway

Dynamic trees, Markov chains, Petri nets and simulation respond to the limits of static trees. The first keep the reading of a tree, the second give an exact result when the rates are constant, the third describe shared resources well, and simulation handles all cases at the price of an uncertainty.