Scalar Outcomes Suffice for Finitary Probabilistic Testing

Yuxin Deng, Rob van Glabbeek, Carroll Morgan, Chenyi Zhang

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract / Description of output

The question of equivalence has long vexed research in concurrency, leading to many different denotational- and bisimulation-based approaches; a breakthrough occurred with the insight that tests expressed within the concurrent framework itself, based on a special ``success action'', yield equivalences that make only inarguable distinctions.
Original languageEnglish
Title of host publicationProgramming Languages and Systems: 16th European Symposium on Programming, ESOP 2007, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS, Braga, Portugal, March 24 - April 1, 2007, Proceedings
EditorsRocco De Nicola
Place of PublicationHeidelberg
PublisherSpringer Berlin Heidelberg
Number of pages16
ISBN (Electronic)978-3-540-71316-6
ISBN (Print)978-3-540-71314-2
Publication statusPublished - 1 Apr 2007
EventThe 16th European Symposium on Programming, 2007 - Braga, Portugal
Duration: 24 Mar 20071 Apr 2007
Conference number: 16

Publication series

NameLecture Notes in Computer Science
PublisherSpringer Berlin, Heidelberg
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


SymposiumThe 16th European Symposium on Programming, 2007
Abbreviated titleESOP 2007


Dive into the research topics of 'Scalar Outcomes Suffice for Finitary Probabilistic Testing'. Together they form a unique fingerprint.

Cite this