We present a new approach to partial-order reduction for model checking software. This
approach is based on initially exploring an arbitrary interleaving of the various concurrent …

Model checking is a prominent technique used in the hardware and software industries for
automatic verification. While it is very successful in finding subtle bugs in distributed …

This research proposes an automatic strategy for planning a team of identical robots
evolving in a known environment. The robots should satisfy a global task for the whole team …

Offers an integrated presentation for path planning and motion control of cooperative mobile
robots using discrete-event system principles Generating feasible paths or routes between a …

We consider the problems of identifying LTL safety properties and translating them to finite
automata. We present an algorithm for constructing finite automata recognising informative …

A contextual net is a Petri net extended with read arcs, which allows transitions to check for
tokens without consuming them. Contextual nets allow for better modelling of concurrent …

Event stream processing (ESP) is the application of a computation to a set of input
sequences of arbitrary data objects, called" events", in order to produce other sequences of …

We introduce a divide-and-conquer algorithm for a modified version of the reachability/
coverability problem in 1-bounded Petri nets that relies on the compositional algebra of nets …

The research in this thesis focuses on different techniques which can improve efficiency of
the symbolic analysis of Petri nets. Reduced ordered interval decision diagrams (ROIDDs) …

The reachability problem for vector addition systems is a central problem of net theory. This
problem is known to be decidable but the complexity is still unknown. Whereas the problem …