Eager Markov Chains
From MaRDI portal
Publication:3522891
DOI10.1007/11901914_5zbMath1161.68466OpenAlexW1521216227MaRDI QIDQ3522891
Noomene Ben Henda, Sven Sandberg, Richard Mayr, Parosh Aziz Abdulla
Publication date: 4 September 2008
Published in: Automated Technology for Verification and Analysis (Search for Journal in Brave)
Full work available at URL: https://www.pure.ed.ac.uk/ws/files/17904331/Esparza_Kucera_ET_AL_2006_Model_Checking_Probabilistic_Pushdown_Automata.pdf
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10)
Related Items (7)
On the Existence and Computability of Long-Run Average Properties in Probabilistic VASS ⋮ Probabilistic total store ordering ⋮ Unnamed Item ⋮ Stochastic Games with Lossy Channels ⋮ Unnamed Item ⋮ Carrying Probabilities to the Infinite World ⋮ Unnamed Item
This page was built for publication: Eager Markov Chains
