Results 1  10
of
38
Stochastic automata network for modeling parallel systems
 IEEE Trans. Software Eng
, 1991
"... AbstractThis paper is motivated by the study of the performance of parallel systems. The performance models of such systems are often complex to describe and hard to solve. The method presented here uses a modular representation of the system as a network of statetransition graphs. The state spac ..."
Abstract

Cited by 128 (10 self)
 Add to MetaCart
AbstractThis paper is motivated by the study of the performance of parallel systems. The performance models of such systems are often complex to describe and hard to solve. The method presented here uses a modular representation of the system as a network of statetransition graphs. The state space explosion is handled by a decomposition technique. The dynamic behavior of the algorithm is analyzed under Markovian assumptions. The transition matrix of the chain is automatically derived using tensor algebra operators, under a format which involves a very limited storage cost. Index TermsPerformance evaluation, Markov chain, tensor product, parallel systems, discrete time scale.
A Comparison of Performance Evaluation Process Algebra and Generalized Stochastic Petri Nets
 In Proc. 6th International Workshop on Petri Nets and Performance Models
, 1995
"... Generalized Stochastic Petri Nets (GSPN)and Performance Evaluation Process Algebra (PEPA) can both be used to study qualitative and quantitative behaviour of systems in a single environment. This paper presents a comparison of the two formalisms in terms of the facilities that they provide to the mo ..."
Abstract

Cited by 34 (8 self)
 Add to MetaCart
(Show Context)
Generalized Stochastic Petri Nets (GSPN)and Performance Evaluation Process Algebra (PEPA) can both be used to study qualitative and quantitative behaviour of systems in a single environment. This paper presents a comparison of the two formalisms in terms of the facilities that they provide to the modeller, considering both the definition and the analysis of the performance model. Our goal is to provide a better understanding of both formalisms, and to prepare a fertile ground for exchanging ideas and techniques between the two. To illustrate similarities and differences, we make the different issues more concrete by means of an example modelling resource contention. 1 Introduction In this paper we present a comparison of two formalisms which may be used to develop performance models as continuous time Markov chains (CTMC). Generalized stochastic Petri nets (GSPN) is a wellestablished high level modelling paradigm which has been widely applied in performance analysis. In contrast, Per...
Distributed Simulation of Timed Petri Nets: Exploiting the Net Structure to Obtain Efficiency
 In 14 th International Conference on Application and Theory of Petri Nets
, 1993
"... . The conservative and the optimistic approaches of distributed discrete event simulation (DDES) are used as the starting point to develop an optimized simulation framework for studying the behaviour of large and complex timed transition Petri net (TTPN) models. This work systematically investigates ..."
Abstract

Cited by 21 (12 self)
 Add to MetaCart
(Show Context)
. The conservative and the optimistic approaches of distributed discrete event simulation (DDES) are used as the starting point to develop an optimized simulation framework for studying the behaviour of large and complex timed transition Petri net (TTPN) models. This work systematically investigates the interdependencies among the DDES strategy (conservative, Time Warp) and the spatial decomposition of TTPNs into logical processes to be run concurrently on individual processing nodes in a message passing and shared memory multiprocessor environment. Partitioning heuristics are developed taking into account the structural properties of the TTPN model, and the simulation strategy is tuned accordingly in order to attain the maximum computational speedup. Implementations of the simulation framework have been undertaken for the Intel iPSC/860 hypercube, the Sequent Balance and a Transputer based multiprocessor. The simulation results show that the use of the Petri net formalism allows an au...
Petri Nets for Modelling Metabolic Pathways: A Survey
"... Abstract. In the last fifteen years, several research efforts have been directed towards the representation and the analysis of metabolic pathways by using Petri nets. The goal of this paper is twofold. First, we discuss how the knowledge about metabolic pathways can be represented with Petri nets. ..."
Abstract

Cited by 21 (3 self)
 Add to MetaCart
