Fully abstract characterization of probabilistic may testing

Bengt Jonsson; Wang Yi

doi:10.1007/3-540-48778-6_1

Fully abstract characterization of probabilistic may testing

Bengt Jonsson
, Wang Yi

Uppsala University

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

4 引用（Scopus）

摘要

In this paper, to develop a refinement relation for probabilistic and nondeterministic systems, we study a notion of probabilistic testing, that extends the testing framework of de Nicola and Hennessy for nondeterministic processes to the probabilistic setting. We present a model of probabilistic computation trees, which corresponds to the classic trace model for non-probabilistic systems. Our main contribution is a fully abstract characterization of the may-testing preorder which is essential for the probabilistic setting. The characterization is given based on convex closures of probabilistic computation trees.

源语言	英语
主期刊名	Formal Methods for Real-Time and Probabilistic Systems - 5th International AMAST Workshop, ARTS 1999, Proceedings
编辑	Joost-Pieter Katoen, Joost-Pieter Katoen
出版商	Springer Verlag
页	1-18
页数	18
ISBN（印刷版）	3540660100, 9783540660101
DOI	https://doi.org/10.1007/3-540-48778-6_1
出版状态	已出版 - 1999
已对外发布	是
活动	5th International on Algebraic Methodology And Software Technology, AMAST 1999, held with Workshop on Formal Methods for Real-Time and Probabilistic Systems, ARTS 1999 - Bamberg, 德国期限: 26 5月 1999 → 28 5月 1999

出版系列

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

会议

会议	5th International on Algebraic Methodology And Software Technology, AMAST 1999, held with Workshop on Formal Methods for Real-Time and Probabilistic Systems, ARTS 1999
国家/地区	德国
市	Bamberg
时期	26/05/99 → 28/05/99

访问文件

10.1007/3-540-48778-6_1

其它文件与链接

链接到 Scopus 的出版物

引用此

Jonsson, B., & Yi, W. (1999). Fully abstract characterization of probabilistic may testing. 在 J.-P. Katoen, & J.-P. Katoen (编辑), Formal Methods for Real-Time and Probabilistic Systems - 5th International AMAST Workshop, ARTS 1999, Proceedings (页码 1-18). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 卷 1601). Springer Verlag. https://doi.org/10.1007/3-540-48778-6_1

Jonsson, Bengt ; Yi, Wang. / Fully abstract characterization of probabilistic may testing. Formal Methods for Real-Time and Probabilistic Systems - 5th International AMAST Workshop, ARTS 1999, Proceedings. 编辑 / Joost-Pieter Katoen ; Joost-Pieter Katoen. Springer Verlag, 1999. 页码 1-18 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{a07578c2d2c94b69bf3d633102de0929,

title = "Fully abstract characterization of probabilistic may testing",

abstract = "In this paper, to develop a refinement relation for probabilistic and nondeterministic systems, we study a notion of probabilistic testing, that extends the testing framework of de Nicola and Hennessy for nondeterministic processes to the probabilistic setting. We present a model of probabilistic computation trees, which corresponds to the classic trace model for non-probabilistic systems. Our main contribution is a fully abstract characterization of the may-testing preorder which is essential for the probabilistic setting. The characterization is given based on convex closures of probabilistic computation trees.",

author = "Bengt Jonsson and Wang Yi",

note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 1999.; 5th International on Algebraic Methodology And Software Technology, AMAST 1999, held with Workshop on Formal Methods for Real-Time and Probabilistic Systems, ARTS 1999 ; Conference date: 26-05-1999 Through 28-05-1999",

year = "1999",

doi = "10.1007/3-540-48778-6\_1",

language = "英语",

isbn = "3540660100",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "1--18",

editor = "Joost-Pieter Katoen and Joost-Pieter Katoen",

booktitle = "Formal Methods for Real-Time and Probabilistic Systems - 5th International AMAST Workshop, ARTS 1999, Proceedings",

address = "德国",

}

Jonsson, B & Yi, W 1999, Fully abstract characterization of probabilistic may testing. 在 J-P Katoen & J-P Katoen (编辑), Formal Methods for Real-Time and Probabilistic Systems - 5th International AMAST Workshop, ARTS 1999, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 卷 1601, Springer Verlag, 页码 1-18, 5th International on Algebraic Methodology And Software Technology, AMAST 1999, held with Workshop on Formal Methods for Real-Time and Probabilistic Systems, ARTS 1999, Bamberg, 德国, 26/05/99. https://doi.org/10.1007/3-540-48778-6_1

Fully abstract characterization of probabilistic may testing. / Jonsson, Bengt; Yi, Wang.
Formal Methods for Real-Time and Probabilistic Systems - 5th International AMAST Workshop, ARTS 1999, Proceedings. 编辑 / Joost-Pieter Katoen; Joost-Pieter Katoen. Springer Verlag, 1999. 页码 1-18 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 卷 1601).

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

TY - GEN

T1 - Fully abstract characterization of probabilistic may testing

AU - Jonsson, Bengt

AU - Yi, Wang

N1 - Publisher Copyright: © Springer-Verlag Berlin Heidelberg 1999.

PY - 1999

Y1 - 1999

N2 - In this paper, to develop a refinement relation for probabilistic and nondeterministic systems, we study a notion of probabilistic testing, that extends the testing framework of de Nicola and Hennessy for nondeterministic processes to the probabilistic setting. We present a model of probabilistic computation trees, which corresponds to the classic trace model for non-probabilistic systems. Our main contribution is a fully abstract characterization of the may-testing preorder which is essential for the probabilistic setting. The characterization is given based on convex closures of probabilistic computation trees.

AB - In this paper, to develop a refinement relation for probabilistic and nondeterministic systems, we study a notion of probabilistic testing, that extends the testing framework of de Nicola and Hennessy for nondeterministic processes to the probabilistic setting. We present a model of probabilistic computation trees, which corresponds to the classic trace model for non-probabilistic systems. Our main contribution is a fully abstract characterization of the may-testing preorder which is essential for the probabilistic setting. The characterization is given based on convex closures of probabilistic computation trees.

UR - https://www.scopus.com/pages/publications/84957709910

U2 - 10.1007/3-540-48778-6_1

DO - 10.1007/3-540-48778-6_1

M3 - 会议稿件

AN - SCOPUS:84957709910

SN - 3540660100

SN - 9783540660101

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 1

EP - 18

BT - Formal Methods for Real-Time and Probabilistic Systems - 5th International AMAST Workshop, ARTS 1999, Proceedings

A2 - Katoen, Joost-Pieter

PB - Springer Verlag

T2 - 5th International on Algebraic Methodology And Software Technology, AMAST 1999, held with Workshop on Formal Methods for Real-Time and Probabilistic Systems, ARTS 1999

Y2 - 26 May 1999 through 28 May 1999

ER -

Jonsson B, Yi W. Fully abstract characterization of probabilistic may testing. 在 Katoen JP, Katoen JP, 编辑, Formal Methods for Real-Time and Probabilistic Systems - 5th International AMAST Workshop, ARTS 1999, Proceedings. Springer Verlag. 1999. 页码 1-18. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/3-540-48778-6_1

Fully abstract characterization of probabilistic may testing

摘要

出版系列

会议

访问文件

其它文件与链接

学术指纹

引用此