Sound approximate and asymptotic probabilistic bisimulations for PCTL

DOI10.46298/lmcs-19(1:22)2023arXiv2111.03117MaRDI QIDQ6135748

Unnamed Author, Maurizio Murgia, Massimo Bartoletti

Publication date: 26 August 2023

Published in: Logical Methods in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2111.03117

zbMATH Keywords

probabilistic processesapproximate bisimulationPCTL

Mathematics Subject Classification ID

Logic in computer science (03B70) Computer science (68-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Weakening the perfect encryption assumption in Dolev-Yao adversaries
• Metrics for labelled Markov processes
• Probabilistic logical characterization
• Bisimulation through probabilistic testing
• Bounded linear logic: A modular approach to polynomial-time computability
• A logic for reasoning about time and reliability
• A behavioural pseudometric for probabilistic transition systems
• Weak bisimulation is sound and complete for pCTL\(^*\)
• Bisimulation for labelled Markov processes
• On the verification of qualitative properties of probabilistic processes under fairness constraints.
• On the Complexity of Computing Probabilistic Bisimilarity
• On session types and polynomial time
• Robust PCTL model checking
• On the Relationship Between Bisimulation and Trace Equivalence in an Approximate Probabilistic Context
• Computing Game Metrics on Markov Decision Processes
• Approximating a Behavioural Pseudometric without Discount for Probabilistic Systems
• Game Refinement Relations and Metrics
• Łukasiewicz μ-calculus
• Computing Probabilistic Bisimilarity Distances via Policy Iteration
• Riesz Modal Logic with Threshold Operators
• Bisimulations Meet PCTL Equivalences for Probabilistic Automata
• Upper-Expectation Bisimilarity and Łukasiewicz μ-Calculus
• The Complexity of Computing a Bisimilarity Pseudometric on Probabilistic Automata
• Automata, Languages and Programming
• Deciding probabilistic bisimilarity distance one for labelled Markov chains

This page was built for publication: Sound approximate and asymptotic probabilistic bisimulations for PCTL