Probabilistic I/O automata: Theories of two equivalences

Eugene W. Stark; Rance Cleaveland; Scott A. Smolka

doi:10.1007/11817949_23

Probabilistic I/O automata: Theories of two equivalences

Eugene W. Stark
, Rance Cleaveland
, Scott A. Smolka

Computer Science

Stony Brook University

University of Maryland, College Park

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

1 Scopus citations

Abstract

Working in the context of a process-algebraic language for Probabilistic I/O Automata (PIOA), we study the notion of PIOA behavior equivalence by obtaining a complete axiomatization of its equational theory and comparing the results with a complete axiomatization of a more standard equivalence, weighted bisimulation. The axiomatization of behavior equivalence is achieved by adding to the language an operator for forming convex combinations of terms.

Original language	English
Title of host publication	CONCUR 2006 - Concurrency Theory - 17th International Conference, CONCUR 2006, Proceedings
Publisher	Springer Verlag
Pages	343-357
Number of pages	15
ISBN (Print)	3540373764, 9783540373766
DOIs	https://doi.org/10.1007/11817949_23
State	Published - 2006
Event	17th International Conference on Concurrency Theory, CONCUR 2006 - Bonn, Germany Duration: Aug 27 2006 → Aug 30 2006

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	4137 LNCS

Conference

Conference	17th International Conference on Concurrency Theory, CONCUR 2006
Country/Territory	Germany
City	Bonn
Period	08/27/06 → 08/30/06

Keywords

Complete axiomatizations
Continuous-time Markov chains
Equational theories
Process equivalences
Stochastic process algebras

Access to Document

10.1007/11817949_23

Cite this

Stark, E. W., Cleaveland, R., & Smolka, S. A. (2006). Probabilistic I/O automata: Theories of two equivalences. In CONCUR 2006 - Concurrency Theory - 17th International Conference, CONCUR 2006, Proceedings (pp. 343-357). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4137 LNCS). Springer Verlag. https://doi.org/10.1007/11817949_23

Stark, Eugene W. ; Cleaveland, Rance ; Smolka, Scott A. / Probabilistic I/O automata : Theories of two equivalences. CONCUR 2006 - Concurrency Theory - 17th International Conference, CONCUR 2006, Proceedings. Springer Verlag, 2006. pp. 343-357 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{9163ef57676a4292b88599062a36b9e2,

title = "Probabilistic I/O automata: Theories of two equivalences",

abstract = "Working in the context of a process-algebraic language for Probabilistic I/O Automata (PIOA), we study the notion of PIOA behavior equivalence by obtaining a complete axiomatization of its equational theory and comparing the results with a complete axiomatization of a more standard equivalence, weighted bisimulation. The axiomatization of behavior equivalence is achieved by adding to the language an operator for forming convex combinations of terms.",

keywords = "Complete axiomatizations, Continuous-time Markov chains, Equational theories, Process equivalences, Stochastic process algebras",

author = "Stark, \{Eugene W.\} and Rance Cleaveland and Smolka, \{Scott A.\}",

year = "2006",

doi = "10.1007/11817949\_23",

language = "English",

isbn = "3540373764",

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

publisher = "Springer Verlag",

pages = "343--357",

booktitle = "CONCUR 2006 - Concurrency Theory - 17th International Conference, CONCUR 2006, Proceedings",

note = "17th International Conference on Concurrency Theory, CONCUR 2006 ; Conference date: 27-08-2006 Through 30-08-2006",

}

Stark, EW, Cleaveland, R & Smolka, SA 2006, Probabilistic I/O automata: Theories of two equivalences. in CONCUR 2006 - Concurrency Theory - 17th International Conference, CONCUR 2006, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 4137 LNCS, Springer Verlag, pp. 343-357, 17th International Conference on Concurrency Theory, CONCUR 2006, Bonn, Germany, 08/27/06. https://doi.org/10.1007/11817949_23

Probabilistic I/O automata: Theories of two equivalences. / Stark, Eugene W.; Cleaveland, Rance; Smolka, Scott A.
CONCUR 2006 - Concurrency Theory - 17th International Conference, CONCUR 2006, Proceedings. Springer Verlag, 2006. p. 343-357 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4137 LNCS).

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

TY - GEN

T1 - Probabilistic I/O automata

T2 - 17th International Conference on Concurrency Theory, CONCUR 2006

AU - Stark, Eugene W.

AU - Cleaveland, Rance

AU - Smolka, Scott A.

PY - 2006

Y1 - 2006

N2 - Working in the context of a process-algebraic language for Probabilistic I/O Automata (PIOA), we study the notion of PIOA behavior equivalence by obtaining a complete axiomatization of its equational theory and comparing the results with a complete axiomatization of a more standard equivalence, weighted bisimulation. The axiomatization of behavior equivalence is achieved by adding to the language an operator for forming convex combinations of terms.

AB - Working in the context of a process-algebraic language for Probabilistic I/O Automata (PIOA), we study the notion of PIOA behavior equivalence by obtaining a complete axiomatization of its equational theory and comparing the results with a complete axiomatization of a more standard equivalence, weighted bisimulation. The axiomatization of behavior equivalence is achieved by adding to the language an operator for forming convex combinations of terms.

KW - Complete axiomatizations

KW - Continuous-time Markov chains

KW - Equational theories

KW - Process equivalences

KW - Stochastic process algebras

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

U2 - 10.1007/11817949_23

DO - 10.1007/11817949_23

M3 - Conference contribution

SN - 3540373764

SN - 9783540373766

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

SP - 343

EP - 357

BT - CONCUR 2006 - Concurrency Theory - 17th International Conference, CONCUR 2006, Proceedings

PB - Springer Verlag

Y2 - 27 August 2006 through 30 August 2006

ER -

Stark EW, Cleaveland R, Smolka SA. Probabilistic I/O automata: Theories of two equivalences. In CONCUR 2006 - Concurrency Theory - 17th International Conference, CONCUR 2006, Proceedings. Springer Verlag. 2006. p. 343-357. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/11817949_23

Probabilistic I/O automata: Theories of two equivalences

Abstract

Publication series

Conference

Keywords

Access to Document

Other files and links

Fingerprint

Cite this