Skip to main content
SpringerLink
Log in

Two fully abstract models for UNITY

  • Conference paper
  • First Online:
Book cover CONCUR'93 (CONCUR 1993)

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

Included in the following conference series:

Abstract

We give two fully abstract models for UNITY. The models are compositional with respect to the parallel composition of UNITY programs (that is, with respect to the UNITY union operator). One model is fully abstract for stutter-free execution sequences and the other model is fully abstract for several property models. The two fully abstract models are different since the model based on properties is more abstract than the sequences model. The fully abstract models yield the best refinement notions for programs that can be used for refinement in context.

This research has been supported by the Foundation for Computer Science in the Netherlands SION under project 612-317-107

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. M. Abadi and L. Lamport. The existence of refinement mappings. In Proc. of the 3rd Annual IEEE Symp. on Logic in Computer Science, pages 165–175, Washington D.C., July 1988. Computer Society Press.

    Google Scholar 

  2. F.S. de Boer, J.N. Kok, C. Palamidessi, and J.J.M.M. Rutten. The failure of failures in a paradigm of asynchronous communication. In J.C.M. Baeten and J.F. Groote, editors, CONCUR '91, Proceedings of the 2nd International Conference on Concurrency Theory, volume 527 of Lecture Notes in Computer Science, pages 111–126. Springer-Verlag, August 1991.

    Google Scholar 

  3. K.M. Chandy and J. Misra. Parallel Program Design — A Foundation. Addison-Wesley Publishing Company, Inc., 1988.

    Google Scholar 

  4. E.W. Dijkstra and C.S. Schölten. Predicate Calculus and Program Semantics. Texts and Monographs in Computer Science. Springer-Verlag, Berlin, 1990.

    Google Scholar 

  5. J. Pachl. Three definitions of leads-to for UNITY. Notes on UNITY, 23–90, December 1990.

    Google Scholar 

  6. B.A. Sanders. Eliminating the substitution axiom from UNITY logic. Formal Aspects of Computing, 3(2):189–205, 1991.

    Article  Google Scholar 

  7. R.T. Udink and J.N. Kok. On the relation between Unity properties and sequences of states. In J.W. de Bakker, W.-P. de Roever, and G. Rozenberg, editors, Semantics: Foundations and Applications, volume 666 of Lecture Notes in Computer Science, pages 594–608. REX Workshop, June 1992, Springer Verlag, 1993. A full version is available as Technical Report RUU-CS-93-07 of Utrecht University.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Utrecht University, P.O. Box 80.089, 3508, TB Utrecht, The Netherlands

    R. T. Udink & J. N. Kok

Authors
  1. R. T. Udink
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. J. N. Kok
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Eike Best

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Udink, R.T., Kok, J.N. (1993). Two fully abstract models for UNITY. In: Best, E. (eds) CONCUR'93. CONCUR 1993. Lecture Notes in Computer Science, vol 715. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57208-2_24

Download citation

  • DOI: https://doi.org/10.1007/3-540-57208-2_24

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-57208-4

  • Online ISBN: 978-3-540-47968-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation