Analysis of Probabilistic Systems via Generating Functions and Padé Approximation

DOI10.1007/978-3-662-47666-6_7zbMath1440.60071OpenAlexW1190238013MaRDI QIDQ3449467

Michele Boreale

Publication date: 4 November 2015

Published in: Automata, Languages, and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-47666-6_7

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Numerical analysis or methods applied to Markov chains (65C40) Padé approximation (41A21)

Related Items (2)

Algebra, Coalgebra, and Minimization in Polynomial Differential Equations ⋮ Generating functions for probabilistic programs

Uses Software

• Matlab
• PRISM

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the structure of stochastic matrices with a subdominant eigenvalue near 1
• Numerical Methods in Markov Chain Modeling
• Approximation of Large-Scale Dynamical Systems
• The principle of minimized iterations in the solution of the matrix eigenvalue problem

This page was built for publication: Analysis of Probabilistic Systems via Generating Functions and Padé Approximation