A unifying approach to probabilistic testing equivalences
Theoretical Computer Science · 2026-06 · 1075 · 115928
DOI: 10.1016/j.tcs.2026.115928 ↗Kurz gefasst
Fachartikel in der Zeitschrift Theoretical Computer Science, 2026-06. Verfasst von Weijun Chen und 3 weiteren Autor:innen. Die Arbeit nennt 39 Literaturangaben. Gefördert von: National Natural Science Foundation of China.
Abstract (Originalsprache)
Probabilistic concurrent systems are foundational models for modern mobile computing. In this paper, a unifying approach to probabilistic testing equivalences is proposed. With the help of a new distribution-based semantics for probabilistic models and a probabilistic testing framework with respect to process predicates, the internal characterization and the external characterization for testing equivalences are studied. The latter characterization can be viewed as the generalization of the classical fair/should equivalence and may equivalence. These equivalences are shown to be congruences. A thorough comparison between these equivalences and probabilistic bisimilarities is carried out. The techniques introduced in this paper can be easily extended to other probabilistic concurrent models. To showcase this flexibility, a case study is carried out on the pCSP model.
Förderung
- National Natural Science Foundation of China
Zitieren
APA
Chen, W., Fu, Y., Long, H., & Wu, H. (2026). A unifying approach to probabilistic testing equivalences. Theoretical Computer Science, 1075, 115928. https://doi.org/10.1016/j.tcs.2026.115928
Vancouver
Chen W, Fu Y, Long H, Wu H. A unifying approach to probabilistic testing equivalences. Theoretical Computer Science. 2026;1075:115928. doi:10.1016/j.tcs.2026.115928
BibTeX
@article{Chen2026,
author = {Chen, Weijun and Fu, Yuxi and Long, Huan and Wu, Hao},
title = {A unifying approach to probabilistic testing equivalences},
journal = {Theoretical Computer Science},
year = {2026},
volume = {1075},
pages = {115928},
doi = {10.1016/j.tcs.2026.115928}
}
EUVIMED