(Show Context)
Abstract. In the last fifteen years, several research efforts have been directed towards the representation and the analysis of metabolic pathways by using Petri nets. The goal of this paper is twofold. First, we discuss how the knowledge about metabolic pathways can be represented with Petri nets. We point out the main problems that arise in the construction of a Petri net model of a metabolic pathway and we outline some solutions proposed in the literature. Second, we present a comprehensive review of recent research on this topic, in order to assess the maturity of the field and the availability of a methodology for modelling a metabolic pathway by a corresponding Petri net. 1
Welldefined stochastic Petri nets, in
 Proceedings of the 4th International Workshop on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems, MASCOTS ’96, IEEE Computer Society
, 1996
"... ..."
(Show Context)
PN: Modeling and simulation of molecular biology systems using petri nets: modeling goals of various approaches
 J Bioinform Comput Biol
, 2004
"... Petri nets are a discrete event simulation approach developed for system representation, in particular for their concurrency and synchronization properties. Various extensions to the original theory of Petri nets have been used for modeling molecular biology systems and metabolic networks. These ext ..."
Abstract

Cited by 18 (2 self)
 Add to MetaCart
Petri nets are a discrete event simulation approach developed for system representation, in particular for their concurrency and synchronization properties. Various extensions to the original theory of Petri nets have been used for modeling molecular biology systems and metabolic networks. These extensions are stochastic, colored, hybrid and functional. This paper carries out an initial review of the various modeling approaches based on Petri net found in the literature, and of the biological systems that have been successfully modeled with these approaches. Moreover, the modeling goals and possibilities of qualitative analysis and system simulation of each approach are discussed.
Concurrency and Composition in a Stochastic World
, 2012
"... Abstract. We discuss conceptional and foundational aspects of Markov automata [22]. We place this model in the context of continuous and discretetime Markov chains, probabilistic automata and interactive Markov chains, and provide insight into the parallel execution of such models. We further give ..."
Abstract

Cited by 12 (3 self)
 Add to MetaCart
(Show Context)
Abstract. We discuss conceptional and foundational aspects of Markov automata [22]. We place this model in the context of continuous and discretetime Markov chains, probabilistic automata and interactive Markov chains, and provide insight into the parallel execution of such models. We further give a detailled account of the concept of relations on distributions, and discuss how this can generalise known notions of weak simulation and bisimulation, such as to fuse sequences of internal transitions. 1
Process Semantics of General Inhibitor Nets
 Inf. Comput
, 2004
"... this paper, we consider the general class of PTInets consisting of weighted PTnets with weighted inhibitor arcs which can be used for testing whether a place does not contain more than a certain threshold number of tokens [1]. We are concerned with the development of a process semantics of general ..."
Abstract

Cited by 11 (0 self)
 Add to MetaCart
this paper, we consider the general class of PTInets consisting of weighted PTnets with weighted inhibitor arcs which can be used for testing whether a place does not contain more than a certain threshold number of tokens [1]. We are concerned with the development of a process semantics of general PTInets, based on net unfolding and occurrence nets
Exploiting Timed Petri Net Properties for Distributed Simulation Partitioning
 In: Proceedings of the 26 th Hawaii Int. Conf. on Systems Sciences
, 1993
"... This work systematically develops a distributed simulation mechanism based on the optimistic strategy (Time Warp) to study timed transition Petri net (TTPN) models. The approach addresses the problem of partitioning the simulation model into logical processes to be run concurrently on individual pro ..."
Abstract

Cited by 6 (5 self)
 Add to MetaCart
(Show Context)
This work systematically develops a distributed simulation mechanism based on the optimistic strategy (Time Warp) to study timed transition Petri net (TTPN) models. The approach addresses the problem of partitioning the simulation model into logical processes to be run concurrently on individual processing nodes in a distributed memory multiprocessor system. We propose a partitioning such that several transitions together with all their input places are simulated by a single logical process, in order to avoid the substantial overhead induced by a distributed conflict resolution protocol in a message passing environment. Subnets are constructed from the topologic description of the TTPN so that conflict resolution always occurs internally to a logical process, thus involving no communication overhead. Additional aggregation of conflict sets into larger logical simulation processes may increase the balancing of the distributed simulation without decreasing its inherent parallelism if som...