Approximating Markovian testing equivalence

DOI10.1016/J.TCS.2011.07.019zbMath1234.68315OpenAlexW2017994823MaRDI QIDQ764291

Alessandro Aldini

Publication date: 13 March 2012

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

Full work available at URL: https://doi.org/10.1016/j.tcs.2011.07.019

zbMATH Keywords

process algebraapproximate equivalenceMarkovian testing equivalence

Mathematics Subject Classification ID

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 (1)

Back to the format: a survey on SOS for probabilistic processes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Metrics for labelled Markov processes
• A behavioural pseudometric for probabilistic transition systems
• A Polynomial-Time Algorithm for the Equivalence of Probabilistic Automata
• Rate-Based Transition Systems for Stochastic Process Calculi
• Structural Operational Semantics for Stochastic Process Calculi
• Compatibility and inheritance in software architectures

This page was built for publication: Approximating Markovian testing equivalence