Abstract
Theories defined in a process model are formalized and studied. A theory in a process calculus is a set of perpetually available processes with finite interactability, each can be regarded as a service, an agent behind the scene or an axiom. The operational and observational semantics of the theories are investigated. The power of the approach is demonstrated by interpreting the asynchronous π-calculus as a theory, the asynchronous theory, in the π-calculus. A complete axiomatic system is constructed for the asynchronous theory, which gives rise to a proof system for the weak asynchronous bisimilarity of the asynchronous π.
References
[1]
Abramsky, S.: Computational interpretations of linear logic. Theoretical Computer Science 111, 3-57 (1993)
[2]
Amadio, R., Castellani, I., Sangiorgi, D.: On bisimulations for the asynchronous p-calculus. Theoretical Computer Science 195, 291-324 (1998)
[3]
Barendregt, H.: The lambda calculus: Its syntax and semantics. Studies in Logic and Foundations of Mathematics (1984)
[4]
Boudol, G.: Asynchrony and the π-calculus. Technical Report RR-1702, INRIA Sophia-Antipolis (1992)
[5]
Cai, X., Fu, Y.: The λ-calculus in the π-calculus (2010)
[6]
Fu, Y., Lu, H.: On the expressiveness of interaction. Theoretical Computer Science 411, 1387-1451 (2010)
[7]
Fu, Y.: Theory of interaction (2010)
[8]
Fu, Y., Yang, Z.: Tau laws for pi calculus. Theoretical Computer Science 308, 55-130 (2003)
[9]
Fu, Y., Zhu, H.: The name-passing calculus (2010)
[10]
Hyland, M., Ong, L.: pi-calculus, dialogue games and pcf. In: proc. 7th ACM Conference on Functional programming Languages and Computer Architecture (FpCA 1995), pp. 96-107 (1995)
[11]
Honda, K., Tokoro, M.: An object calculus for asynchronous communications. In: America, p. (ed.) ECOOp 1991. LNCS, vol. 512, pp. 133-147. Springer, Heidelberg (1991)
[12]
Honda, K., Tokoro, M.: On asynchronous communication semantics. In: Tokoro, M., Wegner, p., Nierstrasz, O. (eds.) ECOOp-WS 1991. LNCS, vol. 612, pp. 21-51. Springer, Heidelberg (1992)
[13]
Honda, K., Yoshida, M.: On reduction-based process semantics. Theoretical Computer Science 151, 437-486 (1995)
[14]
Lin, H.: Complete inference systems for weak bisimulation equivalences in the π-calculus. In: Mosses, p.D., Schwartzbach, M.I., Nielsen, M. (eds.) CAAp 1995, FASE 1995, and TApSOFT 1995. LNCS, vol. 915, pp. 187-201. Springer, Heidelberg (1995)
[15]
Milner, R.: Communication and Concurrency. prentice Hall, Englewood Cliffs (1989)
[16]
Milner, R.: Functions as processes. Mathematical Structures in Computer Science 2, 119-146 (1992)
[17]
Milner, R., parrow, J., Walker, D.: A calculus of mobile processes. Information and Computation 100, 1-40 (part I), 41-77 (part II) (1992)
[18]
parrow, J., Sangiorgi, D.: Algebraic theories for name-passing calculi. Information and Computation 120, 174-197 (1995)
[19]
Sewell, p.: Nonaxiomatisability of equivalence over finite state processes. Annals of pure and Applied Logic 90, 163-191 (1997)
[20]
Walker, D.: Objects in the p-calculus. Information and Computation 116, 253-271 (1995)
- Theory by process
Recommendations
A process theory of non-monotonic inference
IJCAI'85: Proceedings of the 9th international joint conference on Artificial intelligence - Volume 1Artificial Intelligence needs a formal theory of the process of non-monotonic reasoning. Ideally, such a theory would decide, for every proposition and state of the process, whether the program should believe the proposition in that state, or remain ...
Comments
Information & Contributors
Information
Published In
Publisher
Springer-Verlag
Berlin, Heidelberg
Publication History
Published: 31 August 2010
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 13 Jan 2025