Probabilistic bisimilarity as testing equivalence

DOI10.1016/j.ic.2017.09.014zbMath1380.68293OpenAlexW2756502837MaRDI QIDQ1680507

Yuan Feng, Yu-xin Deng

Publication date: 16 November 2017

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ic.2017.09.014

zbMATH Keywords

modal logictesting equivalenceprobabilistic processesbisimilarity

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)

Related Items (1)

Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Probabilistic logical characterization
• Bisimulation through probabilistic testing
• Testing equivalences for processes
• Approximating labelled Markov processes
• Domain theory, testing and simulation for labelled Markov processes
• Exploring probabilistic bisimulations. I
• Bisimulation for labelled Markov processes
• Testing Finitary Probabilistic Processes
• Algebraic laws for nondeterminism and concurrency
• Characterising Probabilistic Processes Logically
• Testing preorders for probabilistic processes
• Logical Characterizations of Bisimulations for Discrete Probabilistic Systems
• Testing probabilistic automata

This page was built for publication: Probabilistic bisimilarity as testing equivalence