Complete axiomatization for the bisimilarity distance on Markov chains

DOI10.4230/LIPICS.CONCUR.2016.21zbMATH Open1392.68282MaRDI QIDQ4608673FDOQ4608673

Authors: Giorgio Bacci, Giovanni Bacci, Radu Mardare, Kim G. Larsen 

Publication date: 21 March 2018

Recommendations

• scientific article; zbMATH DE number 6987095
• Algorithms to compute probabilistic bisimilarity distances for labelled Markov chains
• Deciding probabilistic bisimilarity distance one for labelled Markov chains
• Axiomatizing bisimulation equivalences and metrics from probabilistic SOS rules
• scientific article; zbMATH DE number 1754605

zbMATH Keywords

Markov chainsaxiomatizationbehavioral distances

Mathematics Subject Classification ID

Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87) Logic in computer science (03B70) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cited In (6)

• Explainability of probabilistic bisimilarity distances for labelled Markov chains
• Complete axiomatization for the total variation distance of Markov chains
• Deciding probabilistic bisimilarity distance one for labelled Markov chains
• A complete axiomatization of weighted branching bisimulation
• Convex lattice equation systems
• Title not available (Why is that?)

This page was built for publication: Complete axiomatization for the bisimilarity distance on Markov chains

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4608673)