Skip to main content
SpringerLink
Log in

Finite axiom systems for testing preorder and De Simone process languages

  • Conference
  • Conference paper
  • First Online:
Algebraic Methodology and Software Technology (AMAST 1996)

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

Abstract

We propose a procedure for generating finite axiomatisations of testing preorder of De Nicola and Hennessy for De Simone process language. We also prove that testing preorder is preserved by all De Simone process operators. The usefulness of our results is illustrated in specification and verification of a (small) multi-media system. The important features of the system are suspension, resumption and alternation of execution of its components. We argue that the ability to use specially tailored De Simone operators allows to write clear and intuitive specifications. Moreover, the automatically generated axioms for such operators make the verification straightforward.

On leave from the School of Computing, University of North London, England. This work was partially supported by a grant from The Nuffield Foundation.

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

Access this chapter

Log in via an institution

Institutional subscriptions

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 the 7th Annual IEEE Symposium on Logic in Computer Science, Santa Cruz, California, 1992.

    Google Scholar 

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

    Google Scholar 

  3. L. Aceto and A. Ingólfdóttir. CPO models for a class of GSOS languages. In P.D. Mosses, M. Nielsen, and M.I. Schwartzbach, editors, Proceedings of TAPSOFT '95. Springer-Verlag, 1995. LNCS 915.

    Google Scholar 

  4. 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 

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

    Google Scholar 

  6. 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 

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

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

  13. R. De Nicola and M. Hennessy. Testing equivalences for processes. Theoretical Computer Science, Vol. 34, pp. 83–133, 1984.

    Google Scholar 

  14. G. Plotkin. A structural approach to operational semantics. Technical Report DAIMI FN-19, Aarhus University, 1981.

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

  17. I. Ulidowski. Axiomatisations of weak equivalences for De Simone languages. In I. Lee and S.A. Smolka, editors, Proceedings of the 6th International Conference on Concurrency Theory CONCUR'95, Philadelphia, 1995. Springer-Verlag. LNCS 962.

    Google Scholar 

  18. I. Ulidowski. Finite axiom systems for testing preorder and De Simone process languages. Technical report, RIMS, Kyoto University, 1995. Available at http://www.kurims.kyoto-u.ac.jp/∼irek/.

    Google Scholar 

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

    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

Martin Wirsing Maurice Nivat

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ulidowski, I. (1996). Finite axiom systems for testing preorder and De Simone process languages. In: Wirsing, M., Nivat, M. (eds) Algebraic Methodology and Software Technology. AMAST 1996. Lecture Notes in Computer Science, vol 1101. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0014317

Download citation

  • DOI: https://doi.org/10.1007/BFb0014317

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-61463-0

  • Online ISBN: 978-3-540-68595-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation