On the probabilistic bisimulation spectrum with silent moves

DOI10.1007/s00236-020-00379-2zbMath1443.68108OpenAlexW3023415841MaRDI QIDQ2182668

Christel Baier, Holger Hermanns, Pedro R. D'Argenio

Publication date: 26 May 2020

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00236-020-00379-2

Mathematics Subject Classification ID

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)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Probabilistic logical characterization
• Axiomatising infinitary probabilistic weak bisimilarity of finite-state behaviours
• Logics for bisimulation and divergence
• Exploring probabilistic bisimulations. I
• On the semantics of Markov automata
• Weak bisimulation is sound and complete for pCTL\(^*\)
• Bisimulation for labelled Markov processes
• Testing Finitary Probabilistic Processes
• Bisimulations for non-deterministic labelled Markov processes
• Branching Bisimilarity with Explicit Divergence
• Branching time and abstraction in bisimulation semantics
• Logical characterization of bisimulation for transition relations over probability distributions with internal actions
• Bisimulations Meet PCTL Equivalences for Probabilistic Automata

This page was built for publication: On the probabilistic bisimulation spectrum with silent moves