Now showing items 1-3 of 3

    • Iterative methods based on splittings for stochastic automata networks 

      Uysal, E.; Dayar T. (1998)
      This paper presents iterative methods based on splittings (Jacobi, Gauss-Seidel, Successive Over Relaxation) and their block versions for Stochastic Automata Networks (SANs). These methods prove to be better than the power ...
    • Lumpable continuous-time stochastic automata networks 

      Gusak, O.; Dayar, T.; Fourneau, J. M. (Elsevier, 2003-07-16)
      The generator matrix of a continuous-time stochastic automata network (SAN) is a sum of tensor products of smaller matrices, which may have entries that are functions of the global state space. This paper specifies easy ...
    • Stochastic automata networks and near complete decomposability 

      Gusak, O.; Dayar T.; Fourneau, J. M. (SIAM, 2002)
      Stochastic automata networks (SANs) have been developed and used in the last fifteen years as a modeling formalism for large systems that can be decomposed into loosely connected components. In this work, we extend the ...