#### Filter Results:

- Full text PDF available (62)

#### Publication Year

1964

2017

- This year (1)
- Last 5 years (18)
- Last 10 years (38)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Javier Esparza, Stefan Römer, Walter Vogler
- Formal Methods in System Design
- 1996

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)

- Walter Vogler
- Lecture Notes in Computer Science
- 1992

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)

- Walter Vogler, Alexei L. Semenov, Alexandre Yakovlev
- CONCUR
- 1998

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)

- Victor Khomenko, Maciej Koutny, Walter Vogler
- Acta Informatica
- 2002

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)

- Arend Rensink, Walter Vogler
- Inf. Comput.
- 1995

<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)

- Gerald Lüttgen, Walter Vogler
- Inf. Comput.
- 2007

This paper provides new insight into the connection between the trace-based lower part of van Glabbeek’s linear-time, branchingtime spectrum and its simulation-based upper part. We establish that ready simulation is fully abstract with respect to failures inclusion, when adding the conjunction operator that was proposed by the authors in [TCS… (More)

- Walter Vogler
- Distributed Computing
- 1990

In this paper concurrent systems are modelled with safe Petri nets. The coarsest equivalence contained in failures equivalence is determined that is a congruence with respect to refinement. It is shown that in this context partial orders are necessary for the description of system runs: what is needed here are so-called interval orders.

- Walter Vogler
- ICALP
- 1991

- Gerald Lüttgen, Walter Vogler
- Theor. Comput. Sci.
- 2006

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)

- Walter Vogler
- STACS
- 1991