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
01 Nov 2008
TL;DR: Valuable and flexible control features are obtained from its application, such as an integrated methodology for the modular control with decision support and validation.
Abstract: This paper describes a solution for the control of service-oriented devices based on modular and special adapted high-level Petri nets process description of intra- and inter-control activities The procedure is applied on a case study scenario, corresponding to a real transfer system made of several control devices represented as service-oriented components able to share information between them The high-level Petri Nets are adapted to associable models applicable to describe control processes and sufficient elastic for different control strategies Valuable and flexible control features are obtained from its application, such as an integrated methodology for the modular control with decision support and validation
25 citations
18 Jun 2009
TL;DR: This work provides the formal framework for a simple composition operator, adequate for many classes of Petri net applications, and is associative, thus meeting the minimal algebraic requirements when composing a large system out of several smaller ones.
Abstract: Petri nets are frequently composed of given nets. Literature suggests a lot of different composition operators, for different purposes and different classes of Petri nets. Formal definitions are frequently surprisingly technical, not matching the intuitive elegance of their graphical counterpart.
We provide the formal framework for a simple composition operator, adequate for many classes of Petri net applications. It requires a minimum of fairly intuitive technicalities from its users and readers. The operator furthermore is associative, thus meeting the minimal algebraic requirements when composing a large system out of several smaller ones.
25 citations
TL;DR: The class of Single–Rate Hybrid Petri Nets is defined, which can be seen as the counterpart of timed automata with skewed clocks, and it is proved that the reachability problem for this class can be reduced to the reachable problem of an equivalent discrete net and thus it is decidable.
Abstract: In this paper we tackle the decidability of marking reachability for a hybrid formalism based on Petri nets. The model we consider is the untimed version of First–Order Hybrid Petri Nets: it combines a discrete Petri net and a continuous Petri net, the latter being a fluid version of a usual discrete Petri net. It is suggested that the decidability results should be pursued exploiting a hierarchy of models as it has been done in the framework of Hybrid Automata. In this paper we define the class of Single–Rate Hybrid Petri Nets: the continuous dynamics of these nets is such that the vector of the marking derivatives of the continuous places is constant but for a scalar factor. This class of nets can be seen as the counterpart of timed automata with skewed clocks. We prove that the reachability problem for this class can be reduced to the reachability problem of an equivalent discrete net and thus it is decidable.
25 citations
01 Jul 2008
TL;DR: The refinement of Petri nets is introduced based on a k-well-behaved Petri net, in which k tokens can be processed, and according to the different compositions of subsystems, well-, under- and overmatched refined Petrinets are proposed.
Abstract: The current stepwise refinement operation of Petri nets mainly concentrates on property preservation, which is an effective way to analyze and verify complex systems. Further steps into this field are needed from the perspective of system synthesis and language preservation. First, the refinement of Petri nets is introduced based on a k-well-behaved Petri net, in which k tokens can be processed. Then, according to the different compositions of subsystems, well-, under- and overmatched refined Petri nets are proposed. In addition, the language and property relationships among sub-, original, and refined nets are studied to demonstrate behavior characteristics and property preservation in a system synthesis process. A manufacturing system is given as an example to illustrate the effectiveness of the proposed approach in synthesizing and analyzing the Petri nets of complex systems.
25 citations
TL;DR: The fact that both language equivalence and bisimulation equivalence are undecidable for unbounded labelled Petri nets might be seen as an indication that non-interference properties based on these equivalences cannot be decided, but it is proved the opposite, providing results of decidability of non-Interference over a representative class of infinite state systems.
Abstract: Non-interference, in transitive or intransitive form, is defined here over unbounded (Place/Transition) Petri nets. The definitions are adaptations of similar, well-accepted definitions introduced earlier in the framework of labelled transition systems. The interpretation of intransitive non-interference which we propose for Petri nets is as follows. A Petri net represents the composition of a controlled and a controller systems, possibly sharing places and transitions. Low transitions represent local actions of the controlled system, high transitions represent local decisions of the controller, and downgrading transitions represent synchronized actions of both components. Intransitive non-interference means the impossibility for the controlled system to follow any local strategy that would force or dodge synchronized actions depending upon the decisions taken by the controller after the last synchronized action. The fact that both language equivalence and bisimulation equivalence are undecidable for unbounded labelled Petri nets might be seen as an indication that non-interference properties based on these equivalences cannot be decided. We prove the opposite, providing results of decidability of non-interference over a representative class of infinite state systems.
25 citations