Abstract
Handshake protocols are asynchronous protocols that enforce several properties such as absence of transmission interference and insensitivity from delays of propagation on wires. We propose a concurrent process calculus for handshake protocols. This calculus uses two mechanisms of synchronization: rendez-vous communication à la CCS, and shared resource usage. To enforce the handshake discipline, the calculus is endowed with a typing system.
We provide an LTS semantics of the calculus and show that typed processes denote handshake protocols. We give the calculus another semantics in terms of a special kind of Petri nets called handshake Petri nets. We show that this semantics is complete and fully abstract with respect to weak bisimilarity.
Chapter PDF
Similar content being viewed by others
References
Abramsky, S., Gay, S., Nagarajan, R.: Interaction categories and the foundations of types concurrent programming. In: Proc. of the 1994 Marktoberdorf Summer School on Deductive Program Design, pp. 35–113. Springer, Heidelberg (1996)
Arun-Kumar, S., Hennessy, M.: An efficiency preorder for processes. Acta Informatica 29(9), 737–760 (1992)
Bardsley, A.: Balsa: an asynchronous circuit synthesis system. Master’s thesis. Department of Computer Science, University of Manchester (1998)
Fossati, L.: Modeling the Handshake Protocol for Asynchrony. PhD thesis, Dip. di Informatica, Univ. di Torino & Lab. Preuves Programmes et Systèmes (PPS), Univ. Paris 7 (2009)
Fossati, L., Varacca, D.: The calculus of handshake configurations (extended version) (2008), http://www.di.unito.it/~fossati/
Fossati, L., Varacca, D.: A Petri net model of handshake circuits. In: Proc. of First International Workshop on Interactive Concurrency Experience, ICE 2008. ENTCS. Elsevier, Amsterdam (to be published, 2008), http://www.di.unito.it/~fossati/
Gelernter, D.: Generative communication in Linda. ACM Transactions on Programming Languages and Systems 7(1), 80–112 (1985)
Ghica, D.R.: Geometry of synthesis: a structured approach to VLSI design. In: Proc. of POPL 2007, pp. 363–375. ACM Press, New York (2007)
Josephs, M., Udding, J., Yantchev, Y.: Handshake algebra. Technical Report SBU-CISM-93-1, School of Computing, Information Systems and Mathematics, South Bank University, London (1993)
Kobayashi, N., Pierce, B., Turner, D.: Linearity and the π-calculus. ACM Transactions on Programming Languages and Systems 21(5), 914–947 (1999)
Mackie, I.: The geometry of interaction machine. In: Proc. of POPL 1995, pp. 198–208. ACM Press, New York (1995)
Milner, R.: Communication and Concurrency, 2nd edn. Prentice-Hall, Englewood Cliffs (1991)
Milner, R., Sangiorgi, D.: Techniques for “weak bisimulation up-to”. Revised version of a paper that appeared in: Cleaveland, W.R. (ed.) CONCUR 1992. LNCS, vol. 630. Springer, Heidelberg (1992); available on Sangiorgi’s webpage
Reisig, W.: Petri Nets: An Introduction. Monographs in Theoretical Computer Science. An EATCS Series, vol. 4. Springer, Heidelberg (1985)
Roscoe, A.W.: Unbounded nondeterminism in CSP. Journal of Logic and Computation 3(2), 131–172 (1993); Previously appeared in Two Papers on CSP, tech. monograph PRG-67, Oxford University Computing Laboratory(July 1988)
Udding, J.: Classification and Composition of Delay-Insensitive Circuits. PhD thesis, Department of Math. and C.S., Eindhoven University of Technology, Eindhoven (1984)
Van Berkel, K.: Handshake Circuits: an Asynchronous Architecture for VLSI Design. Cambridge International Series on Parallel Computation, vol. 5. Cambridge University Press, Cambridge (1993)
Yoshida, N., Honda, K., Berger, M.: Linearity and bisimulation. In: Nielsen, M., Engberg, U. (eds.) FOSSACS 2002. LNCS, vol. 2303, pp. 417–433. Springer, Heidelberg (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fossati, L., Varacca, D. (2009). The Calculus of Handshake Configurations. In: de Alfaro, L. (eds) Foundations of Software Science and Computational Structures. FoSSaCS 2009. Lecture Notes in Computer Science, vol 5504. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-00596-1_17
Download citation
DOI: https://doi.org/10.1007/978-3-642-00596-1_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-00595-4
Online ISBN: 978-3-642-00596-1
eBook Packages: Computer ScienceComputer Science (R0)