Improving explicit model checking for Petri nets

Model checking is the automated verification that systematically checks if a given behavioral property holds for a given model of a system. We use Petri nets and temporal logic as formalisms to describe a system and its behavior in a mathematically precise and unambiguous manner. The contributions of this thesis are concerned with the improvement of model checking efficiency both in theory and in practice. We present two new reduction techniques and several supplementary strength reduction techniques. The thesis also enhances partial order reduction for certain temporal logic classes

Supporting Domain-Specific State Space Reductions through Local Partial-Order Reduction

Model checkers offer to automatically prove safety and liveness properties of complex concurrent software systems, but they are limited by state space explosion. Partial-Order Reduction (POR) is an effective technique to mitigate this burden. However, applying existing notions of POR requires to verify conditions based on execution paths of unbounded length, a difficult task in general. To enable a more intuitive and still flexible application of POR, we propose local POR (LPOR). LPOR is based on the existing notion of statically computed stubborn sets, but its locality allows to verify conditions in single states rather than over long paths. As a case study, we apply LPOR to message-passing systems. We implement it within the Java Pathfinder model checker using our general Java-based LPOR library. Our experiments show significant reductions achieved by LPOR for model checking representative message-passing protocols and, maybe surprisingly, that LPOR can outperform dynamic POR. © 2011 IEEE

Dynamical Phase Transitions in Graph Cellular Automata

Discrete dynamical systems can exhibit complex behaviour from the iterative application of straightforward local rules. A famous example are cellular automata whose global dynamics are notoriously challenging to analyze. To address this, we relax the regular connectivity grid of cellular automata to a random graph, which gives the class of graph cellular automata. Using the dynamical cavity method (DCM) and its backtracking version (BDCM), we show that this relaxation allows us to derive asymptotically exact analytical results on the global dynamics of these systems on sparse random graphs. Concretely, we showcase the results on a specific subclass of graph cellular automata with ``conforming non-conformist'' update rules, which exhibit dynamics akin to opinion formation. Such rules update a node's state according to the majority within their own neighbourhood. In cases where the majority leads only by a small margin over the minority, nodes may exhibit non-conformist behaviour. Instead of following the majority, they either maintain their own state, switch it, or follow the minority. For configurations with different initial biases towards one state we identify sharp dynamical phase transitions in terms of the convergence speed and attractor types. From the perspective of opinion dynamics this answers when consensus will emerge and when two opinions coexist almost indefinitely.Comment: 15 page

Trapping ACO applied to MRI of the Heart

The research presented here supports the ongoing need for automatic heart volume calculation through the identification of the left and right ventricles in MRI images. The need for automated heart volume calculation stems from the amount of time it takes to manually processes MRI images and required esoteric skill set. There are several methods for region detection such as Deep Neural Networks, Support Vector Machines and Ant Colony Optimization. In this research Ant Colony Optimization (ACO) will be the method of choice due to its efficiency and flexibility. There are many types of ACO algorithms using a variety of heuristics that provide advantages in different environments and knowledge domains. All ACO algorithms share a foundational attribute, a heuristic that acts in conjunction with pheromones. These heuristics can work in various ways, such as dictating dispersion or the interpretation of pheromones. In this research a novel heuristic to disperse and act on pheromone is presented. Further, ants are applied to more general problem than the normal objective of finding edges, highly qualified region detection. The reliable application of heuristic oriented algorithms is difficult in a diverse environment. Although the problem space here is limited to MRI images of the heart, there are significant difference among them: the topology of the heart is different by patient, the angle of the scans changes and the location of the heart is not known. A thorough experiment is conducted to support algorithm efficacy using randomized sampling with human subjects. It will be shown during the analysis the algorithm has both prediction power and robustness