INFORMS Journal on Computing
HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
 QUICK SEARCH:   [advanced]


     


INFORMS JOURNAL ON COMPUTING
Vol. 10, No. 1, Winter 1998, pp. 82-93
DOI: 10.1287/ijoc.10.1.82
This Article
Right arrow Full Text (PDF)
Right arrow References
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Download to citation manager
Right arrow reprints & permissions
Citing Articles
Right arrow Citing Articles via HighWire
Right arrow Citing Articles via Google Scholar
Google Scholar
Right arrow Articles by Ciardo, G.
Right arrow Articles by Nicol, D.
Right arrow Search for Related Content

Distributed State Space Generation of Discrete-State Stochastic Models

Gianfranco Ciardo, Joshua Gluckman, David Nicol

Department of Computer Science, College of William and Mary, Williamsburg, VA 23187-8795
Department of Computer Science, College of William and Mary, Williamsburg, VA 23187-8795
Department of Computer Science, College of William and Mary, Williamsburg, VA 23187-8795

High-level formalisms such as stochastic Petri nets can be used to model complex systems. Analysis of logical and numerical properties of these models often requires the generation and storage of the entire underlying state space. This imposes practical limitations on the types of systems that can be modeled. Because of the vast amount of memory consumed, we investigate distributed algorithms for the generation of state space graphs. The distributed construction allows us to take advantage of the combined memory readily available on a network of workstations. The key technical problem is to find effective methods for on-the-fly partitioning, so that the state space is evenly distributed among processors. In this article we report on the implementation of a distributed state space generator that may be linked to a number of existing system modeling tools. We discuss partitioning strategies in the context of Petri net models, and report on performance observed on a network of workstations, as well as on a distributed memory multicomputer.

Key words: Probability; Markov processes; networks; graphs; heuristics



This article has been cited by other articles:


Home page
J Logic ComputationHome page
S. Blom, B. Lisser, J. Van De Pol, and M. Weber
A Database Approach to Distributed State-Space Generation
J Logic Computation, March 5, 2009; (2009) exp004v1.
[Abstract] [PDF]




HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
Copyright © 1998 by INFORMS.