A comparative analysis of recent identification approaches for discrete-event systems.
We provide a framework for hierarchical specification called Hierarchical Decision Process Petri Nets (HDPPNs). It is an extension of Decision Process Petri Nets (DPPNs) including a hierarchical decomposition process that generates less complex nets with equivalent behavior. As a result, the complexity of the analysis for a sophisticated system is drastically reduced. In the HDPPN, we represent the mark-dynamic and trajectory-dynamic properties of a DPPN. Within the framework of the mark-dynamic...
In order to approximate discrete-event systems in which there exist considerable states and events, David and Alla define a continuous Petri net (CPN). So far, CPNs have been a useful tool not only for approximating discrete-event systems but also for modelling continuous processes. Due to different ways of calculating instantaneous firing speeds of transitions, various continuous Petri net models, such as the CCPN (constant speed CPN), VCPN (variable speed CPN) and the ACPN (asymptotic CPN), have...
A linear quadratic optimal control problem for a class of discrete distributed systems is analyzed. To solve this problem, we introduce an adequate topology and establish that optimal control can be determined though an inversion of the appropriate isomorphism. An example and a numerical approach are given.
This paper presents a constrained decomposition methodology with output injection to obtain decoupled partial models. Measured process outputs and decoupled partial model outputs are used to generate structured residuals for Fault Detection and Isolation (FDI). An algebraic framework is chosen to describe the decomposition method. The constraints of the decomposition ensure that the resulting partial model is decoupled from a given subset of inputs. Set theoretical notions are used to describe the...
In this paper we consider workflow nets as dynamical systems governed by ordinary difference equations described by a particular class of Petri nets. Workflow nets are a formal model of business processes. Well-formed business processes correspond to sound workflow nets. Even if it seems necessary to require the soundness of workflow nets, there exist business processes with conditional behavior that will not necessarily satisfy the soundness property. In this sense, we propose an analytical method...
This paper presents some structural properties of a generalized Petri net (PN) with an algorithm to determine the (partial) conservativeness and (partial) consistency of the net. A product incidence matrix or is defined and used to further improve the relations among PNs, linear inequalities and matrix analysis. Thus, based on Cramer’s Rule, a new approach for the study of the solution of a linear system is given in terms of certain sub-determinants of the coefficient matrix and an efficient...