On the Relationship Between Bisimulation and Trace Equivalence in an Approximate Probabilistic Context

DOI10.1007/978-3-662-54458-7_19zbMath1486.68108arXiv1701.04547OpenAlexW2573722361MaRDI QIDQ2988377

Gaoang Bian, Alessandro Abate

Publication date: 19 May 2017

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

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

Mathematics Subject Classification ID

Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) 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 (5)

Probabilistic timed automata with clock-dependent probabilities ⋮ Sound approximate and asymptotic probabilistic bisimulations for PCTL ⋮ On the Relationship Between Bisimulation and Trace Equivalence in an Approximate Probabilistic Context ⋮ A probabilistic calculus of cyber-physical systems ⋮ Automated verification and synthesis of stochastic hybrid systems: a survey

Uses Software

• PRISM

Cites Work

• Unnamed Item
• Approximation metrics based on probabilistic bisimulations for general state-space Markov processes: a survey
• Approximate model checking of stochastic hybrid systems
• Bisimulation through probabilistic testing
• Bisimulation for labelled Markov processes
• Adaptive and Sequential Gridding Procedures for the Abstraction and Verification of Stochastic Processes
• On the Complexity of Computing Probabilistic Bisimilarity
• Robust PCTL model checking
• Formula-free finite abstractions for linear temporal verification of stochastic hybrid systems
• On the Relationship Between Bisimulation and Trace Equivalence in an Approximate Probabilistic Context
• Probability Distance Based Compression of Hidden Markov Models
• Representation of systems of measurable sets
• A Compression Algorithm for Probability Transition Matrices
• Exact and ordinary lumpability in finite Markov chains
• Linear Distances between Markov Chains
• Computing Probabilistic Bisimilarity Distances via Policy Iteration
• On the total variation distance of labelled Markov chains
• On Choosing and Bounding Probability Metrics
• Probabilistic Model Checking of Labelled Markov Processes via Finite Approximate Bisimulations
• Probability

This page was built for publication: On the Relationship Between Bisimulation and Trace Equivalence in an Approximate Probabilistic Context