Petri net

About: Petri net is a research topic. Over the lifetime, 25039 publications have been published within this topic receiving 406994 citations.

Task sequence planning using fuzzy Petri nets

Abstract: This paper discusses the problem of representation and planning of operations sequences in a robotic system using fuzzy Petri nets. In the fuzzy Petri net representation, objects whose internal states are altered during a process are termed soft objects, and the process steps where alterations may occur are labeled key transitions. A correct sequence is defined as a sequence which is feasible, complete, and satisfies precedence relations. In this formulation, the internal state of an object is represented by a global fuzzy variable attached to the token related to the degree of completion of the process. All correct operations sequences must satisfy process sequence constraints imposed by transition reasoning rules. The correct precedence relationships and the characteristics of completeness for operations in all feasible sequences are guaranteed by the prime number marking algorithm which marks the fuzzy Petri net. The use of transition reasoning rules in this application simplifies the representation and search problems for task planning where correct sequences do not depend on exact knowledge of internal states, but only their precedence relations. >

Transformation of BPMN Models for Behaviour Analysis

Abstract: In industry, many business processes are modelled and stored in Enterprise Information Systems (EIS). Tools supporting the verification and validation of business processes can help to improve the quality of these business processes. However, existing tools can not directly be applied to models used in industry. In this paper, we present our approach for model verification and validation: translating industrial models to Petri nets and mCRL2, and subsequently applying existing tools on the models derived from the initial industrial models. The following translations are described: BPMN models to Petri nets and Petri nets to mCRL2. It is shown what the analysis on the derived models can reveal about the original models.

Dynamic access control through Petri net workflows

Abstract: Access control is an important protection mechanism for information systems. An access control matrix grants subjects privileges to objects. Today, access control matrices are static they rarely change over time. This paper shows how to make access control matrices dynamic by means of workflows. Access rights are granted according to the state of the workflow. By this practice the risk of data misuse is decreased which is proven through an equation given in the paper. The concept of workflow is defined by Petri nets which offer a solid mathematical foundation and are well suited to represent discrete models such as workflows.

Termination analysis of model transformations by petri nets

Abstract: Despite the increasing relevance of model transformation techniques in model-driven software development, research is mainly conducted to the specification and the automation of such transformations. However, since the transformations themselves may also contain conceptual flaws, it is essential to formally analyze them prior to executing them on user models. In the current paper, we focus on a central validation problem of trusted model transformations, namely, termination and propose a Petri net based analysis method that provides a sufficient criterion for the termination problem of model transformations captured by graph transformation systems.