跳到主要导航 跳到搜索 跳到主要内容

Formalisation of Probabilistic Testing Semantics in Coq

  • Yuxin Deng*
  • , Jean Francois Monin
  • *此作品的通讯作者
  • Verimag

科研成果: 书/报告/会议事项章节章节同行评审

摘要

Van Breugel et al. [Theor. Comput. Sci. 333(1–2):171–197, 2005] have given an elegant testing framework that can characterise probabilistic bisimulation, but its completeness proof is highly involved. Deng and Feng [Inf. Comput. 257:58–64, 2017] have simplified that result for finite-state processes. The crucial part in the latter work is an algorithm that can construct enhanced tests. We formalise the algorithm and prove its correctness by maintaining a number of subtle invariants in Coq. To support the formalisation, we develop a reusable library for manipulating finite sets. This sets an early example of formalising probabilistic concurrency theory or quantitative aspects of concurrency theory at large, which is a rich field to be pursued.

源语言英语
主期刊名Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
出版商Springer Verlag
276-292
页数17
DOI
出版状态已出版 - 2019

出版系列

姓名Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
11760 LNCS
ISSN(印刷版)0302-9743
ISSN(电子版)1611-3349

指纹

探究 'Formalisation of Probabilistic Testing Semantics in Coq' 的科研主题。它们共同构成独一无二的指纹。

引用此