On the Existence and Computability of Long-Run Average Properties in Probabilistic VASS
From MaRDI portal
Publication:2947866
DOI10.1007/978-3-319-22177-9_2zbMath1434.68329MaRDI QIDQ2947866
Publication date: 29 September 2015
Published in: Fundamentals of Computation Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-22177-9_2
68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
Cites Work
- Unnamed Item
- Recursive Markov chains, stochastic grammars, and monotone systems of nonlinear equations
- Eager Markov Chains
- Necessary and sufficient ergodicity condition for open synchronized queueing networks
- Zero-reachability in probabilistic multi-counter automata
- Long-Run Average Behaviour of Probabilistic Vector Addition Systems
- Model Checking Probabilistic Pushdown Automata
- Efficient Analysis of Probabilistic Programs with an Unbounded Counter