Cost Preserving Bisimulations for Probabilistic Automata

DOI10.1007/978-3-642-40184-8_25zbMath1390.68473arXiv1410.8314OpenAlexW2111119954MaRDI QIDQ5891113

Holger Hermanns, Andrea Turrini

Publication date: 12 August 2013

Published in: CONCUR 2013 – Concurrency Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1410.8314

Mathematics Subject Classification ID

Formal languages and automata (68Q45) 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 (3)

Computing Behavioral Relations for Probabilistic Concurrent Systems ⋮ On divergence-sensitive weak probabilistic bisimilarity ⋮ Polynomial time decision algorithms for probabilistic automata

This page was built for publication: Cost Preserving Bisimulations for Probabilistic Automata