Sorting realization of well-ordered sets based on π -calculus

Abstract

π-calculus is one of the most effective means for the modeling of the concurrent mobile system at the present stage. The paper starts with a brief introduction of π-calculus, which concerns mutual simulation, the fundamentals of mobile computing, and the concept of interaction with some basic grammars and regulations of π-calculus while the system mobility is discussed with special focuses on the relation between the referent and the mobility, and the relation between the granular size and mobility. Then the analysis goes on to discuss the sorting problems that frequently occur in modeling concurrent systems. Through the discussion of the underlying sorting algorithms based on π-calculus, five processes are established by applying such artless thoughts as “looking for the seats in the cinema” or “changing keys among a group” to do quick concurrent locating and instant sorting, so that the sorting problems of specific elements in the well-ordered sets could be solved on the basis of π-calculus. In this way, the sorting results will eventually be displayed in the specified process and conveniently help the readings of other processes.