Abstract
The chi calculus proposed several years ago enjoys some properties unknown from the experience with pi calculus, one of which is the ability to model concurrent computation without the use of prefix combinator. The atomic chi calculus studied in this paper is obtained from polyadic chi calculus by leaving out the prefix operator. This omission is impossible in the pi framework because it would render the input actions of pi useless. This paper focuses on complete systems of strong equivalence relations on finite atomic chi processes. The two equivalence relations investigated in this paper are strong bisimilarity and strong asynchronous bisimilarity. These bisimilarities are required to be closed under substitution on each bisimulation step. By exploring some properties enjoyed by the atomic chi calculus, it is shown that they coincide respectively with their ground counterparts. In the definitions of strong ground bisimilarity and strong asynchronous ground bisimilarity closure under substitution is not explicitly required. Based upon this fact complete systems are given for both relations. The axiomatic systems are novel in that they use none of the prefix, choice and match combinators.
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
S. Abramsky, Proofs as Processes, Theoretical Computer Science, 135, 5–9, 1994.
R. Amadio, I. Castellani, D. Sangiorgi. On Bisimulation for the Asynchronous ir-Calculus. CONCUR’96, Lecture Notes in Computer Science 1119, Springer, 1996.
G. Boudol. Asynchrony and the 7r-calculus. Research Report 1702, INRIA, Sophia-Antipolis, 1992.
Y. Fu. The x-Calculus. Proceedings of the International Conference on Advances in Parallel and Distributed Computing, 74–81, March 19th-21th, Shanghai, IEEE Computer Society Press, 1997.
Y. Fu. A Proof Theoretical Approach to Communications. ICALP’97, 325–335, July 7th-11th, Bologna, Italy, Lecture Notes in Computer Science 1256, Springer, 1997.
Y. Fu. Symmetric 7-Calculus. Journal of Computer Science and Technology, 13: 202–208, 1998.
Y. Fu. Reaction Graphs. Journal of Computer Science and Technology, 13: 510–530, 1998.
Y. Fu. Bisimulation Lattice of Chi Processes. ASIAN’98, December 8–10, Manila, The Philippines, Lecture Notes in Computer Science 1538, Springer, 245–262, 1998.
Y. Fu. Variations on Mobile Processes. Theoretical Computer Science, Vol. 221, 327–368, 1999.
Y. Fu. Open Bisimulations of Chi Processes. CONCUR’99, Eindhoven, The Netherlands, August 24–27, Lecture Notes in Computer Science 1664, 304–319, Springer, 1999.
Y. Fu, Z. Yang. Chi Calculus with Mismatch. CONCUR 2000, 2225 August, Pennsylvenia, USA, Lecture Notes in Computer Science 1877, 596–610, Springer, 2000.
Y. Fu, Z. Yang. The Ground Congruence for Chi Calculus. FST&TCS 2000, December, India, Lecture Notes in Computer Science, Springer, 2000.
J. Girard. Linear Logic, Theoretical Computer Science, 50, 1–102, 1987.
M. Hennessy, R. Milner. Algebraic Laws for Nondeterminism and Concurrency. Journal of ACM, 67: 137–161, 1985.
K. Honda, M. Tokoro. An Object Calculus for Asynchronous Communication. Proc. ECOOP ’91, Geneve, 1991.
C. Laneve, B. Victor. Solos in Concert. ICALP’99, July 11th-15th, Prague, Hungary, Lecture Notes in Computer Science, Springer, 1999.
R. Milner. Communication and Concurrency. Prentice Hall, 1989.
R. Milner, The Polyadic it-Calculus: a Tutorial, Proceedings of the 1991 Marktoberdorf Summer School on Logic and Algebra of Specification, NATO ASI, Series F, Springer, 1993.
R. Milner, J. Parrow, D. Walker. A Calculus of Mobile Processes. Information and Computation, 100: 1–40 (Part I), 41–77 (Part II), Academic Press.
M. Merro, D. Sangiorgi. On Asynchrony in Name-Passing Calculi. ICALP’98, Lecture Notes in Computer Science 1443, Springer, 1998.
J. Parrow, B. Victor. The Update Calculus. AMAST’97, Sydney, December 13–17, 1997.
J. Parrow, B. Victor. The Fusion Calculus: Expressive and Symmetry in Mobile Processes. LICS’98, 1998.
J. Parrow, B. Victor. The Tau-Laws of Fusion. CONCUR’98, Lecture Notes in Computer Science, 1998.
B. Victor, J. Parrow. Concurrent Constraints in the Fusion Calculus. ICALP ’98, Lecture Notes in Computer Science 1443, 455–469, Springer, 1998.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer Science+Business Media New York
About this paper
Cite this paper
Fu, Y. (2001). Axiomatization Without Prefix Combinator. In: Keimel, K., Zhang, GQ., Liu, YM., Chen, YX. (eds) Domains and Processes. Semantic Structures in Computation, vol 1. Springer, Dordrecht. https://doi.org/10.1007/978-94-010-0654-5_12
Download citation
DOI: https://doi.org/10.1007/978-94-010-0654-5_12
Publisher Name: Springer, Dordrecht
Print ISBN: 978-94-010-3859-1
Online ISBN: 978-94-010-0654-5
eBook Packages: Springer Book Archive