Based on the Petri net definitions and theorems already formalized in the Mizar article [13], in this article we were able to formalize the definition of cell Petri nets. It is based on [12]. Colored Petri net has already been defined in [11]. In addition, the conditions of the firing rule and the colored set to this definition, that defines the cell Petri nets are further extended to CPNT.i fu...

The paper presents the Petri net ontology that enables sharing Petri nets on the Semantic Web. Previous work on formal methods for representing Petri nets mainly defines tool-specific descriptions or formats for model interchange. However, such efforts do not provide a suitable description for using Petri nets on the Semantic Web. This paper uses the Petri net UML model as a starting point for ...

PETRI-HELP supports novices in learning to model with conditionevent Petri nets. It is based on a theoretical framework recommending that a help system should offer help, let the learner use pre-knowledge, and support different problem solving levels. In PETRI-HELP the learner creates Petri nets for given tasks, test hypotheses about the solutions or fragments of them, and receive feedback, com...

Petri Nets are a system description and analysis tool. Reachability is one of the most basic properties in Petri Net research. In a sense, reachability research is the foundation study for other dynamic properties of Petri Nets through which many problems involving Petri Nets can be described. Nowadays, there are two mature analysis methods–the matrix equation and the reachability tree. However...

Preface It is already a tradition to select papers from the annual PETRI NETS conference for a special issue of Fundamenta Informaticae. This volume presents six papers that extend or combine seven papers from the 34th International Conference on Application and Theory of Petri Nets and Concurrency which took place at the Università degli Studi di Milano-Bicocca in June 2013. The program commit...

This is a tutorial paper on Petri nets. Petri nets, as a graphical and mathematical tool, provide a uniform environment for modelling, formal analysis, and design of discrete event systems. The main objective of this paper is to introduce the fundamental concepts of Petri nets to the researchers and practitioners, both from academia and industry, who are involved in the work in the areas of mod...

We de ne a new subclass of persistent Petri nets called single-path Petri nets. Our intention is to provide a class of Petri nets whose study might yield some insight into the mathematical properties of persistent Petri nets or even general Petri nets. We conjecture that the Karp-Miller coverability tree for a persistent net is small enough to be searched in polynomial space. Although we are un...

Timed Petri nets can be used to model and analyse scheduling problems. To support the modelling of scheduling problems, we provide a method to map tasks, resources and constraints onto a timed Petri net. By mapping scheduling problems onto Petri nets, we are able to use standard Petri net theory. In this paper we will show that we can use Petri net based tools and techniques to find conflicting...

Petri, C. A. , Kommunikation mit automaten, Schriften des Institutes fur Instrumentelle Mathematik, Bonn, 1962. Callou, G. , Macial, P. , Tutsch, D. , Araujo, J. , Ferreira, J. and Souza, R. , A Petri net-based approach to the quantification of data center dependability. In: Petri nets—Manufacturing and Computer Science (Ed. : Pawel Pawlewski), 2012, 313-336. Dassow, J. , Mavlankulov, G. , Othm...

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...