Abstract
Restricting the power of the schedulers that resolve the nondeterminism in probabilistic concurrent systems has recently drawn the attention of the research community. The goal is to preserve the probabilistic behaviour of systems when composed, and at the same time, to guarantee compositionality for trace-like equivalences. In our previous work, we have defined a model of probabilistic systems with labels on the internal transitions, that restrict the power of the schedulers. A trace-style equivalence for the same model, compatible with a synchronous parallel composition, was proposed. In the present paper we generalize the parallel composition to allow for action interleaving and synchronization on a given set of actions, combined with hiding afterwards. We propose a method for automatic labeling of the internal transitions that arise due to the parallel composition. These labels reflect the information that the components use in order to resolve the nondeterminism in the composition, and thus restrict the power of the schedulers. We show that our equivalence is compositional w.r.t. the parallel composition. We also define operational semantics that, besides the parallel composition, includes deadlock, and four types of choices – action, external, internal, and probabilistic.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Baeten, J.C.M., Bergstra, J.A., Klop, J.W.: Ready-trace semantics for concrete process algebra with the priority operator. The Computer Journal 30(6), 498–506 (1987)
Cazorla, D., Cuartero, F., Valero, V., Pelayo, F.L., Pardo, J.J.: Algebraic theory of probabilistic and nondeterministic processes. Journal of Logic and Algebraic Programming 55(1-2), 57–103 (2003)
Chatzikokolakis, K., Palamidessi, C.: Making random choices invisible to the scheduler. In: Caires, L., Vasconcelos, V.T. (eds.) CONCUR 2007. LNCS, vol. 4703, pp. 42–58. Springer, Heidelberg (2007)
Cheung, L., Lynch, N., Segala, R., Vaandrager, F.: Switched PIOA: Parallel composition via distributed scheduling. Theoret. Comp. Science 365(1-2), 83–108 (2006)
de Alfaro, L., Henzinger, T., Jhala, R.: Compositional methods for probabilistic systems. In: Larsen, K.G., Nielsen, M. (eds.) CONCUR 2001. LNCS, vol. 2154, pp. 351–365. Springer, Heidelberg (2001)
Deng, Y., van Glabbeek, R.J., Hennessy, M., Morgan, C.: Characterising testing preorders for finite probabilistic processes. Logical Methods in Computer Science 4(4:4), 1–33 (2008)
Georgievska, S., Andova, S.: Retaining the probabilities in probabilistic testing theory. In: Ong, L. (ed.) FOSSACS 2010. LNCS, vol. 6014, pp. 79–93. Springer, Heidelberg (2010)
Georgievska, S., Andova, S.: Process theory for probabilistic ready-trace equivalence. Technical Report (2010), http://www.win.tue.nl/~sgeorgie/axioms2010.pdf
Giro, S., D’Argenio, P.: On the expressive power of schedulers in distributed probabilistic systems. In: Proc. QAPL 2009. ENTCS, vol. 253(3), pp. 45–71 (2009)
van Glabbeek, R.J.: The linear time – branching time spectrum I; The semantics of concrete, sequential processes. In: Handbook of Process Algebra, ch. 1, pp. 3–99. Elsevier, Amsterdam (2001)
Hansson, H.A.: Time and Probability in Formal Design of Distributed Systems. Elsevier, Amsterdam (1994)
Hoare, C.A.R.: Communicating Sequential Processes. Prentice-Hall, Englewood Cliffs (1985)
Kwiatkowska, M.Z., Norman, G.J.: A fully abstract metric-space denotational semantics for reactive probabilistic processes. In: Proc. COMPROX 1998. ENTCS, vol. 13 (1998)
Lindley, D.V.: Introduction to Probability and Statistics from a Bayesian Viewpoint. Cambridge University Press, Cambridge (1980)
Lowe, G.: Representing nondeterministic and probabilistic behaviour in reactive processes. Technical Report PRG-TR-11-93. Oxford Univ. Comp. Labs (1993)
Lynch, N., Segala, R., Vaandrager, F.: Observing branching structure through probabilistic contexts. SIAM Journal on Computing 37(4), 977–1013 (2007)
Milner, R.: A Calculus of Communicating Systems. Springer, Heidelberg (1982)
Morgan, C., McIver, A., Seidel, K., Sanders, J.W.: Refinement-oriented probability for CSP. Formal Aspects of Computing 8(6), 617–647 (1996)
Roscoe, A.W.: The Theory and Practice of Concurrency. Prentice-Hall, Englewood Cliffs (1998)
Segala, R.: Modeling and verification of randomized distributed real-time systems. PhD thesis, MIT (1995)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Georgievska, S., Andova, S. (2010). Composing Systems While Preserving Probabilities. In: Aldini, A., Bernardo, M., Bononi, L., Cortellessa, V. (eds) Computer Performance Engineering. EPEW 2010. Lecture Notes in Computer Science, vol 6342. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15784-4_18
Download citation
DOI: https://doi.org/10.1007/978-3-642-15784-4_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-15783-7
Online ISBN: 978-3-642-15784-4
eBook Packages: Computer ScienceComputer Science (R0)