Explainability of probabilistic bisimilarity distances for labelled Markov chains

DOI10.1007/978-3-031-30829-1_14MaRDI QIDQ6091199

Franck Van Breugel, Amgad Rady

Publication date: 24 November 2023

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

Mathematics Subject Classification ID

Theory of computing (68Qxx) Theory of software (68Nxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A pseudometric in supervisory control of probabilistic discrete event systems
• Metrics for labelled Markov processes
• Linear and nonlinear programming.
• Optimal state-space lumping in Markov chains
• A calculus of communicating systems
• Bisimulation through probabilistic testing
• A polynomial time primal network simplex algorithm for minimum cost flows
• Behavioural pseudometrics for nondeterministic probabilistic systems
• Constructive logical characterizations of bisimilarity for reactive probabilistic systems
• Explaining non-bisimilarity in a coalgebraic approach: games and distinguishing formulas
• Logical characterization of branching metrics for nondeterministic probabilistic transition systems
• Recursively defined metric spaces without contraction
• Bisimulation for labelled Markov processes
• A General Framework for Probabilistic Characterizing Formulae
• On the Complexity of Computing Probabilistic Bisimilarity
• Bisimulation Metrics for Continuous Markov Decision Processes
• Game Refinement Relations and Metrics
• Simple O(m logn) Time Markov Chain Lumping
• Computing Probabilistic Bisimilarity Distances via Policy Iteration
• Characterising Probabilistic Processes Logically
• (Metric) Bisimulation Games and Real-Valued Modal Logics for Coalgebras
• Quasilinear-time Computation of Generic Modal Witnesses for Behavioural Inequivalence