Sciweavers

Share
ASMTA
2008
Springer

Perfect Simulation of Stochastic Automata Networks

8 years 4 months ago
Perfect Simulation of Stochastic Automata Networks
The solution of continuous and discrete-time Markovian models is still challenging mainly when we model large complex systems, for example, to obtain performance indexes of parallel and distributed systems. However iterative numerical algorithms, even well-fitted to a multidimensional structured representation of Markov chains, still face the state space explosion problem. Discreteevent simulations can estimate the stationary distribution based on long run trajectories and are also alternative methods to estimate performance indexes of models. Perfect simulation algorithms directly build steady-state samples avoiding the warm-up period and the initial state bias of forward simulations. This paper introduces the concepts of backward coupling and the advantages of monotonicity properties and component-wise characteristics to simulate Stochastic Automata Networks (SAN). The main contribution is a novel technique to solve SAN descriptions originally unsolvable by iterative methods due to l...
Paulo Fernandes, Jean-Marc Vincent, Thais Webber
Added 12 Oct 2010
Updated 12 Oct 2010
Type Conference
Year 2008
Where ASMTA
Authors Paulo Fernandes, Jean-Marc Vincent, Thais Webber
Comments (0)
books