In this paper we use partial order semantics to express the truly concurrent behaviour of interval-timed Petri nets (ITPNs) in their most general setting, i.e. with autoconcurrency and zero duration, as studied with its standard maximal step semantics in [8]. First we introduce the notion of timed processes for ITPNs inductively. Then we investigate if the equivalence of inductive and axiomatic...

Asynchronously communicating pushdown systems (ACPS) that satisfy the empty-stack constraint (a pushdown process may receive only when its stack is empty) are a popular decidable model for recursive programs with asynchronous atomic procedure calls. We study a relaxation of the empty-stack constraint for ACPS that permits concurrency and communication actions at any stack height, called the sha...

process mining includes the automated discovery of petri nets from event logs. these event logs are the starting point for various discovery and analysis techniques of the process.  in this paper process model is developed using colored petri nets (cpns) and the supporting software package cpn tools. the restaurant process model is represented for the analysis using a combination of process min...

Resources are defined as submultisets of Petri net markings. Two resources are called similar if replacing one of them by another in any marking doesn’t change the Petri net’s behavior. We define the relations of resource similarity and resource bisimulation and show that they are finitely based. In this paper the resource bisimulation is studied for different classes of Petri nets: ordinary Pe...

In the area of Petri nets, many diierent developments have taken place within the last 30 years, in academia as well as in practice. For an adequate use in practice, a coherent and application oriented combination of various types and techniques for Petri nets is necessary. In order to attain a formal basis for diierent classes of Petri nets we introduce the concept of abstract Petri nets. The ...