Topic
Process architecture
About: Process architecture is a research topic. Over the lifetime, 4876 publications have been published within this topic receiving 104171 citations.
Papers published on a yearly basis
Papers
More filters
11 Dec 1989
TL;DR: A hierarchy of high-level nets, including many-sorted versions of predicate-transition (PrT) nets and algebraic nets, is developed and differences from their single-sorts versions are discussed.
Abstract: Many-sorted high-level nets (MHLNs) combine abstract data types and Petri nets within the same algebraic framework and include inhibitor arcs and place capacities. Many-sorted signatures are used to define inscriptions. MHLNs are defined at two different levels of abstraction. At an abstract level markings and capacities are defined by terms. This is suitable for specifying classes of systems. At the concrete level, a many-sorted algebra satisfying the signature is used for markings and capacities. Both abstract and concrete MHLNs can be given an interpolation in terms of colored Petri nets extended by place capacities and inhibitors, known as P-nets. A hierarchy of high-level nets, including many-sorted versions of predicate-transition (PrT) nets and algebraic nets, is developed and differences from their single-sorted versions are discussed. >
49 citations
TL;DR: It is argued that partial order semantics can be used profitably in the proofs of some nontrivial results in Petri net theory.
Abstract: This paper argues that partial order semantics can be used profitably in the proofs of some nontrivial results in Petri net theory. We show that most of Commoner's and Hack's structure theory of free choice nets can be phrased and proved in terms of partial order behaviour. The new proofs are considerably shorter (and, arguably, more lucid) than the old ones; they also generalise the results from (safe) free choice nets to (bounded) extended free choice nets.
49 citations
TL;DR: It is shown that if one can identify certain structures in a net structure at the initial stage, it is possible to achieve desirable controllers for the original systems and the theoretical correctness of the proposed algorithm is discussed.
Abstract: Sensors and actuators are two indispensable parts in the paradigm of feedback control. Their implementation cost should be properly evaluated and constrained. In the previous work, a Petri net monitor with the least cost is synthesized through integer programming formulation. Despite its technical correctness, the existing method may lead to undesirable results when the net structure contains some shared or unshared resource places of a manufacturing-oriented net model. A necessary and sufficient condition is established to show that certain structures can lead to deadlock-prone supervisors. An efficient algorithm is developed to identify such structures. Furthermore, it is shown that if one can identify such structures at the initial stage, it is possible to achieve desirable controllers for the original systems. The theoretical correctness of the proposed algorithm is discussed. A manufacturing example is provided to illustrate the proposed approach.
49 citations
TL;DR: It is shown that in fact the satisfiability problem for this class of formulas is as hard as the reachability problem for Petri nets.
Abstract: In [19], Yen defines a class of formulas for paths in Petri nets and claims that its satisfiability problem is EXPSPACE-complete. In this paper, we show that in fact the satisfiability problem for this class of formulas is as hard as the reachability problem for Petri nets. Moreover, we salvage almost all of Yen's results by defining a fragment of this class of formulas for which the satisfiability problem is EXPSPACE-complete by adapting his proof.
49 citations
01 Jan 2015
TL;DR: The main purpose of this survey paper is to recommend PetriNet tools based on the operating system and the types of Petri net to be analyzed.
Abstract: Petri net is a mathematical modeling language used to describe a system graphically. It is a strong language that can be used to represent parallel or concurrent activities in a system. With a Petri net tool, users can view the overall system graphically and edit it with the editor. A Petri net tool can also be used to analyze the performance of the system, generate code, simulate the system and perform model checking on it. A review on twenty Petri net tools in this paper will give the readers an idea on what is a Petri net tool and the main functions of a Petri net tool. This paper can serve as an introduction of twenty Petri net tools to the reader. However, to date, there are many Petri net tools available to be downloaded online. This survey paper aims to compare twenty Petri net tools in different aspect. This is important as users will not have to read the reviews of Petri net tools online one by one. Just be having a look at the discussion provided, readers can determined the best recommended Petri net tools to be used based on their operating systems and the types of Petri net tool to be analyzed. The main purpose of this survey paper is to recommend Petri net tools based on the operating system and the types of Petri net to be analyzed.
49 citations