Skip to main content
SpringerLink
Log in
Book cover

International Conference on Concurrency Theory

CONCUR 1995: CONCUR '95: Concurrency Theory pp 219–233Cite as

Axiomatisations of weak equivalences for De Simone languages

  • Session: Process Algebra I
  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 962))

Abstract

Aceto, Bloom and Vaandrager proposed in [ABV92] a procedure for generating a complete axiomatisation of strong bisimulation for process languages in the GSOS format. However, the choice operator +, which the procedure uses, as well as other auxiliary GSOS operators, which it introduces to obtain a finite axiomatisation, do not preserve many of weak equivalences. We propose a modification of this procedure, which works for a subclass of process languages in the De Simone format with a special treatment of silent actions. A choice of such a subclass of process languages guarantees that all the considered and auxiliary operators preserve many of weak equivalences. Our procedure generates a complete axiomatisation of refusal simulation preorder and it can be easily adapted to coarser preorders.The completeness result depends on the completeness result for the basic process language, which we prove. This language does not use prefixing with τ and the choice operator +. Instead, we employ the CSP external and internal choice operators as well as the third choice operator.

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. L. Aceto, B. Bloom, and F.W. Vaandrager. Turning SOS rules into equations. In Proceedings of 7th Annual IEEE Symposium on Logic in Computer Science, Santa Cruz, California, 1992.

    Google Scholar 

  2. L. Aceto. A theory of testing for ACP. In Proceedings of 2nd International Conference CONCUR'91, Amsterdam, The Netherlands, 1991. LNCS 527.

    Google Scholar 

  3. L. Aceto. Deriving complete inteference systems fo a class of GSOS languages generating regular behaviours. In Proceedings of 5th International Conference CONCUR'94, Uppsala, Sweden, 1994. LNCS 789.

    Google Scholar 

  4. L. Aceto and A. Ingólfdóttir. CPO models for a class of GSOS languages. In TAPSOFT'95, Aarhus, Denmark, 1995.

    Google Scholar 

  5. S.D. Brookes, C.A.R. Hoare, and W. Roscoe. A theory of communicating sequential processes. Journal of ACM, Vol. 31, pp. 560–599, 1984.

    Article  Google Scholar 

  6. B. Bloom, S. Istrail, and A.R. Meyer. Bisimulation can't be traced: preliminary report. In Conference Record of the 15th ACM Symposium on Principles of Programming Languages, San Diego, California, 1988.

    Google Scholar 

  7. J.A. Bergstra and J.W. Klop. Process algebra for synchronous communication. Information and Computation, Vol. 60, pp. 109–137, 1984.

    Google Scholar 

  8. B. Bloom. Strong process equivalence in the presence of hidden moves. Preliminary report, MIT, 1990.

    Google Scholar 

  9. B. Bloom. Structural operational semantics for weak bisimulations. Technical Report TR 93-1373, Cornell, 1993. To appear in Theoretical Computer Science.

    Google Scholar 

  10. B. Bloom. Stuctured operational semantics as a specification language. In Conference Record of the 22nd ACM Symposium on Principles of Programming Languages, San Francisco, California, 1995.

    Google Scholar 

  11. J.C.M Baeten and W.P Weijland. Process Algebra. Cambridge Tracts in Theoretical Computer Science, 1990.

    Google Scholar 

  12. R. de Simone. Higher-level synchronising devices in MEIJE-SCCS. Theoretical Computer Science, Vol. 37, pp. 245–267, 1985.

    Article  Google Scholar 

  13. J.F. Groote. Transition system specifications with negative premises. In J.C.M. Baeten and J.W. Klop, editors, Proceedings of CONCUR'90, Berlin, 1990. Springer-Verlag. LNCS 458.

    Google Scholar 

  14. J.F. Groote and F. Vaandrager. Structured operational semantics and bisimulation as a congruence. Information and Computation, Vol. 100, pp. 202–260, 1990.

    Article  Google Scholar 

  15. M. Hennessy. An Algebraic Theory of Processes. The MIT Press, 1988.

    Google Scholar 

  16. C.A.R. Hoare. Communicating Sequential Processes. Prentice Hall, 1985.

    Google Scholar 

  17. R. Milner. Communication and Concurrency. Prentice Hall, 1989.

    Google Scholar 

  18. R. De Nicola and M. Hennessy. CCS without τ's. In H. Ehrig, R. Kowalski, G. Levi, and U. Montanari, editors, TAPSOFT'87, Berlin, 1987. Springer-Verlag. LNCS 250.

    Google Scholar 

  19. I.C.C. Phillips. Refusal testing. Theoretical Computer Science, Vol. 50, 1987.

    Google Scholar 

  20. I. Ulidowski. Equivalences on observable processes. In Proceedings of 7th Annual IEEE Symposium on Logic in Computer Science, Santa Cruz, California, 1992.

    Google Scholar 

  21. I. Ulidowski. Local Testing and Implementable Concurrent Processes. PhD thesis, University of London, 1994.

    Google Scholar 

  22. I. Ulidowski. Axiomatisations of weak equivalences for de Simone languages. Technical report, RIMS, Kyoto University, 1995.

    Google Scholar 

  23. F.W. Vaandrager. On the relationship between process algebra and input/output automata. In Proceedings of 6th Annual IEEE Symposium on Logic in Computer Science, Amsterdam, 1991.

    Google Scholar 

  24. R.J. van Glabbeek. Full abstraction in structured operational semantics. In M. Nivat, C. Rattray, T. Rus, and G. Scollo, editors, Proceedings of the 3rd AMAST Conference. Workshops in Computing, Springer-Verlag, 1993.

    Google Scholar 

  25. R.J. van Glabbeek and F. Vaandrager. Modular specifications of process algebras. Theoretical Computer Science, Vol. 113, pp. 293–348, 1993.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Research Institute for Mathematical Sciences, Kyoto University, Japan

    Irek Ulidowski

Authors
  1. Irek Ulidowski
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Insup Lee Scott A. Smolka

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ulidowski, I. (1995). Axiomatisations of weak equivalences for De Simone languages. In: Lee, I., Smolka, S.A. (eds) CONCUR '95: Concurrency Theory. CONCUR 1995. Lecture Notes in Computer Science, vol 962. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60218-6_16

Download citation

  • DOI: https://doi.org/10.1007/3-540-60218-6_16

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-60218-7

  • Online ISBN: 978-3-540-44738-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation