Dynamic properties characterize the behaviour of individual CP-nets, eg, whether it is
possible to reach a marking in which no step is enabled. It is often rather difficult to verify …

The Generalized Nets (GNs) are extensions of Petri nets and of different Petri nets
modifications, introduced by the author (1982). In the book, definitions and the basic …

and ABSTRACT L1near Algebraic Techn1gues for Place/Trans1t1on Nets Kurt Lautenbach
Un1versity of Bonn Dept. of Computer Science Page 1 and ABSTRACT L1near Algebraic …

K. Voss et al. (eds.), Concurrency and Nets © Springer-Verlag Berlin Heidelberg 1987 Page 1
and Linear Algebraic Calculation of Deadlocks and Traps Kurt Lautenbach University of Bonn …

The class of Petri nets obtained by eliminating timing from generalized stochastic Petri net
(GSPN) models while preserving the qualitative behavior is identified. Structural results for …

We present a set of transformations of place/transition systems which preserve several
classical properties of nets namely boundedness, deadlock freeness, liveness and covering …

Rough set approach to reasoning under uncertainty is based on inducing knowledge
representation from data under constraints expressed by discernibility or, more generally …

Abstract Structure theory asks whether a relationship can be found between the behaviour of
a marked net and the structure of the underlying unmarked net. From the rich body of …

The theory of Petri nets is a part of computer science whose importance is increasingly
acknowledged. Many papers and anthologies, whose subject matter is net theory and its …

After various attempts, an equivalence relation is defined for labelled Petri nets, on the base
of the concurrency semantics of net theory. This relation, called Fully Concurrent …