Colored Petri Nets (CPN) is a graphical language, which is extensively used for modeling and analysis of distributed systems with elements of concurrency. It has proven to be a good platform for modeling of process-aware information systems, workflow analysis, design of communication protocols

We present a new class of Petri Nets, called Extended Simple Colored Petri Nets (ESCP-nets), which are essentially Simple Colored Petri Nets (SCP-nets) with three added features: first, there is a built-in type of real numbers; second, tokens can be forced to wait in places; third, an interface

Earth moving operations can be represented as Discrete Events Systems (DES), which propitiates qualitative and quantitative analysis. In this paper we propose a model using Stochastic Colored Petri Nets to represent the operational dynamics of earth moving work. For this purpose, a graphic

Experienced Petri net modelers model in terms of patterns, just like object-oriented programmers use the design patterns of Gamma et al. So far there is no any structured collection of patterns for Colored Petri Nets. We have empirically collected 34 patterns in Colored Petri Nets

. This paper presents an adaptation of a supervisory control theory and a supervisor synthesis problem to a class of colored Petri nets. More specifically, the forbidden state control problem with full observation, in which a discrete-event system is modeled as a colored Petri net with a symmetry

the class of systems which can be modelled. Recently several researchers have considered extending the model to allow colored or typed tokens [123,7] In this note we consider this extended Petri net model. We refer the reader to [5] for an introduction to the Petri net model. Briefiy a Petri net is a four

, these conflict sets are subsets of equivalence classes of a structural conflict relation, which greatly simplifies the previous task. This paper solves the problem of detecting confusion in colored stochastic Petri nets and computing the equivalence classes of the structural conflict relation. Our approach

Abstract. In this paper, we develop a syntactical version of elaborated reductions for high-level Petri nets. These reductions simplify the model by merging some sequential transitions into an atomic one. Their conditions combine local structural ones (e.g. related to the actions of a thread

interactions requiring a notion of concurrency. We propose the use of Colored Petri Nets as a model underlying a language for conversation speci cation. This carries the relative simplicity and graphical representation of the former approach, along with greater expressive power and support for concurrency

Unfolding is an essential problem in reusing existing Petri net simulation and analysis techniques and related tools for colored Petri nets. We present an efficient unfolding method, in which we provide two approaches to efficiently compute transition instances. That is, for a transition