This paper is devoted to the notion nondeterminism in general and particularly in stochastic modeling. It discusses how stochastic modeling formalisms can be mapped to a corresponding configuration graph which is convenient for the investigation of nondeterminism phenomena. Algorithms for mapping stochastic models onto configuration graphs are introduced, and two approaches ¿ well-specified check and weak bisimulation ¿ for eliminating nondeterminism are reviewed and related.
|Name||CTIT technical report series|
|Publisher||University of Twente, Centre for Telematics and Information Technology (CTIT)|