Skip to main navigation Skip to search Skip to main content

Composition and behaviors of probabilistic I/O automata

  • Stony Brook University

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

22 Scopus citations

Abstract

We augment the I/O automaton model of Lynch and Tuttle with probability, as a step toward the ultimate goal of obtaining a useful tool for specifying and reasoning about asynchronous probabilistic systems. Our new model, called probabililtic I/O automata, preserves the fundamental properties of the I/O automaton model, such as the asymmetric treatment of input and output and the pleasant notion of asynchronous composition. For the class of probabilistic I/O automata without internal actions, we show that probabili1tic behavior maps, which are an abstract representation of I/O automaton behavior in terms of a certain expectation operator, are compositional and fully abstract with respect to a natural notion of probabilistic testing.

Original languageEnglish
Title of host publicationCONCUR 1994
Subtitle of host publicationConcurrency Theory - 5th International Conference, Proceedings
EditorsBengt Jonsson, Joachim Parrow
PublisherSpringer Verlag
Pages513-528
Number of pages16
ISBN (Print)9783540583295
DOIs
StatePublished - 1994
Event5th International Conference on Concurrency Theory, CONCUR 1994 - Uppsala, Sweden
Duration: Aug 22 1994Aug 25 1994

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume836 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference5th International Conference on Concurrency Theory, CONCUR 1994
Country/TerritorySweden
CityUppsala
Period08/22/9408/25/94

Fingerprint

Dive into the research topics of 'Composition and behaviors of probabilistic I/O automata'. Together they form a unique fingerprint.

Cite this