Location of Repository

A data structure for the efficient Kronecker solution of GSPNs

By Gianfranco Ciardo and Andrew S. Miner

Abstract

Kronecker-based approaches have been proposed for the solution of structured GSPNs with extremely large state spaces. Representing the transition rate matrix using Kronecker sums and products of smaller matrices virtually eliminates its storage requirements, but introduces various sources of overhead. We show how, by using a new data structure which we call matrix diagrams, we are able to greatly reduce or eliminate many of these overheads, resulting in a very efficient overall solution process

Publisher: IEEE Comp. Soc. Press
Year: 1999
OAI identifier: oai:CiteSeerX.psu:10.1.1.18.8748
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.cs.wm.edu/~ciardo/p... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.