Confluence Reduction for Markov Automata
From MaRDI portal
Publication:2842675
DOI10.1007/978-3-642-40229-6_17zbMath1390.68419OpenAlexW1507843766WikidataQ62047444 ScholiaQ62047444MaRDI QIDQ2842675
Mark Timmer, Jaco van de Pol, Mariëlle I. A. Stoelinga
Publication date: 16 August 2013
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-40229-6_17
Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)
Related Items
Cost vs. time in stochastic games and Markov automata, Probabilistic bisimulation for realistic schedulers, Long-Run Rewards for Markov Automata, Confluence reduction for Markov automata, Attribute-Based Signatures for Circuits from Bilinear Map, Probabilistic Bisimulation for Realistic Schedulers
