On the Efficient Sequential and Distributed Generation of Very Large Markov Chains from Stochastic Petri Nets

	This Article
	Subscribers, please Login Purchase article: $19 PDF IEEE Xplore Subscribers RSS feed
	Share
	Email this Article to a friend
	Bibliographic References
	ASCII Text BibTex RefWorks Procite/RefMan/Endnote
	Add to:
	Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb
	Search
	Similar Articles Articles by Boudewijn Haverkort Articles by Alexander Bell Articles by Henrik Bohnenkamp

Eighth International Workshop on Petri Nets and Performance Models (PNPM '99)

Zaragoza, Spain

September 08-September 10

ISBN: 0-7695-0331-4

	ASCII Text	x
	Boudewijn Haverkort, Alexander Bell, Henrik Bohnenkamp, "On the Efficient Sequential and Distributed Generation of Very Large Markov Chains from Stochastic Petri Nets," Petri Nets and Performance Models, IEEE International Workshop on, pp. 12, Eighth International Workshop on Petri Nets and Performance Models (PNPM '99), 1999.

	BibTex	x
	@article{ 10.1109/PNPM.1999.796528, author = {Boudewijn Haverkort and Alexander Bell and Henrik Bohnenkamp}, title = {On the Efficient Sequential and Distributed Generation of Very Large Markov Chains from Stochastic Petri Nets}, journal ={Petri Nets and Performance Models, IEEE International Workshop on}, volume = {0}, year = {1999}, issn = {1063-6714}, pages = {12}, doi = {http://doi.ieeecomputersociety.org/10.1109/PNPM.1999.796528}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }

	RefWorks Procite/RefMan/Endnote	x
	TY - CONF JO - Petri Nets and Performance Models, IEEE International Workshop on TI - On the Efficient Sequential and Distributed Generation of Very Large Markov Chains from Stochastic Petri Nets SN - 1063-6714 SP EP A1 - Boudewijn Haverkort, A1 - Alexander Bell, A1 - Henrik Bohnenkamp, PY - 1999 VL - 0 JA - Petri Nets and Performance Models, IEEE International Workshop on ER -

Boudewijn Haverkort, Technische Hochschule Aachen

Alexander Bell, Technische Hochschule Aachen

Henrik Bohnenkamp, Technische Hochschule Aachen

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/PNPM.1999.796528

In this paper we present efficient techniques for the generation of very large continuous-time Markov chains (CTMCs) specified as stochastic Petri nets (SPNs). In particular, we investigate how the storage efficiency of the reachability graph generation can be improved by using good state coding techniques and by using hashing tables instead of tree-based data structures. These techniques allow us to analyze SPNs with almost 55 million states on a single workstation. The size of the SPNs that can be handled is then further enlarged by using a cluster of workstations. With 16 work- stations, connected via a 100 Mbps Ethernet, we can generate reachability graphs with over 400 million states in reasonable time.The presented techniques have been realized in a prototype tool (PARSECS) implemented in C++ using the libraries STL and MPICH. The SPNs to be input to PARSECS are specified using CSPL, known from the tool SPNP.In the paper we present our techniques and study their performance for a number of case studies. We also present comparisons with SPNP.

Citation:

Boudewijn Haverkort, Alexander Bell, Henrik Bohnenkamp, "On the Efficient Sequential and Distributed Generation of Very Large Markov Chains from Stochastic Petri Nets," pnpm, pp.12, Eighth International Workshop on Petri Nets and Performance Models (PNPM '99), 1999

Peer Review Notice | Give Us Feedback

Usage of this product signifies your acceptance of the Terms of Use.