Compositional reasoning for probabilistic finite-state behaviors

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

Volumn 3838 LNCS, Issue , 2005, Pages 309-337

  Deng, Yuxin ^a   Palamidessi, Catuscia ^b   Pang, Jun ^b  

^a INRIA   (France)

^b ÉCOLE POLYTECHNIQUE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; PROBABILISTIC LOGICS; PROCESS DESIGN; RECURSIVE FUNCTIONS;

BISIMULATION; COMPOSITIONAL REASONING; PROBABILISTIC AUTOMATA; PROCESS ALGEBRA;

FINITE AUTOMATA;

EID: 33847285716     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11601548_17     Document Type: Article

References (35)

1. L. Aceto, Z. Ésik, and A. Ingólfsdóttir. Equational axioms for probabilistic bisimilarity (preliminary report). Technical Report RS-02-6, BRICS, 2002.
2. L. Aceto and W. J. Fokkink. The quest for equational axiomatizations of parallel composition: Status and open problems. In Proceedings of the Workshop on Algebraic Process Calculi: The First Twenty Five Years and Beyond, BRICS Notes Series, 2005. To appear.
3. S. Andova. Probabilistic Process Algebra. PhD thesis, Eindhoven University of Technology, 2002.
4. J. C. M. Baeten, J. A. Bergstra, and S. A. Smolka. Axiomatizing probabilistic processes: ACP with generative probabilities. Information and Computation, 121(2):234-255, 1995.
5. J. C. M. Baeten and M. Bravetti. A ground-complete axiomatization of finite state processes in process algebra. In Proceedings of the 16th International Conference on Concurrency Theory, Lecture Notes in Computer Science, Springer, 2005. To appear.
6. J. C. M. Baeten and W. P. Weijland. Process Algebra, volume 18 of Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, 1990.
7. E. Bandini and R. Segala. Axiomatizations for probabilistic bisimulation. In Proceedings of the 28th International Colloquium on Automata, Languages and Programming, volume 2076 of Lecture Notes in Computer Science, pages 370-381. Springer, 2001.
8. J. A. Bergstra and J. W. Klop. Process algebra for synchronous communications. Information and Control, 60:109-137, 1984.
9. J. A. Bergstra and J. W. Klop. Verification of an alternating bit protocol by means of process algebra. In Proceedings of the International Spring School on Mathematical Methods of Specification and Synthesis of Software Systems, volume 215 of Lecture Notes in Computer Science, pages 9-23. Springer, 1986.
10. J. A. Bergstra and J. W. Klop. A complete inference system for regular processes with silent moves. In Proceedings of Logic Colloquium 1986, pages 21-81. North Holland, Amsterdam, 1988.
11. M. Bravetti and R. Gorrieri. Deciding and axiomatizing weak ST bisimulation for a process algebra with recursion and action refinement. ACM Transactions on Computational Logic, 3(4):465-520, 2002.
12. S. Christensen. Decidability and Decomposition in Process Algebras. PhD thesis, University of Edinburgh, 1993.
13. S. Christensen, Y. Hirshfeld, and F. Moller. Decidable subsets of ces. Computer Journal, 37(4):233-242, 1994.
14. P. R. D'Argenio, H. Hermanns, and J.-P. Katoen. On generative parallel composition. Electronic Notes in Theoretical Computer Science, 22, 1999.
15. Y. Deng. Axiomatisations and types for probabilistic and mobile processes. PhD thesis, Ecole des Mines de Paris, 2005.
16. Y. Deng and C. Palamidessi. Axiomatizations for probabilistic finite-state behaviors. In Proceedings of the 8th International Conference on Foundations of Software Science and Computation Structures, volume 3441 of Lecture Notes in Computer Science, pages 110-124. Springer, 2005.
17. W. J. Fokkink, J. F. Groote, J. Pang, B. Badban, and J. C. van de Pol. Verifying a sliding window protocol in μCRL. In 10th Conference on Algebraic Methodology and Software Technology, Proceedings, volume 3116 of Lecture Notes in Computer Science, pages 148-163. Springer, 2004.
18. A. Giacalone, C.-C. Jou, and S. A. Smolka. Algebraic reasoning for probabilistic concurrent systems. In Proceedings of IFIP WG 2.2/2.3 Working Conference on Programming Concepts and Methods, pages 453-459, 1990.
19. J. F. Groote, A. Ponse, and Y. S. Usenko. Linearization in parallel pCRL. Journal of Logic and Algebraic Programming, 48(1-2):39-72, 2001.
20. M. Hennessy and R. Milner. Algebraic laws for nondeterminism and concurrency. Journal of ACM, 32:137-161, 1985.
21. C. A. R. Hoare. Communicating Sequential Processes. Prentice Hall, 1985.
22. K. G. Larsen and A. Skou. Bisimulation through probabilistic testing. Information and Computation, 94(1):1-28, 1991.
23. K. G. Larsen and A. Skou. Compositional verification of probabilistic processes. In W. R. Cleaveland, editor, CONCUR '92: Third International Conference on Concurrency Theory, volume 630 of Lecture Notes in Computer Science, pages 456-471, Stony Brook, New York, 24-27Aug. 1992. Springer-Verlag.
24. N. A. Lynch, I. Saias, and R. Segala. Proving time bounds for randomized distributed algorithms. In Proceedings of the 13th Annual ACM Symposium on the Principles of Distributed Computing, pages 314-323, 1994.
25. R. Milner. Calculi for synchrony and asynchrony. Theoretical Computer Science, 25:267-310, 1983.
26. R. Milner. A complete inference system for a class of regular behaviours. Journal of Computer and System Science, 28:439-466, 1984.
27. R. Milner. Communication and Concurrency. Prentice-Hall, 1989.
28. R. Milner. A complete axiomatisation for observational congruence of finite-state behaviours. Information and Computation, 81:227-247, 1989.
29. A. Pogosyants, R. Segala, and N. A. Lynch. Verification of the randomized consensus algorithm of Aspnes and Herlihy: a case study. Distributed Computing, 13(3):155-186, 2000.
30. R. Segala and N. A. Lynch. Probabilistic simulations for probabilistic processes. In Proceedings of the 5th International Conference on Concurrency Theory, volume 836 of Lecture Notes in Computer Science, pages 481-496. Springer, 1994.
31. A. Sokolova and E. P. de Vink. Probabilistic automata: system types, parallel composition and comparison. In Validation of Stochastic Systems: A Guide to Current Research, volume 2925 of Lecture Notes in Computer Science, pages 1-43. Springer, 2004.
32. E. W. Stark and S. A. Smolka. A complete axiom system for finite-state probabilistic processes. In Proof, language, and interaction: essays in honour of Robin Milner, pages 571-595. MIT Press, 2000.
33. M. Stoelinga and F. Vaandrager. Root contention in IEEE 1394. In Proceedings of the 5th International AMAST Workshop on Formal Methods for Real-Time and Probabilistic Systems, volume 1601 of Lecture Notes in Computer Science, pages 53-74. Springer, 1999.
34. Y. S. Usenko. Linearization in μCRL. PhD thesis, Edindhoven University of Technology, 2002.
35. R. J. van Glabbeek. A complete axiomatization for branching bisimulation congruence of finite-state behaviours. In Proceedings of the 18th International Symposium on Mathematical Foundations of Computer Science, volume 711 of Lecture Notes in Computer Science, pages 473-484. Springer, 1993.