Analyzing Divergence for Nondeterministic Probabilistic Models
Fuente:
arXiv
Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866909442685009920 |
|---|---|
| author | Wu, Hao Fu, Yuxi Long, Huan Xu, Xian Zhang, Wenbo |
| author_facet | Wu, Hao Fu, Yuxi Long, Huan Xu, Xian Zhang, Wenbo |
| contents | Branching and weak probabilistic bisimilarities are two well-known notions capturing behavioral equivalence between nondeterministic probabilistic systems. For probabilistic systems, divergence is of major concern. Recently several divergence-sensitive refinements of branching and weak probabilistic bisimilarities have been proposed in the literature. Both the definitions of these equivalences and the techniques to investigate them differ significantly. This paper presents a comprehensive comparative study on divergence-sensitive behavioral equivalence relations that refine the branching and weak probabilistic bisimilarities. Additionally, these equivalence relations are shown to have efficient checking algorithms. The techniques of this paper might be of independent interest in a more general setting. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2403_00491 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Analyzing Divergence for Nondeterministic Probabilistic Models Wu, Hao Fu, Yuxi Long, Huan Xu, Xian Zhang, Wenbo Logic in Computer Science Branching and weak probabilistic bisimilarities are two well-known notions capturing behavioral equivalence between nondeterministic probabilistic systems. For probabilistic systems, divergence is of major concern. Recently several divergence-sensitive refinements of branching and weak probabilistic bisimilarities have been proposed in the literature. Both the definitions of these equivalences and the techniques to investigate them differ significantly. This paper presents a comprehensive comparative study on divergence-sensitive behavioral equivalence relations that refine the branching and weak probabilistic bisimilarities. Additionally, these equivalence relations are shown to have efficient checking algorithms. The techniques of this paper might be of independent interest in a more general setting. |
| title | Analyzing Divergence for Nondeterministic Probabilistic Models |
| topic | Logic in Computer Science |
| url | https://arxiv.org/abs/2403.00491 |