Nghiên cứu về mô hình so sánh đồng thời dựa trên phép tính $$\uppi $$ trong công nghệ máy tính tương lai

Milner, R.: Communicating and mobile systems: the \(\pi \)-calculus. Cambridge University Press, Cambridge (1999) Milner, R.: The polyadic-calculus: a tutorial. In: Bauer, F.L., Brauer, W. (eds.) Logic and Algebra of Specification, pp. 91–180. Springer, Berlin (1993) Milner, R.: The polyadic \(\pi \)-calculus: a tutorial. Theor. Comput. Sci. 198, 239–249 (1997) Bu, H., Zhu, R., Chen, S., Tan, X.: Sorting realization of well-ordered sets based on \(\pi \)-calculus. J. Intell. Fuzzy Syst. 32, 3429–3445 (2017) Bu, H., Chen, S.: The comparison realization of the expressions based on \(\pi \)-calculus. Energy Educ. Sci. Technol. Part A 33, 1281–1296 (2015) Bu, H., Chen, S., Zhu, R., Tan, X.: The \(\pi \)-calculus-based algorithm in concurrency comparison. IJCA 9(5), 331–340 (2016) Bu, H., Chen, S., Zhu, R., Tan, X: A simple modeling and realization based on\(\pi \)-based comparison algorithm. In: International Conference on Advanced Materials and Computer Science 2016 Yandong, W.: Research on formal verification of web services flow based on pi-calculus. Graduation thesis Zhejiang University (2008) Hongye, J.: Verification on the web service composition based on pi-calculus. Graduation thesis Taiyuan University of Technology (2008) Xiaojuan, C.: The expressiveness of \(\pi \)-calculus via programming. Dissertation Shanghai Jiao Tong University (2009) Hao, K.G., Guo, X.Q., Li, X.N.: The pi+ calculus—an extension of the pi calculus for expressing petri nets. Chin. J. Comput. 34(2), 193–203 (2011) Kang, H., Zeng, Y., Liu, Z.: Modeling the mobile communication service based on pi-calculus. J. Commun. 30(4), 11–16 (2009) Liu, X., Walker, D.: A polymorphic type system for the polyadic pi-calculus. In: Proceedings of the 6th International Conference on Concurrency Theory, pp. 103–116. (1995) Pengwei, Y.: WS-BPEL modeling and realization based on \(\pi \)-calculus. Graduation thesis Northwest University (2009) Liu, J., Lin, H.: A complete symbolic bisimulation for full applied pi calculus. Theoret. Comput. 458, 76–112 (2012) Dreier, J., Ene, C., Lafourcade, P., Lakhnech, Y.: On unique decomposition of processes in the applied pi-calculus. In: Proceedings of the 16th International Conference Foundations of Software Science and Computation Structures, FOSSACS’13, vol. 7794, pp. 50–64, LNCS, Rome, Italy (2013) Demangeon, R., Honda, K.: Full abstraction in a subtyped pi-calculus with linear types. In: CONCUR, LNCS vol. 6901, pp. 280–296 (2011) Mostrous, D., Yoshida, N.: Session typing and asynchronous subtyping forthehigher-order \(\pi \)-calculus. Inf. Comput. 241, 227–263 (2015) Dreier, J., Ene, C., Lafourcade, P., Lakhnech, Y.: On the existence and decidability of unique decompositions of processes in the applied \(\pi \) -calculus. Theor. Comput. Sci. 612, 102–125 (2016) Lekshmy, V.G., Bhaskar, J.: Programming smart environments using \(\pi \)-calculus. Proced. Comput. Sci. 46, 884–891 (2015) Liu, J., Wang, J., He, K., Li, X., Liu, F.: Using pi-calculus to model web service interaction. J. Comput. Inf. Syst. 9(5), 1759–1767 (2013) Nabih, A.K., Goma, M.M., Osman, H.S., Aly, G.M.: Modeling, simulation, and control of smart homes using petrinets. Int. J. Smart Home 5(3), 1–4 (2011) Dreier, J., Ene, C., Lafourcade, P., Lakhnech, Y.: On the existence and decidability of unique decompositions of processes in the applied \(\pi \) -calculus. Theor. Comput. Sci. 612, 102–125 (2016) Dreier, J., Lafourcade, P., Lakhnech, Y.: Defining privacy for weighted votes, single and multi-voter coercion. In: Proceedings of the 17th European Symposium on Research in Computer Security, ESORICS’12, vol. 7459 pp. 451–468, LNCS, Pisa, Italy (2012) Dreier, J., Ene, C., Lafourcade, P., Lakhnech, Y.: On unique decomposition of processes in the applied pi-calculus, in: Proceedings of the 16th International Conference Foundations of Software Science and Computation Structures, FOSSACS’13, vol. 7794 pp. 50–64, LNCS, Pisa, Italy (2013)