Skip to main content

Advertisement

SpringerLink
Log in

Research on concurrency comparison modeling based on \(\uppi \) calculus in future computer technology

  • Published:
Cluster Computing Aims and scope Submit manuscript

Abstract

\(\uppi \) calculus is an effective tool targeted at the description and modeling of mobile concurrency systems. In this paper, a brief introduction of \(\uppi \) calculus is followed with the discussion on the \(\uppi \)-calculus-based description and modeling of the comparison operation, one of the basic computer operations. According to the two different ways of data storage: the indexed storage and linked-list storage of elements, the paper analyzes the \(\uppi \)-calculus-based formalized description method in the comparison of any two elements. Moreover, a theoretical efficiency analysis is performed on the comparison algorithm of relatively complex linked-list storage of elements in this paper.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10

Similar content being viewed by others

References

  1. Milner, R.: Communicating and mobile systems: the \(\pi \)-calculus. Cambridge University Press, Cambridge (1999)

    MATH  Google Scholar 

  2. 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)

    Google Scholar 

  3. Milner, R.: The polyadic \(\pi \)-calculus: a tutorial. Theor. Comput. Sci. 198, 239–249 (1997)

    Google Scholar 

  4. 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)

    Article  MATH  Google Scholar 

  5. Bu, H., Chen, S.: The comparison realization of the expressions based on \(\pi \)-calculus. Energy Educ. Sci. Technol. Part A 33, 1281–1296 (2015)

    Google Scholar 

  6. Bu, H., Chen, S., Zhu, R., Tan, X.: The \(\pi \)-calculus-based algorithm in concurrency comparison. IJCA 9(5), 331–340 (2016)

    Article  Google Scholar 

  7. 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

  8. Yandong, W.: Research on formal verification of web services flow based on pi-calculus. Graduation thesis Zhejiang University (2008)

  9. Hongye, J.: Verification on the web service composition based on pi-calculus. Graduation thesis Taiyuan University of Technology (2008)

  10. Xiaojuan, C.: The expressiveness of \(\pi \)-calculus via programming. Dissertation Shanghai Jiao Tong University (2009)

  11. 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)

    Article  MathSciNet  Google Scholar 

  12. Kang, H., Zeng, Y., Liu, Z.: Modeling the mobile communication service based on pi-calculus. J. Commun. 30(4), 11–16 (2009)

    Google Scholar 

  13. 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)

  14. Pengwei, Y.: WS-BPEL modeling and realization based on \(\pi \)-calculus. Graduation thesis Northwest University (2009)

  15. Liu, J., Lin, H.: A complete symbolic bisimulation for full applied pi calculus. Theoret. Comput. 458, 76–112 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  16. 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)

  17. Demangeon, R., Honda, K.: Full abstraction in a subtyped pi-calculus with linear types. In: CONCUR, LNCS vol. 6901, pp. 280–296 (2011)

  18. Mostrous, D., Yoshida, N.: Session typing and asynchronous subtyping forthehigher-order \(\pi \)-calculus. Inf. Comput. 241, 227–263 (2015)

    Article  MATH  Google Scholar 

  19. 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)

    Article  MathSciNet  MATH  Google Scholar 

  20. Lekshmy, V.G., Bhaskar, J.: Programming smart environments using \(\pi \)-calculus. Proced. Comput. Sci. 46, 884–891 (2015)

    Article  Google Scholar 

  21. 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)

    Google Scholar 

  22. 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)

    Google Scholar 

  23. 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)

    Article  MathSciNet  MATH  Google Scholar 

  24. 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)

  25. 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)

Download references

Author information

Authors and Affiliations

  1. National Engineering Research Center for Multimedia Software, School of Computer Science, Wuhan University, Wuhan, 430072, China

    Hao Bu, Rong zhu, Shihong Chen & Xiaoqiong Tan

  2. Collaborative Innovation Center of Geospatial Technology, Wuhan, 430072, China

    Hao Bu, Rong zhu & Xiaoqiong Tan

  3. Hubei Key Laboratory of Multimedia and Network Communication Engineering, Wuhan University, Wuhan, 430072, China

    Hao Bu

  4. School of Computer Science, Wuhan University, Wuhan, 430072, China

    Hao Bu & Shihong Chen

Authors
  1. Hao Bu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Rong zhu
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Shihong Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Xiaoqiong Tan
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Rong zhu.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Bu, H., zhu, R., Chen, S. et al. Research on concurrency comparison modeling based on \(\uppi \) calculus in future computer technology. Cluster Comput 22 (Suppl 1), 623–634 (2019). https://doi.org/10.1007/s10586-017-1646-1

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10586-017-1646-1

Keywords

Search

Navigation