Shortest Path Search in Dynamic Reliability Space: Hierarchical Coloured Petri Nets Model and Application to a Pipeline Network

His work proposes a hierarchical Coloured Petri Nets (CPN) model for finding the most reliable path in an oil pipeline network. A path is achieved with the opening of valves along it linking the pipes and with the closing of the adjacent ones to isolate it from the rest of the pipeline network. This work has two goals: firstly to calculate the dynamic reliability of the valves engaged to open (openers) and to close (closers) in the path´s search according to their behavior, and secondly to find an optimal path in the reliability space using Dijkstra´s algorithm. Real operational constraints and goals in the seaport are modeled with data extracted from OREDA Database. The results underline how the proposed solution leads to a safer use of the network by avoiding the riskiest valves.