Advertisement

A context dependent equivalence between processes

  • Kim Guldstrand Larsen
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 194)

Abstract

In recent years several equivalences between nondeterministic and concurrent processes have been proposed in order to capture different notions of the extensional behaviour of a process. Usually the equivalences are congruences wrt the process constructing operations in order to support hierarchic development of systems. With the purpose of achieving more flexible hierarchic development methods we suggest parameterizing the equivalences with information about contexts. We carry out the suggestion in full for the bisimulation equivalence, which we parameterize with a special type of context information called environments. As a Main Theorem we offer a useful characterization of the information ordering on environments. Also a Modal Characterization of the parameterized bisimulation equivalence is presented.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Brookes, S. D. and Rounds, W. C. “Behavioural Equivalence relations induced by programming logics.“ LNCS 154 (1983).Google Scholar
  2. 2.
    Dijkstra. Series in Automatic Computation. Volume: A discipline of programming. Prèntice-Hall, 1976.Google Scholar
  3. 3.
    Graf, S. and Sifakis, J. A Modal Characterization of observational congruence on finite terms of CCS. Tech. Rept. Technical Report no. 402, IMAG, 1983. To appear in ICALP'84Google Scholar
  4. 4.
    Hennessy, M. and Plotkin, G. D. “A term Model for CCS.“ LNCS 88 (1980). Proceedings of 9th MFCS ConferenceGoogle Scholar
  5. 5.
    Hennessy, M. A Term model for Synchronous Processes. Tech. Rept. CSR-77-81, University of Edinburgh, Department of Computer Science, 1981.Google Scholar
  6. 6.
    Hennessy, M. and Milner, R. “On Observing Nondeterminism and Concurrency.“ LNCS 85 (1980). Proceedings of 7th ICALPGoogle Scholar
  7. 7.
    Hennessy, M. and Milner, R. Algebraic Laws for Nondeterminism and Concurrency. Tech. Rept. CSR-133-83, University of Edinburgh, Department of Computer Science, 1983. To appear in JACMGoogle Scholar
  8. 8.
    Hoare, C.A.R., Brookes, S.D. and Roscoe, A.W. A Theory of Communicating Sequential Processes. Tech. Rept. PRG-16, Oxford University Computing Laboratory, Programming Research group, 1981.Google Scholar
  9. 9.
    Keller, R. “A fundamental theorem of asynchronous parallel computation.“ Parallel Processing, (1975). Ed. T. Feng, Springer VerlagGoogle Scholar
  10. 10.
    Milner, R. “An Algebraic Definition of Simulation between Programs.“ in: Proc. 2nd International Conference on Artificial Intelligence (1971).Google Scholar
  11. 11.
    Milner, R. “A Calculus of Communicating Systems.“ LNCS 92 (1980).Google Scholar
  12. 12.
    Milner, R. “A modal characterisation of observable machine-behavior.“ LNCS 112 (1981).Google Scholar
  13. 13.
    Milner, R. “A Complete Inference System for a Class of Regular Behaviours.“ CSR-111-82 (1982). University of Edinburgh, Department of Computer ScienceGoogle Scholar
  14. 14.
    Milner, R. “Calculi for Synchrony and Asynchrony.“ Theoretical Computer Science 25 (1983), 267–310.CrossRefGoogle Scholar
  15. 15.
    Nicola, R. de and Hennessy, M. Testing Equivalences for Processes. Tech. Rept. SCR-123-82, University of Edinburgh, Department of Computer Science, 1982.Google Scholar
  16. 16.
    Park, D.J. “Concurrency and Automata on Infinite Sequences.“ LNCS 104 (1981).Google Scholar
  17. 17.
    Plotkin, Gordon D. A Structural Approach to Operational Semantics. Tech. Rept. DAIMI FN-19, Computer Science Department, Aarhus University, Denmark, September, 1981.Google Scholar
  18. 18.
    Stirling, C. A Proof Theoretic Characterization of Observational Equivalence. Tech. Rept. CSR-132-83, University of Edinburgh, Department of Computer Science, 1983. In Proceedings FCT-TCS Bangalore (1983), To appear in TCSGoogle Scholar
  19. 19.
    Stirling, C. A Complete Modal Proof System for a Subset of SCCS. To appear in CAAP'85Google Scholar
  20. 20.
    Stirling, C. A Complete Modal Proof System for a Subset of CCS. To appearGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1985

Authors and Affiliations

  • Kim Guldstrand Larsen
    • 1
  1. 1.Department of Computer ScienceUniversity of EdinburghUK

Personalised recommendations