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 Jan 2000
TL;DR: This paper describes a methodology to develop a Petri net model of a system, by deriving a form of OPN called as Object Petri Net Models (OPMs) from UML Statechart diagrams and connecting them using UML Collaboration diagrams.
Abstract: This material is based upon work supported by the U.S. Army Research Office under grant number DAAD19-99-0350. Abstract. UML, being the industry standard as a common OO modeling language needs a well-defined semantic base for its notation. Formalization of the graphical notation enables automated processing and analysis tasks. Object Petri nets (OPN) can provide a formal semantic framework for the UML notations plus the behavioral modeling/ analysis strength needed by system designers. This paper describes a methodology to develop a Petri net model of a system, by deriving a form of OPN called as Object Petri Net Models (OPMs) from UML Statechart diagrams and connecting them using UML Collaboration diagrams. Then, the single system-level Petri net can be analyzed by formal Petri net analysis techniques.
116 citations
TL;DR: It is shown that a bounded OR-AND GMEC can be enforced by a special control structure composed by a set of AND-GMEC monitor places plus a switcher that determines the current active ones.
Abstract: In this paper, a type of specifications called OR-AND Generalized Mutual Exclusion Constraints (GMEC) for place/transition nets is defined. Such a specification consists of a disjunction of conjunction of several single GMECs, i.e., the requirement is that, at any given time, the controlled system should satisfy at least one set of conjunctive GMECs. We show that a bounded OR-AND GMEC can be enforced by a special control structure composed by a set of AND-GMEC monitor places plus a switcher that determines the current active ones. We also show that such a simple control structure can be modified to ensure maximal permissiveness. This approach can be used in the framework of supervisory control in Petri nets.
115 citations
TL;DR: The most important classes of nets are presented, their analysis possibilities are given and it is shown how they can be used to model and analyze communication and cooperation protocols.
114 citations
20 Sep 2007
TL;DR: A Petri net-based framework for modelling and analysing biochemical pathways, which unifies the qualitative, stochastic and continuous paradigms, and is applied more widely to other formalisms which are used to model and analyse biochemical networks.
Abstract: We give a description of a Petri net-based framework for modelling and analysing biochemical pathways, which unifies the qualitative, stochastic and continuous paradigms. Each perspective adds its contribution to the understanding of the system, thus the three approaches do not compete, but complement each other. We illustrate our approach by applying it to an extended model of the three stage cascade, which forms the core of the ERK signal transduction pathway. Consequently our focus is on transient behaviour analysis. We demonstrate how qualitative descriptions are abstractions over stochastic or continuous descriptions, and show that the stochastic and continuous models approximate each other. A key contribution of the paper consists in a precise definition of biochemically interpreted stochastic Petri nets. Although our framework is based on Petri nets, it can be applied more widely to other formalisms which are used to model and analyse biochemical networks.
113 citations
TL;DR: A systematic correspondence between Petri nets, linear logic theories, and linear categories is established, which sheds new light on the relationships between linear logic and concurrency, and on how both areas are related to category theory.
Abstract: Linear logic has recently been introduced by Girard as a logic of actions that seems well suited for concurrent computation. In this paper, we establish a systematic correspondence between Petri nets, linear logic theories, and linear categories. Such a correspondence sheds new light on the relationships between linear logic and concurrency, and on how both areas are related to category theory. Categories are here viewed as concurrent systems the objects of which are states, and the morphisms of which are transitions. This is an instance of the Lambek-Lawvere correspondence between logic and category theory that cannot be expressed within the more restricted framework of the Curry-Howard correspondence.
113 citations