An improvement of McMillan's unfolding algorithm

Abstract

McMillan has recently proposed a new technique to avoid the state explosion problem in the verification of systems modelled with finite-state Petri nets. The technique requires to construct a finite initial part of the unfolding of the net. McMillan's algorithm for this task may yield initial parts that are larger than necessary (exponentially larger in the worst case). We present a refinement of the algorithm which overcomes this problem.

Efficient Contextual Unfolding

“…-We generalise the results in [3,2] in order to deal with a slight generalization of the adequate orders from [7]. Although not very surprising, this extension is quite relevant in practice as it drastically reduces the resulting prefixes.…”

Symbolic Unfoldings for Networks of Timed Automata

“…The analysis of distributed or concurrent finite state systems has been dramatically improved thanks to partial-order methods (see e.g. [21]) that take advantage of the independence between actions, and to the unfolding based methods [11,16] that improve the partial order methods by taking advantage of the locality of actions.…”

The Implementation of Mazurkiewicz Traces in POEM

“…POEM (Partial Order Environment of Marseille) is a new model checking tool (framework) that has a strong emphasis on Partial Order Methods [17,8,15,9,12,16,7,13,11]. The motivation for adding POEM to the world of model checkers is based on the authors work on algorithms that have a common basis concerning concurrency, but which are not reflected in a single existing tool.…”