Harro Wimmel

Learn More
We propose a reachability verification technique that combines the Petri net state equation (a linear algebraic overapproximation of the set of reachable states) with the concept of counterexample guided abstraction refinement. In essence, we replace the search through the set of reachable states by a search through the space of solutions of the state(More)
We show that the downward-closure of a Petri net language is effectively computable. This is mainly done by using the notions defined for showing decidability of the reachability problem of Petri nets. In particular, we rely on Lambert’s construction of marked graph transition sequences — special instances of coverability graphs that allow us to extract(More)
This paper continues a research on universal contexts and semantics for Petri nets started by Nielsen, Priese and Sassone (1995). We consider generalized, labelled Petri nets N where some transitions and places are distinguished as public. They form the interface of N that may communicate with a Petri net context. An elementary calculus, 8, is introduced in(More)
This article presents the results of the Model Checking Contest held within the SUMo 2011 workshop, a satellite event of Petri Nets 2011. This contest aimed at a fair and experimental evaluation of the performances of model checking techniques applied to Petri nets. The participating tools were compared on several examinations (state space generation,(More)
This paper continues a research on universal contexts and Petri net semantics started in NPS95]. We regard generalized, labelled Petri nets, N, where some transitions and places are distinguished as`public'. They form the interface of N that may communicate with a Petri net context. An elementary calculus, E, is introduced that allows to construct any Petri(More)