Equivalences, congruences, and complete axiomatizations for probabilistic processes

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

Volumn 458 LNCS, Issue , 1990, Pages 367-383

  Jou, Chi Chang ^a   Smolka, Scott A ^a  

^a STONY BROOK UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; OUTAGES; SEMANTICS;

BISIMULATION EQUIVALENCES; COMPLETE AXIOMATIZATIONS; LABELED TRANSITION SYSTEMS; OPERATIONAL SEMANTICS; PROBABILISTIC BISIMULATIONS; PROBABILISTIC PROCESS; PROBABILISTIC PROCESS ALGEBRA; PROCESS EQUIVALENCE;

EQUIVALENCE CLASSES;

EID: 34249875619     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0039071     Document Type: Conference Paper

References (20)

1. S. Brookes, C.A.R. Hoare, A. Roscoe, “A theory of communicating sequential processes”, Journal of ACM, 31:3, 560–599 (1984).
2. J.A. Bergstra, J.W. Klop, “Algebra of communicating processes,” in CWI Monographs, Proceedings of the CWI Symposium on Mathematics and Computer Science (eds. J.W. de Bakker, M. Hazewinkel and J.K. Lenstra), 89–138, North Holland, Amsterdam (1986).
3. J.A. Bergstra, J.W. Klop, E.R. Olderog, “Readies and failures in the algebra of communicating processes,” SIAM Journal of Computing, Vol. 17, 1134–1177 (1988).
4. B. Bloom, A.R. Meyer, “A remark on bisimulation between probabilistic processes,” Logik at Botik, LNCS 363, eds. Meyer & Tsailin, Springer-Verlag (1989).
5. M. Broy, M. Wirsing, “On the algebraic specification of finitary infinite communicating sequential processes,” Working Conference on Formal Description of Programming Concept II, (ed. D. Björner), Germisch, June 1982, 171–196, North-Holland, Amsterdam (1982).
6. Ivan Christoff, “Testing equivalences and fully abstract models for probabilistic,” this volume.
7. C. Jones, G. D. Plotkin, “A Probabilistic powerdomain of evaluations”, Proceedings of 4th Annual Symposium on Logic in Computer Science, 186–195 (1989).
8. R.J. van Glabbeek, “Notes on the methodology of CCS and CSP,” Technical Report CS-R8624, Centre for Mathematics and Computer Science, The Netherlands.
9. R.J. van Glabbeek, “The linear time — branching time spectrum,” this volume.
10. A. Giacalone, C. Jou, S. A. Smolka, “Algebraic reasoning for probabilistic concurrent systems”, Proceedings of Working Conference on Programming Concepts and Methods, IFIP TC 2, Sea of Gallilee, Israel, April 1990.
11. R.J. van Glabbeek, S. A. Smolka, B. Steffen, C. Tofts, “Reactive, generative, and stratified models of probabilistic processes,” IEEE Symp. on Logic in Computer Science, Philadelphia, PA., USA, June 1990.
12. C.A.R. Hoare, Communicating Sequential Processes, Prentice-Hall International (1985).
13. K.G. Larsen, A. Skou, “Bisimulation through probabilistic testing,” Proceedings of 16th ACM Symp. on Principles of Programming Languages, Austin, TX (1989).
14. R. Milner, “Calculi for synchrony and asynchrony,” Theoret. Comput. Science, Vol.25, 267–310 (1983).
15. R. Milner, “A complete inference system for a class of regular behaviours,” Journal of Computer and System Science, Vol. 28, 439–466 (1984).
16. R. Milner, Communication and Concurrency, Prentice Hall International Series in Computer Science, United Kingdom (1989).
17. E. R. Olderog and C.A.R. Hoare, “Specification-oriented semantics for communicating processes,” Proceedings of 10th ICALP, Barcelona, ed. J. Diaz, LNCS 154, 561–572, Springer-Verlag (1983).
18. D. Park, “Concurrency and automata on infinite sequences”, Proc. 5th GI Conference, LNCS 104, Springer-Verlag (1981).
19. G. D. Plotkin, “A structural approach to operational semantics,” Technical Report DAIMI FN-19, Computer Science Department, Aarhus University (1981).
20. M.O. Rabin, “Probabilistic automata,” Information and Control, Vol. 6, 230–245 (1963).