Advertisement

Testing equivalences and fully abstract models for probabilistic processes

  • Ivan Christoff
Selected Presentations
Part of the Lecture Notes in Computer Science book series (LNCS, volume 458)

Abstract

We present a framework in which the observable behavior of probabilistic processes is distinguished through testing. Probabilistic transition systems are used to model the operational behavior of processes. The observable behavior of processes is studied in terms of probabilities for successful interaction with tests. Based on these probabilities three equivalences are defined. We define three denotational models, and show that each model contains exactly the necessary information for verification of one of the equivalences.

Keywords

Partial Order Observable Event Alternative Definition Label Transition System Observable Behavior 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [Ab 87]
    S. Abramsky. Observation equivalence as a testing equivalence. Theor. Comp. Sci.53, pp 225–241, 1987.Google Scholar
  2. [Ak 89]
    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.Google Scholar
  3. [BK 84]
    J.A. Bergstra, J.W. Klop. Process algebra for synchronous communication. Information and Control60, pp 109–137, 1984.Google Scholar
  4. [BCL 85]
    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.Google Scholar
  5. [Ch 89]
    I. Christoff. Distinguishing probabilistic processes through testing. Manuscript presented at Nordic Workshop on Program Correctness, Uppsala, Sweden, 1989.Google Scholar
  6. [Ch 90]
    I. Christoff. Testing Equivalences for Probabilistic Processes. PhD thesis, Department of Computer Systems, Uppsala University, Uppsala, Sweden, 1990. In preparation.Google Scholar
  7. [DH 84]
    R. De Nicola, M. Hennessy. Testing equivalences for processes. Theor. Comp. Sci.34, pp 83–133, 1984.Google Scholar
  8. [GJS 90]
    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.Google Scholar
  9. [GSST 90]
    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.Google Scholar
  10. [He 88]
    M. Hennessy. Algebraic Theory of Processes, MIT Press, 1988.Google Scholar
  11. [HP 79]
    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 Science74, pp 108–120, 1979.Google Scholar
  12. [Ho 85]
    C.A.R. Hoare. Communicating Sequential Processes. Prentice-Hall, 1985.Google Scholar
  13. [Jo 89]
    B. Jonsson. A fully abstract trace model for dataflow networks. Proc. 16th ACM Symp. on Principles of Programming Languages, pp 155–165, 1989.Google Scholar
  14. [LS 89]
    K.G. Larsen, A. Skou. Bisimulation through probabilistic testing. Proc. 16th ACM Symp. on Principles of Programming Languages, pp 344–352, 1989.Google Scholar
  15. [Mi 80]
    R. Milner. A Calculus of Communicating Systems. Lecture Notes in Computer Science92, 1980.Google Scholar
  16. [Ph 87]
    I. Phillips. Refusal testing. Theor. Comp. Sci.50, pp 241–284, 1987.Google Scholar
  17. [Pl 81]
    G. Plotkin. A Structural Approach to Operational Semantics. Technical Report DAIMI FN-19, Computer Science Department, Aarhus University, Aarhus, Denmark, 1981.Google Scholar
  18. [Pn 85]
    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 Science194, pp 15–32, 1985.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1990

Authors and Affiliations

  • Ivan Christoff
    • 1
  1. 1.Department of Computer SystemsUppsala UniversityUppsalaWeden

Personalised recommendations