Walter Vogler

Learn More
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(More)
When writing can change your life, when writing can enrich you by offering much money, why don't you try it? Are you still very confused of where getting the ideas? Do you still have no idea with what you are going to write? Now, you will need reading. A good writer is a good reader at once. You can define how you write depending on what books to read. This(More)
Petri nets with read arcs are investigated with respect to their unfolding, where read arcs model reading without consuming, which is often more adequate than the destructive-read-and-rewrite modelled with loops in ordinary nets. The paper redeenes the concepts of a branching process and unfolding for nets with read arcs and proves that the set of reachable(More)
In this paper, we develop a general technique for truncating Petri net unfoldings, parameterized according to the level of information about the original unfolding one wants to preserve. Moreover, we propose a new notion of completeness of a truncated unfolding. A key aspect of our approach is an algorithm-independent notion of cut-off events, used to(More)
<lb>In this paper we present a solution to the long-standing problem of characterising the coars-<lb>est liveness-preserving pre-congruence with respect to a full (TCSP-inspired) process algebra.<lb>In fact, we present two distinct characterisations, which give rise to the same relation: an op-<lb>erational one based on a De Nicola-Hennessy-like testing(More)
A key problem in mixing operational (e.g., process-algebraic) and declarative (e.g., logical) styles of specification is how to deal with inconsistencies arising when composing processes under conjunction. This article introduces a conjunction operator on labelled transition systems capturing the basic intuition of “a and b = false”, and considers a naive(More)