Markovian Testing and Trace Equivalences Exactly Lump More Than Markovian Bisimilarity

DOI10.1016/j.entcs.2005.12.079zbMath1316.68086MaRDI QIDQ5262954

Marco Bernardo

Publication date: 10 July 2015

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.entcs.2005.12.079

zbMATH Keywords

Markov chain; bisimulation; Markovian process algebra

Mathematics Subject Classification ID

60J20: Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.)

68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)

68Q87: Probability in computer science (algorithm analysis, random structures, phase transitions, etc.)

Related Items

Logical characterization of fluid equivalences

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Bisimulation through probabilistic testing
• Testing equivalences for processes
• Algebraic theory of probabilistic processes.
• Performance measure sensitive congruences for Markovian process algebras
• Testing preorders for probabilistic processes.
• Reactive, generative, and stratified models of probabilistic processes
• Testing equivalence as a bisimulation equivalence
• Non-bisimulation-based Markovian behavioral equivalences
• Comparative branching-time semantics for Markov chains
• Exact and ordinary lumpability in finite Markov chains