Abstract
The π-calculus is a concurrent system invented by Milner et al. in which concurrent computation is expressed as interaction of processes through name-passing. Building on the concept of name-passing, we propose a new concurrent system based on multi-ports, whereas the π-calculus is based on single-ports. Although our trial is not the first one in constructing a concurrent system based on multi-ports, ours is unique in that it is only extended in terms of multi-ports. This simplicity makes it possible to control self-communication of processes. Besides, it is an extension of the π-calculus, because a single-port can be expressed as a restriction in our system. These suggest that the concept of multi-ports is natural. Furthermore, it is more expressive than other calculi including the original π-calculus in spite of this simplicity. Even the strong call-by-name λ-calculus can be embedded into our system with respect to convergence and divergence, while it has not been successfully done into the original π-calculus.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Abadi, M., Cardelli, L., Curien, P.-L., Lévy, J.-J.: Explicit substitutions. In: Proceedings of POPL 1990: the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, pp. 31–46 (1990)
Benaissa, Z.-E.-A., Briaud, D., Lescanne, P., Rouyer-Degli, J.: λν, a calculus of explicit substitutions which preserves strong normalisation. Journal of Functional Programming 6(5), 699–722 (1996)
Bloo, R.: Preservation of strong normalisation for explicit substitution. Computer Science Report 95-08, Eindhoven University of Technology (1995)
Bloo, R., Rose, K.H.: Preservation of strong normalisation in named lambda calculi with explicit substitution and garbage collection. In: Proceedings of CSN 1995: Computer Science in the Netherlands (1995)
Fu, Y.: A proof-theoretical approach to communication. In: Degano, P., Gorrieri, R., Marchetti-Spaccamela, A. (eds.) ICALP 1997. LNCS, vol. 1256, pp. 325–335. Springer, Heidelberg (1997)
Kamareddine, F., Nederpelt, R.: On stepwise explicit substitution. International Journal of Foundations of Computer Science 4(3), 197–240 (1993)
Kamareddine, F., Rios, A.: A lambda-calculus à la De Bruijn with explicit substitutions. In: Swierstra, S.D. (ed.) PLILP 1995. LNCS, vol. 982, pp. 45–62. Springer, Heidelberg (1995)
Merro, M., Sangiorgi, D.: On asynchrony in name-passing calculi. In: Larsen, K.G., Skyum, S., Winskel, G. (eds.) ICALP 1998. LNCS, vol. 1443, p. 856. Springer, Heidelberg (1998)
Milner, R.: Functions as processes. Journal of Mathematical Structures in Computer Science 2(2), 119–141 (1992)
Milner, R.: The polyadic π-calculus: a tutorial. In: Bauer, F.L., Brauer, W., Schwichtenberg, H. (eds.) Logic and Algebra of Specification, pp. 203–246. Springer, Heidelberg (1993)
Milner, R., Parrow, J., Walker, D.: A calculus of mobile processes. Information and Computation 100(1), 1–77 (1992)
Parrow, J., Victor, B.: The update calculus. In: Johnson, M. (ed.) AMAST 1997. LNCS, vol. 1349, pp. 409–423. Springer, Heidelberg (1997)
Parrow, J., Victor, B.: The fusion calculus: Expressiveness and symmetry in mobile processes. In: Proceedings of LICS 1998: the 13th IEEE Symposium on Logic in Computer Science (1998)
Sangiorgi, D.: On the bisimulation proof method. Journal of Mathematical Structures in Computer Science 8(5), 447–479 (1998)
Sangiorgi, D., Milner, R.: The problem of ‘weak bisimulation up to’. In: Cleaveland, W.R. (ed.) CONCUR 1992. LNCS, vol. 630, pp. 32–46. Springer, Heidelberg (1992)
Sato, M., Sakurai, T., Burstall, R.M.: Explicit environments. In: Girard, J.-Y. (ed.) TLCA 1999. LNCS, vol. 1581, pp. 340–354. Springer, Heidelberg (1999)
van Breugel, F.: A labelled transition system for π ε -calculus. In: Bidoit, M., Dauchet, M. (eds.) CAAP 1997, FASE 1997, and TAPSOFT 1997. LNCS, vol. 1214, pp. 312–336. Springer, Heidelberg (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Abe, T. (2004). A Concurrent System of Multi-ported Processes with Causal Dependency. In: Chin, WN. (eds) Programming Languages and Systems. APLAS 2004. Lecture Notes in Computer Science, vol 3302. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30477-7_10
Download citation
DOI: https://doi.org/10.1007/978-3-540-30477-7_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23724-2
Online ISBN: 978-3-540-30477-7
eBook Packages: Springer Book Archive