The complexity of embedded systems is increasing rapidly. In consequence, new verification techniques that overcome the limitations of traditional methods and are suitable for har...
Abstract. In [12] we started a research on a distributed-timed extension of Petri nets where time parameters are associated with tokens and arcs carry constraints that qualify the ...
Abstract. We study the expressiveness of the join calculus by comparison with (generalised, coloured) Petri nets and using tools from type theory. More precisely, we consider four ...
Abstract. In this paper we discuss the role of labels in transition systems with regard to bisimilarity and model checking problems. We suggest a general reduction from labelled tr...
In order to model the behaviour of open concurrent systems by means of Petri nets, we introduce open Petri nets, a generalization of the ordinary model where some places, designate...
Paolo Baldan, Andrea Corradini, Hartmut Ehrig, Rei...
The increasing number of Petri net variants naturally leads to the question whether the term “Petri net” is more than a common name for very different concepts. This contribut...
In this paper we define partial order semantics of types of nets. Types of nets are a parametric definition of Petri nets originally developed for a general presentation of the s...
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...
The unfolding technique is an efficient tool to explore the runs of a Petri net in a true concurrency semantics, i.e. without constructing all the interleavings of concurrent actio...
A composite multimedia object has specific timing relationships among the different types of component media. Coordinating the real-time presentation of information and maintaini...