Abstract
We introduce a simple calculus of probabilistic processes and we apply it as basis for an initial investigation of compositional verification for probabilistic processes. In particular we study the problem of decomposing logical specifications with respect to operators of the calculus. This study identifies a new probabilistic logic, which is needed in order to support decomposition. Complete axiomatizations are offered for both the calculus and the logic.
This work has been supported in part by the Danish Natural Science Research Council through the DART project.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
H Andersen and G Winskel. Compositional Checking of Satisfaction. In Proceedings of CAV '91, 1991.
J. Bergstra and J. Klop. Process algebra for synchronous communication. Information and Control, 60:109–137, 1984.
B. Bloom and A. Meyer. A remark on bisimulation between probabilistic processes. In A. Meyer and M. Taitslin, editors, Logic at Botik '89, volume 363 of Lecture Notes in Computer Science, pages 26–40, 1989.
I. Christoff. Tesing Equivalences for Probabilistic Processes. PhD thesis, Uppsala University, 1990.
R. Cleaveland, S. A. Smolka, and A. Zwarico. Testing Preorders for Probabilistic Processes. To appear in Proceedings of ICALP '92, 1991.
R. Fagin, J. Y. Halpern, and N. Megiddo. A Logic for Reasoning about Probabilities. In Proceedings of LICS '88, pages 410–421, 1988.
A. Giacalone, C. Jou, and S. Smolka. Algebraic Reasoning for Probabilistic Concurrent Systems. In Proceedings of Working Conference on Programming Concetps and Methods. IFIP TC2, 1990.
M. Hennessy. Algebraic Theory of Processes. MIT Press, 1988.
H. Hansson and B. Jonsson. A Calculus for Communicating Systems with Time and Probabilities. In Proc. 11th IEEE Real-Time Systems Symposium, Orlando, Florida, 1990.
M. Hennessy and R. Milner. Algebraic laws for nondeterminism and concurrency. Journal of the Association for Computing Machinery, pages 137–161, 1985.
C. Hoare. Communicating Sequential Processes. Prentice-Hall, 1985.
B. Jonsson and K. G. Larsen. Specification and Refinement of Probabilistic Processes. In Proceedings of LICS '91, 1991.
C. Jones and G. Plotkin. A Probabilistic Powerdomain of Evaluations. In Proceedings of 4th LICS, 1989.
D. Kozen. Semantics of Probabilistic Programs. JCSS, 22, 1981.
D. Kozen. A Probabilistic PDL. In Proceedings 10th ACM POPL, 1983.
K.G. Larsen. Ideal specification formalism = expressivity + compositionality + decidability + testability + ... Lecture Notes in Computer Science, 458, 1990. Invited paper at CONCUR'90.
K. G. Larsen. The Expressive Power of Implicit Specifications. In Proceedings of ICALP '91, 1991.
K.G. Larsen and A. Skou. Bisimulation through probabilistic testing: Preliminary report. In Proceedings 16'th ACM POPL, 1989. Full version in Information and Computation vol 94 no 1, 1991.
K. G. Larsen and L. Xinxin. Compositionality through an Operarional Semantics of Contexts. In Proceedings of ICALP '90,1990. Full version in Journal of Logic Computation, vol. 1 no. 6, pp 761–795, 1991.
R. Milner. Calculi for synchrony and asynchrony. Theoretical Computer Science, 25:267–310, 1983.
R. Milner. Communication and Concurrency. Prentice-Hall, 1989.
A. Pnueli. Linear and branching structures in the semantics and logics of reactive systems. In W. Braur, editor, ICALP '85, volume 194 of Lecture Notes in Computer Science, pages 15–32, 1985.
A. Pnueli and L. Zuck. Verification of Multiprocess Probabilistic Protocols. Distributed Computing, 1, 1986.
A. Skou. Validation of Concurrent Processes, with emphasis of testing. PhD thesis, Aalborg University Centre, 1989.
M. Y. Vardi. Automatic Verification of Probabilistic Concurrent Finite-State Programs. In Proceedings 26th IEEE FOCS, 1985.
R. van Glabbeek, B. Steffen, S.A. Smolka, and C.M.N. Tofts. Reactive, Generative, and Stratified Models of Probabilistic Processes. In Proceedings of LICS '90, 1990.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Larsen, K.G., Skou, A. (1992). Compositional verification of probabilistic processes. In: Cleaveland, W. (eds) CONCUR '92. CONCUR 1992. Lecture Notes in Computer Science, vol 630. Springer, Berlin, Heidelberg . https://doi.org/10.1007/BFb0084809
Download citation
DOI: https://doi.org/10.1007/BFb0084809
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55822-4
Online ISBN: 978-3-540-47293-3
eBook Packages: Springer Book Archive