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

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

4 Scopus citations

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.

Original language	English
Title of host publication	Formal Methods for Real-Time and Probabilistic Systems - 5th International AMAST Workshop, ARTS 1999, Proceedings
Editors	Joost-Pieter Katoen, Joost-Pieter Katoen
Publisher	Springer Verlag
Pages	1-18
Number of pages	18
ISBN (Print)	3540660100, 9783540660101
DOIs	https://doi.org/10.1007/3-540-48778-6_1
State	Published - 1999
Externally published	Yes
Event	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, Germany Duration: 26 May 1999 → 28 May 1999

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	1601
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	5th International on Algebraic Methodology And Software Technology, AMAST 1999, held with Workshop on Formal Methods for Real-Time and Probabilistic Systems, ARTS 1999
Country/Territory	Germany
City	Bamberg
Period	26/05/99 → 28/05/99

Access to Document

10.1007/3-540-48778-6_1

Cite this

Jonsson, B., & Yi, W. (1999). Fully abstract characterization of probabilistic may testing. In J.-P. Katoen, & J.-P. Katoen (Eds.), Formal Methods for Real-Time and Probabilistic Systems - 5th International AMAST Workshop, ARTS 1999, Proceedings (pp. 1-18). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 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. editor / Joost-Pieter Katoen ; Joost-Pieter Katoen. Springer Verlag, 1999. pp. 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. in J-P Katoen & J-P Katoen (eds), 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), vol. 1601, Springer Verlag, pp. 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, Germany, 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. ed. / Joost-Pieter Katoen; Joost-Pieter Katoen. Springer Verlag, 1999. p. 1-18 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1601).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

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. In Katoen JP, Katoen JP, editors, Formal Methods for Real-Time and Probabilistic Systems - 5th International AMAST Workshop, ARTS 1999, Proceedings. Springer Verlag. 1999. p. 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

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this