In the long history of Petri nets a universe of Petri nets has evolved consisting of an enormously rich theory, a wide variety of tools, and numerous successful applications and case studies in various application domains. This vast variety is not any more handable for anyone working with Petri nets, which results in the strong need of a structured access to Petri nets. This structured access h...

The Petri Net Markup Language (PNML) is an XML-based interchange format for Petri nets. PNML supports any version of Petri net since new Petri net types can be defined by so-called Petri Net Type Definitions (PNTD). In this paper, we present the syntax and the semantics of PNML as well as the principles underlying its design. Moreover, we present an extension called modular PNML, which is a typ...

The universal inhibitor Petri net was constructed that executes an arbitrary given inhibitor Petri net. The inhibitor Petri net graph, its marking and the transitions firing sequence were encoded as 10 scalar nonnegative integer numbers and represented by corresponding places of universal net. The algorithm of inhibitor net executing that uses scalar variables only was constructed on its state ...

Petri nets are suitable for modelling of discrete-event systems with highly parallel and cooperating activities. In complex man-made systems, such as manufacturing systems, the systems’ specific properties, such as conflicts, deadlocks, limited buffer sizes, and finite resource constraints can be easily represented in the Petri net model. Therefore teaching of Petri net basics is an inevitable ...

Petri nets, introduced by Carl Adam Petri [12] in 1962, provide a powerful mathematical formalism for describing and analyzing the flow of information and control in concurrent systems. Petri nets can successfully be used as control mechanisms for grammars, i.e., the generative devices of formal languages. In recent papers [4], [5], [9], [16] Petri net controlled grammars have been introduced a...

This paper discusses coloured Petri net models of so-called timed influence nets with logic. Previous work has developed a method to translate a timed influence net into a coloured Petri net. The work in this paper describes a new and more compact translation from timed influence nets with logic into coloured Petri nets. The translation has the property that the net structure of the coloured Pe...

This work treats the relationship between Petri Nets and languages. In 2003, Darondeau solved the Petri Net synthesis problem for a certain class of languages, i. e. for a given language L of this class he constructed a Petri Net generating the least Petri Net language containing L. Furthermore, he developed a decision procedure which tests for equality of these two languages. It is proved here...