Probabilistic i/o automata: theories of two equivalences

Authors:
Eugene W. Stark;Rance Cleaveland;Scott A. Smolka
Affiliations:
Department of Computer Science, State University of New York at Stony Brook, Stony Brook, NY;Department of Computer Science, University of Maryland, College Park, Maryland;Department of Computer Science, State University of New York at Stony Brook, Stony Brook, NY
Venue:
CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory
Year:
2006

Citing 9
Cited 2

Bisimulation through probabilistic testing

Information and Computation
A compositional approach to performance modelling

A compositional approach to performance modelling
Composition and behaviors of probabilistic I/O automata

Theoretical Computer Science
A formal approach to the integration of performance aspects in the modeling and analysis of concurrent systems

Information and Computation
Process algebra for performance evaluation

Theoretical Computer Science
A Theory of Testing for Markovian Processes

CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
Process Algebra with Probabilistic Choice

ARTS '99 Proceedings of the 5th International AMAST Workshop on Formal Methods for Real-Time and Probabilistic Systems
On behaviour equivalence for probabilistic I/O automata and its relationship to probabilistic bisimulation

Journal of Automata, Languages and Combinatorics - Special issue: Selected papers of the workshop weighted automata: Theory and applications (Dresden University of Technology (Germany), March 4-8, 2002)
Probabilistic i/o automata: theories of two equivalences

CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory

Weighted Bisimulation in Linear Algebraic Form

CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
Probabilistic i/o automata: theories of two equivalences

CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory

Quantified Score

Hi-index	0.00

Visualization

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.