On Inductive Characterization for Divergence-sensitive Probabilistic Branching Bisimilarity
Formal Aspects of Computing · 30.06.2026 · 38 (2) · 1-23
DOI: 10.1145/3803544 ↗Kurz gefasst
Fachartikel in der Zeitschrift Formal Aspects of Computing, online erschienen am 04.06.2026. Verfasst von Hao Wu und 4 weiteren Autor:innen. Die Arbeit nennt 24 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: National Natural Science Foundation of China, Shanghai Sailing Program, Science and Technology Commission of Shanghai Municipality.
Abstract (Originalsprache)
Recently a divergence-sensitive branching bisimilarity has been proposed and studied for the randomized CCS model. In this article, we give an equivalent inductive characterization for the bisimilarity, which is a probabilistic extension of the previous work on the non-probabilistic model. Based on the new characterization, a novel polynomial-time verification algorithm for the divergence-sensitive branching bisimilarity is proposed.
Förderung
- National Natural Science Foundation of China
- Shanghai Sailing Program
- Science and Technology Commission of Shanghai Municipality
- Shanghai Pujiang Talents Program
Zitieren
APA
Wu, H., Fu, Y., Long, H., Xu, X., & Zhang, W. (2026). On Inductive Characterization for Divergence-sensitive Probabilistic Branching Bisimilarity. Formal Aspects of Computing, 38(2), 1-23. https://doi.org/10.1145/3803544
Vancouver
Wu H, Fu Y, Long H, Xu X, Zhang W. On Inductive Characterization for Divergence-sensitive Probabilistic Branching Bisimilarity. Formal Aspects of Computing. 2026;38(2):1-23. doi:10.1145/3803544
BibTeX
@article{Wu2026,
author = {Wu, Hao and Fu, Yuxi and Long, Huan and Xu, Xian and Zhang, Wenbo},
title = {On Inductive Characterization for Divergence-sensitive Probabilistic Branching Bisimilarity},
journal = {Formal Aspects of Computing},
year = {2026},
volume = {38},
number = {2},
pages = {1--23},
doi = {10.1145/3803544}
}
EUVIMED