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
16 Dec 1998
TL;DR: A novel hybrid model for transportation systems is proposed, in which the functioning is represented via a continuous-time model whenever no changes in the traffic flow occur, whereas the changes inThe system behaviour are modelled through a discrete event system coupled with the continuous- time system, on which acts as a regulator.
Abstract: A novel hybrid model for transportation systems is proposed, in which the functioning is represented via a continuous-time model whenever no changes in the traffic flow occur, whereas the changes in the system behaviour are modelled through a discrete event system coupled with the continuous-time system, on which acts as a regulator. The hybrid modelling methodology proposed is based on the use of a special class of Petri nets, the hybrid stochastic Petri nets (HSPN). These nets are composed of some discrete parts, and some continuous parts. The discrete part of the HSPN 'regulates' the continuous PN, which models the functioning of the transportation system, making the continuous-time part adapt according to the variation occurred in the system behaviour. As a result, the model reacts to any change in the current system behaviour by adapting the traffic parameters to the new state.
23 citations
11 Sep 2006
TL;DR: QPME is presented - a queueing Petri net modeling environment that supports the modeling and analysis of systems using queueingPetri nets and provides a powerful simulation engine that can be used to analyze models of realistically-sized systems.
Abstract: Queueing Petri nets are a powerful formalism that can be exploited for modeling distributed systems and analyzing their performance and scalability. However, currently available tools for modeling and analysis using queueing Petri nets are very limited in terms of the scalability of the analysis algorithms they provide. Moreover, tools are available only on highly specialized platforms unaccessible to most potential users. In this paper, we present QPME - a Queueing Petri Net Modeling Environment that supports the modeling and analysis of systems using queueing Petri nets. QPME runs on a wide range of platforms and provides a powerful simulation engine that can be used to analyze models of realistically-sized systems.
23 citations
11 Dec 1994
TL;DR: This work presents the structural and behavioral properties of standard Stochastic Petri Nets and Event Graph models and discusses their relationship, finding that these two graphical representations of discrete event dynamic systems work in a complementary manner.
Abstract: Stochastic Petri Nets and simulation Event Graph models both have attractive graphical representations and simple rules that govern their dynamic behavior. A mapping of Stochastic Petri Nets into Event Graph models is presented and discussed. This mapping can be used to develop simulations of Petri Nets that exploit the efficiencies of the event-scheduling paradigm. It also permits the application of some of the rich analytical methodologies in the Petri Net literature to the analysis of event-oriented simulation models. Indeed, these two graphical representations of discrete event dynamic systems work in a complementary manner. We first present the structural and behavioral properties of standard Stochastic Petri Nets and Event Graph models and then discuss their relationship.
23 citations
13 Oct 2011
TL;DR: This paper proposes an optimization approach aiming at the direct design of the monitors, that allows for an easy formalization of the various control objectives and yields significant improvements over known benchmark problems.
Abstract: Deadlock Prevention and Liveness Enforcement in Petri nets are mostly addressed with monitor-based methods, designed indirectly using the concept of siphon or the theory of regions. The obtained control solutions are sometimes maximally permissive, but generally not optimal in terms of the number of monitors, nor in the cost of the control subnet. This paper proposes an optimization approach aiming at the direct design of the monitors, that allows for an easy formalization of the various control objectives. An efficient solution scheme, based on a branch-and-bound approach is also presented. The proposed monitor design algorithm yields significant improvements over known benchmark problems.
23 citations
25 Jun 2001
TL;DR: An operational semantics and a denotational semantics based on timed Petri nets are presented and the introduction of other new features such as time-outs and delays are discussed.
Abstract: PBC (Petri Box Calculus) is a process algebra where real parallelism of concurrent systems can be naturally expressed. One of its main features is the definition of a denotational semantics based on Petri nets, which emphasizes the structural aspects of the modelled systems. However, this formal model does not include temporal aspects of processes, which are necessary when considering real-time systems. The aim of this paper is to extend the existing calculus with those temporal aspects. We consider that actions are not instantaneous, that is, their execution takes time. We present an operational semantics and a denotational semantics based on timed Petri nets. Finally, we discuss the introduction of other new features such as time-outs and delays. Throughout the paper we assume that the reader is familiar with both Petri nets and PBC.
23 citations