Abstract
In a process calculus, an agent guarantees responsive usage of a channel name r if a communication along r is guaranteed to eventually take place. Responsiveness is important, for instance, to ensure that any request to a service be eventually replied. We propose two distinct type systems, each of which statically guarantees responsive usage of names in well-typed pi-calculus processes. In the first system, we achieve responsiveness by combining techniques for deadlock and livelock avoidance with linearity and receptiveness. The latter is a guarantee that a name is ready to receive as soon as it is created. These conditions imply relevant limitations on the nesting of actions and on multiple use of names in processes. In the second system, we relax these requirements so as to permit certain forms of nested inputs and multiple outputs.
The first author is supported by the French government research grant ACI TRALALA. The second author is supported by the EU within the FET-GC2 initiative, project SENSORIA.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Acciai, L., Boreale, M.: Responsiveness in Process Calculi. Long version, available at http://www.cmi.univ-mrs.fr/~lucia/PAPIERS/respFull.pdf
Berger, M., Honda, K., Yoshida, N.: Sequentiality and the π-calculus. In: Abramsky, S. (ed.) TLCA 2001. LNCS, vol. 2044, pp. 29–45. Springer, Heidelberg (2001)
Boreale, M.: On the Expressiveness of Internal Mobility in Name-Passing Calculi. Theoretical Computer Science 195(2), 205–226 (1998)
Cook, W.R., Misra, J.: Computation Orchestration: A Basis for Wide-Area Computing. Journal of Software and Systems Modeling (2006), http://www.cs.utexas.edu/~wcook/projects/orc/
Deng, Y., Sangiorgi, D.: Ensuring Termination by Typability. In: Proc. of IFIP TCS, pp.619–632, 2004. Full version in Information and Computation, 204(7), 1045–1082 (2006)
Kobayashi, N.: A type system for lock-free processes. Information and Computation 177(2), 122–159 (2002)
Kobayashi, N.: Type-Based Information Flow Analysis for the Pi-Calculus. Acta Informartica 42(4-5), 291–347 (2005)
Kobayashi, N.: A New Type System for deadlock-Free Processes. In: Baier, C., Hermanns, H. (eds.) CONCUR 2006. LNCS, vol. 4137, Springer, Heidelberg (2006)
Kobayashi, N.: The verb TyPiCal tool, http://www.kb.ecei.tohoku.ac.jp/~koba/typical/
Kobayashi, N., Pierce, B.C., Turner, D.N.: Linearity and the Pi-Calculus. ACM Transactions on Programming Languages and Systems 21(5), 914–947 (1999)
Merro, M., Sangiorgi, D.: On asynchrony in name-passing calculi (Full version in). Mathematical Structures in Computer Science 14(5), 715–767 (2004)
Milner, R.: The polyadic π-calculus: a tutorial. Tec.Rep. LFCS report ECS-LFCS-91-180, 1991. Also in Logic and Algebra of Specification, Springer-Verlag, pp.203-246 (1993)
Sangiorgi, D.: The name discipline of uniform receptiveness. In: Proc. of ICALP, 1997. TCS, 221(1-2), 457-493 (1999)
Sangiorgi, D., Walker, D.: The π-calculus: a Theory of Mobile Processes. Cambridge University Press, Cambridge (2001)
Yoshida, N.: Graph Types for Monadic Mobile Processes. In: Chandru, V., Vinay, V. (eds.) Foundations of Software Technology and Theoretical Computer Science. LNCS, vol. 1180, pp. 371–386. Springer, Heidelberg (1996)
Yoshida, N.: Type-Based Liveness in the Presence of Nontermination and Nondeterminism. MCS Technical Report, 2002-20, University of Leicester (2002)
Yoshida, N., Berger, M., Honda, K.: Strong Normalisation in the π-calculus. In: Proc. of LICS, pp. 311–322. IEEE Computer Society Press, Los Alamitos (2001)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Acciai, L., Boreale, M. (2007). Responsiveness in Process Calculi. In: Okada, M., Satoh, I. (eds) Advances in Computer Science - ASIAN 2006. Secure Software and Related Issues. ASIAN 2006. Lecture Notes in Computer Science, vol 4435. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-77505-8_11
Download citation
DOI: https://doi.org/10.1007/978-3-540-77505-8_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-77504-1
Online ISBN: 978-3-540-77505-8
eBook Packages: Computer ScienceComputer Science (R0)