A Calculus of Truly Concurrent Mobile Processes
Abstract
We make a mixture of Milner's π-calculus and our previous work on truly concurrent process algebra, which is called πtc. We introduce syntax and semantics of πtc, its properties based on strongly truly concurrent bisimilarities. Also, we include an axiomatization of πtc. πtc can be used as a formal tool in verifying mobile systems in a truly concurrent flavor.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.