Process architecture

About: Process architecture is a research topic. Over the lifetime, 4876 publications have been published within this topic receiving 104171 citations.

Safeness for Object Nets

Abstract: In this paper we discuss the concept of safeness for Elementary Object Nets (EOS). Object nets are Petri nets which have Petri nets as tokens - an approach known as the nets-within-nets paradigm. Object nets are called elementary if the net system has a two levelled structure. The well known p/t nets can be considered as a special case of EOS. For p/t nets the concept of safeness means that there is at most one token on each place. Since object nets have nested markings there are different possibilities to generalise this idea for EOS. In this paper we define different variants of EOS safeness, discuss their relationships, show that they all coincide for p/t-like EOS, and address the complexity of well known Petri net problems like reachability and liveness for this new class of object nets.

Synthesis of Bounded Choice-Free Petri Nets

Abstract: This paper describes a synthesis algorithm tailored to the construction of choice-free Petri nets from finite persistent transition systems. With this goal in mind, a minimised set of simplified systems of linear inequalities is distilled from a general region-theoretic approach, leading to algorithmic improvements as well as to a partial characterisation of the class of persistent transition systems that have a choice-free Petri net realisation.

Sensor, Filter, and Fusion Models with Rough Petri Nets

Abstract: This paper considers models of sensors, filters, and sensor fusion with Petri nets defined in the context of rough sets. Sensors and filters are fundamental computational units in the design of systems. The intent of this work is to construct Petri nets to simulate conditional computation in approximate reasoning systems, which are dependent on filtered input from selected sensors considered relevant in problem solving. In this paper, coloured Petri nets provide a computational framework for the definition of a family of Petri nets based on rough set theory. Sensors are modeled with what are known as receptor processes in rough Petri nets. Filters are modeled as Lukasiewicz guards on some transitions in rough Petri nets. A Lukasiewicz guard is defined in the context of multivalued logic. Lukasiewicz guards are useful in culling from a collection of active sensors those sensors with the greatest relevance in a problem-solving effort such as classification of a "perceived" phenomenon in the environment of an agent. The relevance of a sensor is computed using a discrete rough integral. The form of sensor fusion considered in this paper consists in selecting only those sensors considered relevant in solving a problem. The contribution of this paper is the modeling of sensors, filters, and fusion in the context of receptor processes, Lukasiewicz guards, and rough integration, respectively.

Analyzing E-Commerce Business Process Nets via Incidence Matrix and Reduction

Abstract: E-commerce business process nets (EBPNs) are a novel formal model for describing and validating e-commerce systems including interactive parties such as shopper, merchant, and third-party payment platform. Data errors and nondeterminacy of the data states during the trading process can be depicted with the help of EBPNs. However, the problem about how to analyze EBPNs remains largely open. To analyze their data-liveness, data-boundedness, and reachability, this paper presents two analysis methods. For EBPNs, reachability analysis is proposed based on a 3-D incidence matrix method. Additionally, reduction methods are proposed for a special EBPN. Finally, the validity and reliability of the proposed methods are illustrated via the examples of e-commerce systems.