Abstract
We have proposed a new protocol for the multi-threaded processes with choice written in π-calculus[1,2]. This protocol frees the multi-threaded processes from deadlock. It has been defined as transition rules. We have shown why the protocol avoids the deadlock in the multi-threaded processes.
Chapter PDF
Similar content being viewed by others
References
R. Milner. Polyadic π-calculus:a Tutorial. LFCS Report Series ECS-LFCS-91-180, Laboratory for Foundation of Computer Science, 1991.
Milner, R., Parrow, J. G., and Walker, D. J. A calculus of mobile processes. In Information and Computation, 100(1), pages 1–77, 1992.
R. Bagrodia. Synchronization of asynchronous processes in CSP. In ACM Transaction on Programming Languages and Systems, volume 11,No. 4, pages 585–597, 1989.
M. Ben-Ari. Principles of Concurrent and Distributed Programing. In PrenticeHall International(UK) Limited, 1989.
R. Milner D. Berry and D. N. Turner. A semantics for ML concurrency primitive. In POPL’92, pages 119–129, 1992.
Benjamin C. Pierce and David N. Turner. Concurrnet Objects in a Process Calculus. LNCS 907, pp.187–215, proc. TPPP’95, 1995.
Munindar P. Singh. Applying the Mu-Calculus in Planning and Reasoning about Action. Journal of Logic and Computation, 8:425–445, 1998.
G. N. Buckley and A. Silberschatz. An effective implementation for the generalized input-output construct of CSP. In ACM Transactions on Programming Languages and Systems, volume 5,No.2, pages 223–235, 1983.
C. A. R. Hoare. Communicating sequential processes. In Communications of the ACM, volume 21,No.8, pages 666–677, 1985.
E. Horita and K. Mano. Nepi: a network programming language based on the π-calculus. In Proceedings of the 1st International Conference on Coordination Models, Languages adn Applicationos 1996, volume 1061 of LNAI, pages 424–427. Springer, 1996.
E. Horita and K. Mano. Nepi2: a two-level calculus for network programming based on the π-calculus. In IPSJ SIG Notes, 96-PRO-8, pages 43–48, 1996.
E. Horita and K. Mano. Nepi2: a Two-Level Calculus for Network Programming Based on the π-calculus. ECL Technical Report, NTT Software Laboratories, 1997.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Iwata, K., Itabashi, S., Ishii, N. (2001). A Protocol for Multi-threaded Processes with Choice in π-Calculus. In: Alexandrov, V.N., Dongarra, J.J., Juliano, B.A., Renner, R.S., Tan, C.J.K. (eds) Computational Science - ICCS 2001. ICCS 2001. Lecture Notes in Computer Science, vol 2074. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45718-6_16
Download citation
DOI: https://doi.org/10.1007/3-540-45718-6_16
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42233-4
Online ISBN: 978-3-540-45718-3
eBook Packages: Springer Book Archive