Testing equivalences and fully abstract models 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 126-138

  Christoff, Ivan ^a  

^a UPPSALA UNIVERSITY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; COMPUTERS;

ABSTRACT MODELS; DENOTATIONAL MODELS; OBSERVABLE BEHAVIOR; OPERATIONAL BEHAVIOR; PROBABILISTIC PROCESS; PROBABILISTIC TRANSITION SYSTEM; TESTING EQUIVALENCE;

ARTIFICIAL INTELLIGENCE;

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

References (18)

1. S. Abramsky. Observation equivalence as a testing equivalence. Theor. Comp. Sci.53, pp 225–241, 1987.
2. N. Akinaga, Decision Procedures for Relations on Probabilistic Transition Systems. MSc thesis, Department of Computer Systems, Uppsala University, Uppsala, Sweden, 1989. Available as report DoCS 89/19.
3. J.A. Bergstra, J.W. Klop. Process algebra for synchronous communication. Information and Control60, pp 109–137, 1984.
4. G. Berry, P.-L. Curien, J.-J. Lévy. Full abstraction for sequential languages: the state of the art. Algebraic Methods in Semantics, eds. M. Nivat and J.C. Reynolds, Cambridge University Press, pp 89–132, 1985.
5. I. Christoff. Distinguishing probabilistic processes through testing. Manuscript presented at Nordic Workshop on Program Correctness, Uppsala, Sweden, 1989.
6. I. Christoff. Testing Equivalences for Probabilistic Processes. PhD thesis, Department of Computer Systems, Uppsala University, Uppsala, Sweden, 1990. In preparation.
7. R. De Nicola, M. Hennessy. Testing equivalences for processes. Theor. Comp. Sci.34, pp 83–133, 1984.
8. A. Giacalone, C.-C. Jou, S.A. Smolka. Algebraic reasoning for probabilistic concurrent systems. Proc. Working Conf. On Programming Concepts and Methods (IFIP TC2), Sea of Galilee, Israel, 1990.
9. R.v. Glabbeek, S.A. Smolka, B. Steffen, C. Tofts. Reactive, generative, and stratified models of probabilistic processes. Proc. 5th IEEE Symp. On Logic in Computer Science, Philadelphia, Pennsylvania, 1990.
10. M. Hennessy. Algebraic Theory of Processes, MIT Press, 1988.
11. M. Hennessy, G. Plotkin. Full abstraction for a simple parallel programming language. Proc. 8th Symp. On Mathematical Foundations of Computer Science, Lecture Notes in Computer Science 74, pp 108–120, 1979.
12. C.A.R. Hoare. Communicating Sequential Processes. Prentice-Hall, 1985.
13. B. Jonsson. A fully abstract trace model for dataflow networks. Proc. 16th ACM Symp. On Principles of Programming Languages, pp 155–165, 1989.
14. K.G. Larsen, A. Skou. Bisimulation through probabilistic testing. Proc. 16th ACM Symp. On Principles of Programming Languages, pp 344–352, 1989.
15. R. Milner. A Calculus of Communicating Systems. Lecture Notes in Computer Science 92, 1980.
16. I. Phillips. Refusal testing. Theor. Comp. Sci.50, pp 241–284, 1987.
17. G. Plotkin. A Structural Approach to Operational Semantics. Technical Report DAIMI FN-19, Computer Science Department, Aarhus University, Aarhus, Denmark, 1981.
18. A. Pnueli. Linear and branching structures in the semantics and logics of reactive systems. Proc. 12th Intl. Coll. On Automata, Languages and Programming, Lecture Notes in Computer Science 194, pp 15–32, 1985.