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
26 Aug 2013
TL;DR: This work focuses on memoryless models such as exponentially distributed stochastic Petri nets, which have earned much attention in research and industry, but there are cases when the memoryless property is clearly not able to capture process behavior.
Abstract: Capturing the performance of a system or business process as accurately as possible is important, as models enriched with performance information provide valuable input for analysis, operational support, and prediction. Due to their computationally nice properties, memoryless models such as exponentially distributed stochastic Petri nets have earned much attention in research and industry. However, there are cases when the memoryless property is clearly not able to capture process behavior, e.g., when dealing with fixed time-outs.
68 citations
TL;DR: Petri-net-aided software including genetic-algorithm-based search and heuristics is described to deal with a multi-mode, multi-constrained scheduling problem with pre-emption of activities.
Abstract: Multi-mode and multi-resource constrained scheduling of a project is a complex task. This paper addresses the use of a Petri net as a modelling and scheduling tool in this context, t The benefits of Petri nets in project scheduling are discussed. We propose extensions to Petri nets to suit scheduling of activities in a decision CPM. We also propose the use of a P-matrix for token movements in Petri nets. A genetic algorithm is used to find a better solution. Petri-net-aided software including genetic-algorithm-based search and heuristics is described to deal with a multi-mode, multi-constrained scheduling problem with pre-emption of activities.
68 citations
21 Jun 2004
TL;DR: This paper defines Time Petri Nets with Inhibitor Hyperarcs (IHTPN) as an extension of T-time Petri nets where time is associated with transitions, and provides a method for computing the state space of IHTPNs.
Abstract: In this paper, we define Time Petri Nets with Inhibitor Hyperarcs (IHTPN) as an extension of T-time Petri nets where time is associated with transitions In this model, we consider stopwatches associated with transitions which can be reset, stopped and started by using classical arcs and branch inhibitor hyperarcs introduced by Janicki and Koutny [x] We give a formal semantics for IHTPNs in terms of Timed Transition Systems and we position IHTPNs with regard to other classes of Petri nets in terms of timed language acceptance We provide a method for computing the state space of IHTPNs We first propose an exact computation using a general polyhedron representation of time constraints, then we propose an overapproximation of the polyhedra to allow a more efficient compact abstract representations of the state space based on DBM (Difference Bound Matrix)
68 citations
TL;DR: To compare the modeling power of different Petri net generators, the notion of observation equivalence is proposed and ALPNs are shown to be the class of bounded generators possessing the highest modeling power.
Abstract: Observation structures considered for Petri net generators usually assume that the firing of transitions may be observed through a static mask and that the marking of some places may be measurable. These observation structures, however, are rather limited, namely they do not cover all cases of practical interest where complex observations are possible. We consider in this paper more general ones, by correspondingly defining two new classes of Petri net generators: labeled Petri nets with outputs (LPNOs) and adaptive labeled Petri nets (ALPNs). To compare the modeling power of different Petri net generators, the notion of observation equivalence is proposed. ALPNs are shown to be the class of bounded generators possessing the highest modeling power. Looking for bridges between the different formalisms, we first present a general procedure to convert a bounded LPNO into an equivalent ALPN or even into an equivalent labeled Petri net (if any exists). Finally, we discuss the possibility of converting an unbounded LPNO into an equivalent ALPN.
67 citations
TL;DR: In this paper, the authors define a causality semantics of Petri nets with weighted inhibitor arcs, based on the process semantics given through occurrence nets, and demonstrate how processes corresponding to step sequences of PTI-nets can be constructed algorithmically, and a non-algorithmic characterisation of all those processes that can be obtained in this way.
Abstract: We define a causality semantics of Place/Transition nets with weighted inhibitor arcs (PTI-nets). We extend the standard approach to defining the partial order semantics of Place/Transition nets (PT-nets) based on the process semantics given through occurrence nets. To deal with inhibitor arcs at the level of occurrence nets activator arcs (and extra conditions) are used. The properties of the resulting activator occurrence nets are extensively investigated. It is then demonstrated how processes corresponding to step sequences of PTI-nets can be constructed algorithmically, and a non-algorithmic (axiomatic) characterisation is given of all those processes that can be obtained in this way. In addition, a general framework is established allowing to separately discuss behaviour, processes, causality, and their properties before proving that the resulting notions are mutually consistent for the various classes of Petri nets considered. This facilitates an efficient and uniform presentation of our results.
67 citations