Process architecture

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

Brief paper: new controllability condition for siphons in a class of generalised Petri nets

Abstract: Over the last two decades, a number of deadlock control policies based on Petri nets were proposed for flexible manufacturing systems (FMSs). As a structural object of a Petri net, siphons are widely used in deadlock control. For system of sequential systems with shared resources (S4R), the current deadlock control policies based on max or max′-controlled siphons tend to overly restrict the behaviour of a controlled system. The controllability conditions of a siphon are relaxed by a new concept called max″-controlled ones. We conclude that an S4R is live if all its siphons are max″-controlled. Compared with the existing ones, the proposed one is more general. Examples are given to illustrate it.

High-level Petri nets for the process description and control in service-oriented manufacturing systems

Abstract: The use of service-orientation principles in manufacturing systems is a promising solution to achieve modularity, flexibility, re-configurability and interoperability. Crucial issues in these service-oriented systems are the description and co-ordination of the execution of the services offered by the distributed entities. This paper introduces an integrated approach for the design, analysis, validation, simulation and process execution of service-oriented manufacturing systems, using the High-level Petri net formalism as the formal language to describe the system behaviour. The use of the proposed approach contributes to achieving an easier and faster development of these solutions and provides the basis to support modularity and re-configurability.

Petri nets and programming: A survey

Abstract: Petri nets and related models have been used for specification, analysis, and synthesis of programs. The paper contains a survey of several literature approaches and an examination of their relationship to Petri net modeling and supervisory control. The discussion is restricted to Petri net models in the class of place/transitions nets and the supervisory control of this class of models.

High-Level Net Processes

Abstract: The notion of processes for low-level Petri nets based on occurrence nets is well known and it represents the basis for the study of the non-sequential behavior of Petri nets. Processes for high-level nets N are often defined as processes of the low level net Flat(N) which is obtained from N via a construction called "flattening". In this paper we define high-level processes for high-level nets based on a suitable notion of high-level occurrence nets. The flattening of a high-level occurrence net is in general not a low-level occurrence net, due to so called "assignment conflicts" in the high-level net. The main technical result is a syntactical characterization of assignment conflicts. But the main focus of this paper is a conceptual discussion of future perspectives of high-level net processes includingc oncurrency and data type aspects. Specifically, in the second part of the paper, we discuss possible extensions of high-level net processes, which are formally introduced for algebraic high-level nets in the first part of this paper. Of special interest are high-level processes with data type behavior, amalgamation, and other kinds of constructions, which are essential aspects for a proposed component concept for high-level nets.

Petri Nets, Process Algebras and Concurrent Programming Languages

Abstract: This paper discusses issues that arise when process algebras and Petri nets are linked; in particular, operators, compositional ity, recursion, refinement and equivalences. It uses the box algebra in order to show how Petri nets can be manipulated algebraically. Also, the paper shows how other process algebras such as CCS, COSY and CSP can be treated in the same way, how Petri net semantics of concurrent programming languages can be given, and how Petri net methods can be applied to the verification of concurrent algorithms.