archives

Stochastic Analysis of Periodic Timed Data Flow Diagrams with Markovian Transition Times


Home 

About 

Browse 

Search 

Register 

Subscriptions 

Deposit Papers 

Help
    

Symanzik, Juergen (1997) Stochastic Analysis of Periodic Timed Data Flow Diagrams with Markovian Transition Times. Technical Report TR96-24, Department of Computer Science, Iowa State University.

Full text available as:Postscript
Adobe PDF

Abstract

Stochastic Analysis of Periodic Timed Data Flow Diagrams
with Markovian Transition Times
Juergen Symanzik
Timed (or Stochastic) Data Flow Diagrams (TDFD's or SDFD's) introduced
in Symanzik and Baker (1996d) are an extension of the Formalized Data
Flow Diagrams, defined in Leavens et al. (1996). This extension allows us
to assess the quantitative behavior (e. g., performance, throughput,
average load of a bubble, etc.) as well as the qualitative behavior
(e. g., deadlock, reachability, termination, finiteness, liveness, etc.),
eventually depending on different types of transition times, for the
system modeled through the TDFD. In this paper, we consider Markovian
transition times for the consumption of in--flow items and for the
production of items on the out--flow. Moreover, we require the TDFD
to be periodic and irreducible and it must have a finite reachability set.
For these models, we have been able to apply an aggregation principle
of Schassberger (1984), extended for periodic Markov chains by Woo (1993),
to efficiently determine stationary probabilities, expected waiting times,
and limiting process probabilities.

Subjects:All uncategorized technical reports
ID code:00000144
Deposited by:Staff Account on 25 April 1997



Contact site administrator at: ssg@cs.iastate.edu