At present, the resource modeling of workflow net (WF-net) are too simple to describe complex workflow. Thus, its application is not satisfying in practical use. Based on the analysis of resource management problems, unified resources management which gets the identical resource request and release process is proposed. The method of identical resource-modeling reduces complexity of WF-net model...

We present a symbolic approach to the calculation of siphons and traps for algebraic Petri nets where the color domains are speci ed without equations and with at most unary operation symbols

We present a definition for a generic Time Petri net class covering most Time Petri net types known to the community. Due to the generic approach presented in this paper, the proposed syntax may as well be used as a proposal for an expression syntax of High-level Petri nets. Furthermore we present an implementation of translations between different Statically Timed Petri nets based on the prese...

Specification techniques like Petri nets allow for the formal description and analysis of systems. Although tool support exists for many different Petri net classes and tasks, a domain-specific animation of net behavior, however, is not yet supported by many Petri net tools. In this contribution, we present a formal approach for the generic specification of several Petri net classes including a...

In recent papers [4, 5, 8, 11] Petri net controlled grammars have been introduced and investigated. It was shown that various regulated grammars such as random context, matrix, vector, valence grammars, etc., resulted from enriching context-free grammars with additional mechanisms can be unified into the Petri net formalism, i.e., a grammar and its control can be represented by a Petri net. Thi...

We prove the following property for safe marked graphs, safe conflict-free Petri nets, and live and safe extended free-choice Petri nets. We prove the following three results. If the Petri net is a marked graph, then the length of the shortest path is at most (|T |−1)·|T |/2. If the Petri net is conflict free, then the length of the shortest path is at most (|T |+1)·|T |/2. If the Petri net is ...

A Petri net controlled grammar is a context-free grammar equipped with a Petri net, whose transitions are labeled with rules of the grammar or the empty string, and the associated language consists of all terminal strings which can be derived in the grammar and the the sequence of rules in every terminal derivation corresponds to some occurrence sequence of transitions of the Petri net which is...

Coloured Petri Nets are powerful models for different problems. This paper deals with the modelling of a Bluetooth communication network, piconet and scatternet. The developed Petri Net model is based on the Bluetooth Specification 1.1. The Petri Net model is structured in an hierarchical way. Thus, every part of the model, for example the channel model, is developed in a self-contained Petri N...

Net synthesis can be understood as an algorithmic procedure aimed at constructing a Petri net structure from a specification of its intended or desired behaviour, given typically in the form of a transition system or a formal language. The procedure has to decide whether such a specification can be realised and, if the answer is positive, deliver as efficiently as possible a Petri net with the ...