Process architecture

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

Structuring Acyclic Petri Nets for Reachability Analysis and Control

Abstract: The incidence matrices—from places to transitions and vice versa—of an acyclic Petri net can obtain a block-triangular structure by reordering their rows and columns. This allows the efficient solution of some reachability problems for acyclic Petri nets. This result is further used in supervisory control of Petri nets; supervisors for Petri nets with uncontrollable transitions are constructed by extending the method of Yamalidou et al. (1996) to Petri nets where transitions can be executed simultaneously. A large class of Petri nets with uncontrollable transitions is given for which the maximally permissive supervisor can be realized by a Petri net. The original specification is algorithmically transformed—by using the results for acyclic Petri nets—into a new specification to take the presence of uncontrollable transitions into account. The supervisor is obtained by simple matrix multiplications and no linear integer programs need to be solved. Furthermore, a class of Petri nets is given for which the supervisor can be realized by extending the enabling rule with OR-logic.

Assembly/disassembly task planning and simulation using expert Petri nets

Abstract: Automatic assembly/disassembly planning is recognized as an important tool for reducing the manufacturing costs in concurrent product and process development. This paper developed a knowledge-based expert Petri net model by incorporating expert system techniques in artificial intelligence into ordinary Petri nets for an analytical framework of understanding, representing and reasoning the assembly/disassembly tasks. Substantial extensions have been made to ordinary Petri nets by adding control places, time constraints, and place and transition knowledge annotations. The proposed expert Petri net model can be considered as the hybrid of expert systems and ordinary Petri nets. Through these extensions, the capacities of modelling and representation of ordinary Petri net models are largely enhanced, and thus the expert Petri net models are more powerful than ordinary Petri nets. Such intelligent Petri net models can combine the abilities of modelling, planning, and performance evaluation for assembly/disasse...

Modeling Games with Petri Nets

Abstract: This paper describes an alternate approach to the modeling of game systems and game flow with Petri nets. Modeling languages usually used in this area are of limited efficiency when it comes to validating the underlying game systems. We provide a case study to show that Petri Nets can be used with advantages over other modeling languages. Their graphical notation is simple, yet it can be used to model complex game systems. Their mathematically defined structure enables the modeled system to be formally analyzed and its behavior’s simulation offers the possibility of detecting unwanted behaviors, loop-holes or balancing issues while still in the game design stage.

A modified reachability tree approach to analysis of unbounded Petri nets

Abstract: Reachability trees, especially the corresponding Karp-Miller's finite reachability trees generated for Petri nets are fundamental for systematically investigating many characteristics such as boundedness, liveness, and performance of systems modeled by Petri nets. However, too much information is lost in a FRT to render it useful for many applications. In this paper, modified reachability trees (MRT) of Petri nets are introduced that extend the capability of Karp-Miller's FRTs in solving the liveness, deadlock, and reachability problems, and in defining or determining possible firing sequences. The finiteness of MRT is proved and several examples are presented to illustrate the advantages of MRT over FRT.