I challenge the traditional choice of topics and the usual style of presentation for introductory courses on Petri nets. For such a course I suggest a number of aspects that usually are not considered fundamental. This includes faithful models, a slight revision of formalisms and terminology, specific techniques to increase the expressive power of Petri net models, aspects derived from distribu...

Whether a real system is approximated in a discrete or continuous simulation model depends on the more predominating type of variables determining the system’s behavior over time. If both discretely and continuously changing variables have to be considered, hybrid simulation techniques have to be applied, where discrete events have an influence on the otherwise continuously changing system stat...

Building smart grid for power system is a major challenge for safe, automated and energy efficient usage of electricity. The full implementation of the smart grid will evolve over time. However, before a new set of infrastructures are invested to build the smart grid, proper modeling and analysis is needed to avoid wastage of resources. Modeling also helps to identify and prioritize appropriate...

Most information systems that are driven by process models (e.g., workflow management systems) record events in event logs, also known as transaction logs or audit trails. We consider processes that not only keep track of their history in a log, but also make decisions based on this log. To model such processes we extend the basic Petri net framework with the notion of history and add guards to...

In this paper we present token flow based synthesis of bounded Petri nets from labelled prime event structures (LPES) associated with a cutting context. For this purpose we use unfolding semantics based on token flows. Given an infinite LPES represented by some finite prefix equipped with a cutting context and cut-off events it is shown how to synthesize a bounded Petri net, such that the unfol...

Petri nets in which random firing delays are associated with transitions whose firing is a n atomic opemtion are known under the name "stochastic Petri nets". These models are discussed, with the purpose of ezplaining why they were proposed in the performance evaluation field, why random delays with negative ezponential probability density functions are mainly used, and what are their strong an...

We present several interpretations of the behavior of P/T nets in terms of traces, event structures, and partial orders. Starting from results of Hoogers, Kleijn and Thiagarajan, we show how Petri nets determine local trace languages; these may be represented by local event structures in many ways, each method leading to a particular coreflection. One of these semantics is finally proved to be ...

Most information systems that are driven by process models (e.g., workflow management systems) record events in event logs, also known as transaction logs or audit trails. We consider processes that not only keep track of their history in a log, but also make decisions based on this log. To model such processes we extend the basic Petri net framework with the notion of history and add guards to...

There has been relatively little work on formal analysis of expressiveness and verification of structural, behavioural and temporal properties in clinical workflow. In this paper we discuss Coloured Petri nets (CPNs) as a formalism to support such analysis. We show in detail how a typical clinical guideline language (PROforma) may be formally mapped to a CPN representation, then show how such a...

Stubborn sets and model unfolding are two well-known methods for sidestepping the complexity of state-space exploration based on formal models of concurrent programs, such as Labeled Transition Systems and Petri nets. Here we define a deadlock detection strategy that combines these two methods. We also show that the resulting method, stubborn unfoldings, can produce smaller state space represen...