Efficient descriptor-vector multiplications in stochastic automata networks

DOI10.1145/278298.278303zbMath1065.68578WikidataQ114071314 ScholiaQ114071314MaRDI QIDQ3158510

Paulo Fernandes, William J. Stewart, Brigitte Plateau

Publication date: 25 January 2005

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://hal.inria.fr/inria-00073764/file/RR-2935.pdf

Mathematics Subject Classification ID

68Q45: Formal languages and automata

65F10: Iterative numerical methods for linear systems

68M20: Performance evaluation, queueing, and scheduling in the context of computer systems

Related Items

The Kronecker product and stochastic automata networks, Formal techniques for performance analysis: blending SAN and PEPA, Iterative methods based on splittings for stochastic automata networks, Block SOR for Kronecker structured representations, Aggregation of stochastic automata networks with replicas, On the exact simulation of functionals of stationary Markov chains, Lumpable continuous-time stochastic automata networks., Kronecker representation and decompositional analysis of closed queueing networks with phase-type service distributions and arbitrary buffer sizes, Exploiting interleaving semantics in symbolic state-space generation, Fast simulation for Road Traffic Network, Computational Probability for Systems Biology, Product Form Steady-State Distribution for Stochastic Automata Networks with Domino Synchronizations

Uses Software

• PEPS