By Topic

Aggregation and reduction techniques for hierarchical GCSPNs

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
$31 $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

1 Author(s)
Buchholz, P. ; Inf. IV, Dortmund Univ., Germany

The classes of stochastic well-formed colored nets (SWNs) and hierarchical generalized colored stochastic Petri nets (HGCSPNs) have been recently introduced for the specification and analysis of complex systems. SWNs allow the specification of models including symmetries in a very compact way and additionally can be used to generate a reduced Markov chain (MC) from the net specification by exploiting symmetries in the model. HGCSPNs allow a modular specification of a net using several smaller parts. This decomposition of the net specification can also be used to handle the state explosion of the underlying MC by describing the generator matrix using only much smaller subnet matrices. The author combines SWNs and HGCSPNs, allowing the automatic generation of a reduced MC from the hierarchical net specification. Approximative aggregation techniques for hierarchical nets are introduced

Published in:

Petri Nets and Performance Models, 1993. Proceedings., 5th International Workshop on

Date of Conference:

19-22 Oct 1993