Probabilistic metric semantics for a simple language with recursion

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

Volumn 1113, Issue , 1996, Pages 419-430

  Kwiatkowska, Marta ^a   Norman, Gethin ^a  

^a UNIVERSITY OF BIRMINGHAM   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

COMPLETE METRIC SPACE; DENOTATIONAL SEMANTICS; METRIC SEMANTICS; PROBABILISTIC BISIMULATIONS; PROBABILISTIC CHOICES; PROBABILISTIC TREES; REACTIVE PROCESS; SEMANTIC DOMAINS;

SEMANTICS;

EID: 84947901147     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61550-4_167     Document Type: Conference Paper

References (21)

1. P.H.M. America and J.J.M.M. Rutten. Solving reflexive domain equations in a category of complete metric spaces, JCSS, 39, no.3, 1989.
2. J.C.M. Baeten, J.A. Bergstra and S.A. Smolka. Axiomatising probabilistic processes: ACP with generative probability, Proc. Concur’92, LNCS, 630, Springer, 1992.
3. C. Baier and M. Kwiatkowska. Domain equations for probabilistic processes, preprint.
4. I. Christoff. Testing equivalences and fully abstract models for probabilistic processes, Proc. Concur’90, LNCS, 458, Springer, 1990.
5. J.W. de Bakker and J.I. Zucker. Processes and the denotational semantics of concurrency, Information and Control, 1/2, 1984
6. A. Giacalone, C.-C. Jou and S.A. Smolka. Algebraic reasoning for probabilistic concurrent systems, In Proc. Programming Concepts and Methods, IFIP, 1990.
7. M. Große-Rhode and H. Ehrig. Transformation of combined data type and process specifications using projection algebras, LNCS, 430, Springer, 1989.
8. C.A. Hoare. Communicating sequential processes, Prentice Hall, 1985.
9. C. Jones. Probabilistic non-determinism, PhD Thesis, University of Edinburgh, 1990.
10. B. Jonsson and K.G. Larsen. Specification and refinement of probabilistic processes, Proc. IEEE Logic in Computer Science (LICS), 1991.
11. B. Jonsson and Wang Yi. Compositional testing preorders for probabilistic processes, Proc. IEEE Logic in Computer Science (LICS), 1995.
12. C.-C. Jou and S. Smolka. Equivalences, congruences and complete axiomatizations for probabilistic processes, Proc. Concur’90, LNCS, 458, Springer, 1990.
13. D. Kozen. Semantics of probabilistic programs, Proc. IEEE Symposium on Foundations of Computer Science (FOGS), 1979.
14. K.G. Larsen and A. Skou. Bisimulation through probabilistic testing, Information and Computation, 94, 1991.
15. K.G. Larsen and A. Skou. Compositional verification of probabilistic processes, Proc. Concur’92, LNCS, 630, Springer, 1992.
16. R. Milner. Calculi for synchrony and asynchrony, TCS, 25(3), 1983.
17. R. Milner. Communication and concurrency, Prentice Hall, 1989.
18. K. Seidel. Probabilistic communicating processes, TCS, 152, 1995.
19. C. Tofts. A synchronous calculus of relative frequency, Proc. Concur’90, LNCS, 458, Springer, 1990.
20. R.J. van Glabbeek, S.A. Smolka, B. Steffen and C. Tofts. Reactive, generative and stratified models of probabilistic processes, Proc. Concur’92, LNCS, 630, Springer, 1992.
21. S. Yuen, R. Cleaveland, Z. Dayar and S.A. Smolka. Fully abstract characterizations of testing preorders for probabilistic processes, Proc. Concur’94, LNCS, 836, Springer, 1994.