Sequential dynamics of high order polynomial automata networks: An application to the Erlang fixed-point equations

DOI10.1016/S0096-3003(03)00358-8zbMath1077.68044OpenAlexW1974309601MaRDI QIDQ1826665

Andrew G. Hart, Servet Martínez

Publication date: 6 August 2004

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0096-3003(03)00358-8

zbMATH Keywords

Lyapunov functionalsErlang fixed pointAutomata networksSequential iterationTeletraffic networks

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Unnamed Item
• Loss networks
• On Serial and Parallel Implementations of the Erlang Fixed-Point Iteration Scheme
• Limit theorems for loss networks with diverse routing
• Blocking probabilities in large circuit-switched networks

This page was built for publication: Sequential dynamics of high order polynomial automata networks: An application to the Erlang fixed-point equations