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.
This research was supported in part by the National Science Foundation under Grant CCR-9988155 and the Army Research Office under Grants DAAD190110003 and DAAD190110019. Any opinions, findings, and conclusions or recommendations expressed in this material are those of the author(s) and do not necessarily reflect the views of the National Science Foundation, the Army Research Office, or other sponsors.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Andova, S.: Process Algebra with Probabilistic Choice. In: Katoen, J.-P. (ed.) AMAST-ARTS 1999, ARTS 1999, and AMAST-WS 1999. LNCS, vol. 1601, pp. 111–129. Springer, Heidelberg (1999)
Bernardo, M., Cleaveland, R.: A Theory of Testing for Markovian Processes. In: Palamidessi, C. (ed.) CONCUR 2000. LNCS, vol. 1877, pp. 305–319. Springer, Heidelberg (2000)
Bernardo, M., Donatiello, L., Gorrieri, R.: A formal approach to the integration of performance aspects in the modeling and analysis of concurrent systems. Information and Computation 144(2), 83–154 (1998)
Bernardo, M.: Markovian testing and trace equivalences exactly lump more than Markovian bisimilarity. In: Aceto, L., Gordon, A.D. (eds.) International Workshop on Algebraic Process Calculi: The First Twenty Five Years and Beyond (APC 25). Electronic Notes in Theoretical Computer Science. Springer, Heidelberg (2005)
Katoen, J.-P., Hermanns, H., Herzog, U.: Process algebra for performance evaluation. Theoretical Computer Science 274, 43–97 (2002)
Hillston, J.: A Compositional Approach to Performance Modelling. Cambridge University Press, Cambridge (1996)
Hermanns, H., Rettelbach, M.: Syntax, semantics, equivalences, and axioms for MTIPP (1994)
Larsen, K.G., Skou, A.: Bisimulation through probabilistic testing. Information and Computation 94(1), 1–28 (1991)
Cleaveland, W.R., Smolka, S.A., Stark, E.W.: A Process-Algebraic Language for Probabilistic I/O Automata. In: Amadio, R., Lugiez, D. (eds.) CONCUR 2003. LNCS, vol. 2761, pp. 193–207. Springer, Heidelberg (2003)
Stark, E.W., Cleaveland, R., Smolka, S.A.: Probabilistic I/O automata: Theories of two equivalences (June 2006), Full version available at: http://bsd7.cs.sunysb.edu/~stark/REPORTS/pioa-equivalences.pdf
Stark, E.W.: On behaviour equivalence for probabilistic I/O automata and its relationship to probabilistic bisimulation. Journal of Automata, Languages and Combinatorics 8(2), 361–395 (2003)
Wu, S.-H., Smolka, S.A., Stark, E.W.: Composition and behaviors of probabilistic I/O automata. Theoretical Computer Science 176(1-2), 1–38 (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Stark, E.W., Cleaveland, R., Smolka, S.A. (2006). Probabilistic I/O Automata: Theories of Two Equivalences. In: Baier, C., Hermanns, H. (eds) CONCUR 2006 – Concurrency Theory. CONCUR 2006. Lecture Notes in Computer Science, vol 4137. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11817949_23
Download citation
DOI: https://doi.org/10.1007/11817949_23
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-37376-6
Online ISBN: 978-3-540-37377-3
eBook Packages: Computer ScienceComputer Science (R0)