Skip to main content
SpringerLink
Log in

Decoding choice encodings

  • Conference paper
  • First Online:
CONCUR '96: Concurrency Theory (CONCUR 1996)

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

Included in the following conference series:

Abstract

We study two encodings of the asynchronous π-calculus with input-guarded choice into its choice-free fragment. One encoding is divergence-free, but refines the atomic commitment of choice into gradual commitment. The other preserves atomicity, but introduces divergence. The divergent encoding is fully abstract with respect to weak bisimulation, but the more natural divergence-free encoding is not. Instead, we show that it is fully abstract with respect to coupled simulation, a slightly coarser — but still coinductively defined — equivalence that does not enforce bisimilarity of internal branching decisions. The correctness proofs for the two choice encodings exploit the properties of decodings from translations to source terms.

Supported by the DFG, Sonderforschungsbereich 182, project C2, and by the DAAD-programs ARC and HSPII-AUFE.

Supported by the British SERC.

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. R. M. Amadio, I. Castellani, and D. Sangiorgi. On Bisimulations for the Asynchronous π-Calculus. In Proceedings of CONCUR'96 (August 26–29, Pisa, Italy), 1996. This volume.

    Google Scholar 

  2. G. Boudol. Asynchrony and the π-calculus (note). Rapport de Recherche 1702, INRIA Sophia-Antipolis, May 1992.

    Google Scholar 

  3. N. Busi and R. Gorrieri. Distributed Conflicts in Communicating Systems. In P. Ciancarini, O. Nierstrasz, and A. Yonezawa, editors, Object-Based Models and Languages for Concurrent Systems (Bologna, Italy, July 1994), volume 924 of Lecture Notes in Computer Science, pages 49–65. Springer, 1995.

    Google Scholar 

  4. C. Fournet and G. Gonthier. The Reflexive Chemical Abstract Machine and the Join-Calculus. In 23rd Annual Symposium on Principles of Programming Languages (POPL) (St. Petersburg Beach, Florida), pages 372–385. ACM Press, 1996.

    Google Scholar 

  5. R. Glabbeek. The Linear Time — Branching Time Spectrum II: The semantics of sequential systems with silent moves (Extended Abstract). In E. Best, editor, Fourth International Conference on Concurrency Theory (CONCUR '93, Hildesheim), volume 715 of Lecture Notes in Computer Science, pages 66–81. Springer, 1993.

    Google Scholar 

  6. K. Honda. Two Bisimilarities in Ν-Calculus. CS report 92-002, Keio University, 1992. Revised on March 31, 1993.

    Google Scholar 

  7. K. Honda and M. Tokoro. An Object Calculus for Asynchronous Communication. In P. America, editor, ECOOP '91, volume 512 of Lecture Notes in Computer Science, pages 133–147. Springer, 1991.

    Google Scholar 

  8. K. Honda and M. Tokoro. On Asynchronous Communication Semantics. In M. Tokoro, O. Nierstrasz, and P. Wegner, editors, Object-Based Concurrent Computing 1991, volume 612 of Lecture Notes in Computer Science, pages 21–51. Springer, 1992.

    Google Scholar 

  9. K. Honda and N. Yoshida. On Reduction-Based Process Semantics. Theoretical Computer Science, 152(2):437–486, 1995.

    Google Scholar 

  10. K. Honda and N. Yoshida. Combinatory Representation of Mobile Processes. In 21st Annual Symposium on Principles of Programming Languages (POPL), pages 348–360. ACM Press, January 1994.

    Google Scholar 

  11. K. Honda and N. Yoshida. Replication in Concurrent Combinators. In M. Hagiya and J. C. Mitchell, editors, Theoretical Aspects of Computer Software, volume 789 of Lecture Notes in Computer Science, pages 786–805. Springer, 1994.

    Google Scholar 

  12. F. Knabe. A Distributed Protocol for Channel-Based Communication with Choice. Computers and Artificial Intelligence, 12(5):475–490, 1993.

    Google Scholar 

  13. R. Milner, J. Parrow, and D. Walker. A Calculus of Mobile Processes, Part I/II. Information and Computation, 100:1–77, 1992.

    Google Scholar 

  14. K. Mitchell. Implementations of Process Synchronisation and their Analysis. PhD thesis, LFCS, University of Edinburgh, July 1986.

    Google Scholar 

  15. U. Nestmann. PhD thesis. Institut für Mathematische Maschinen und Datenverarbeitung, Friedrich-Alexander-Universität Erlangen-Nürnberg. To appear 1996.

    Google Scholar 

  16. U. Nestmann and B. C. Pierce. Decoding Choice Encodings. Interner Bericht IMMD VII-01/96, Friedrich-Alexander-Universität Erlangen-Nürnberg, Apr. 1996. Available from ftp://ftp.informatik.uni-erlangen.de/local/inf7/papers/Nestmann/. Also as Technical Report 392, University of Cambridge.

    Google Scholar 

  17. J. Parrow and P. Sjödin. Multiway Synchronization Verified with Coupled Simulation. In R. Cleaveland, editor, Third International Conference on Concurrency Theory (CONCUR '92, Stony Brook, NY), volume 630 of Lecture Notes in Computer Science, pages 518–533. Springer, 1992.

    Google Scholar 

  18. J. Parrow and P. Sjödin. The Complete Axiomatization of cs-Congruence. In P. Enjalbert, E. W. Mayr, and K. W. Wagner, editors, STACS '94, volume 775 of Lecture Notes in Computer Science, pages 557–568. Springer, 1994.

    Google Scholar 

  19. B. C. Pierce and D. N. Turner. Concurrent Objects in a Process Calculus. In T. Ito and A. Yonezawa, editors, Theory and Practice of Parallel Programming (TPPP, Sendai, Japan, 1994), volume 907 of Lecture Notes in Computer Science, pages 187–215. Springer, 1995.

    Google Scholar 

  20. B. C. Pierce and D. N. Turner. Pict: A programming language based on the pi-calculus. Technical report in preparation; available electronically, 1996.

    Google Scholar 

  21. J. Reppy. Higher-Order Concurrency. PhD thesis, Cornell University, June 1992. Technical Report TR 92-1285.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Informatik VII, Friedrich-Alexander-Universität Erlangen-Nürnberg, Martensstra\e 3, D-91058, Erlangen

    Uwe Nestmann

  2. Computer Laboratory, University of Cambridge, New Museums Site, Pembroke Street, CB2 3QG, Cambridge

    Benjamin C. Pierce

Authors
  1. Uwe Nestmann
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Benjamin C. Pierce
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Ugo Montanari Vladimiro Sassone

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Nestmann, U., Pierce, B.C. (1996). Decoding choice encodings. In: Montanari, U., Sassone, V. (eds) CONCUR '96: Concurrency Theory. CONCUR 1996. Lecture Notes in Computer Science, vol 1119. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61604-7_55

Download citation

  • DOI: https://doi.org/10.1007/3-540-61604-7_55

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation