By Topic

Novel formulae for GSPN aggregation

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
J. Freiheit ; Inst. fur Technische Informatik, Technische Univ. Berlin, Germany ; A. Heindl

Stationary analysis of generalized stochastic Petri nets (GSPNs) often suffers from the state space explosion problem. Large reachability sets somorphic to continuous-time Markov chains - are not only expensive to generate, but related high-dimensional data structures also put excessive demands on numerical algorithms. In particular, sequences of transitions and alternative branches contribute multiplicatively to the size of the state space - if enabled concurrently. The paper examines under which circumstances such structures can be merged into a single timed transition while preserving the stationary token distributions in the embedding environment. For these aggregation steps on net level, novel formulae for the (locally) marking-dependent rates of the merged transition are developed, which solely rely on parameters of the aggregated subnet. These formulae bear a strong relation to flow equivalence. Examples throughout the paper demonstrate the gains both in drastically reduced state spaces and shortened processing times of the numerical analysis.

Published in:

Modeling, Analysis and Simulation of Computer and Telecommunications Systems, 2002. MASCOTS 2002. Proceedings. 10th IEEE International Symposium on

Date of Conference: