A fully abstract view for local cause semantics

Authors:
Jianxin Xue;Xiaoju Dong
Affiliations:
BASICS Lab, Department of Computer Science MOE-MS Key Laboratory for Intelligent Computing and Intelligent Systems, Shanghai Jiao Tong University, Shanghai, China;BASICS Lab, Department of Computer Science MOE-MS Key Laboratory for Intelligent Computing and Intelligent Systems, Shanghai Jiao Tong University, Shanghai, China
Venue:
GPC'12 Proceedings of the 7th international conference on Advances in Grid and Pervasive Computing
Year:
2012

Citing 11
Cited 0

A calculus of mobile processes, II

Information and Computation
Comparing locality and causality based equivalences

Acta Informatica
Non-interleaving semantics for mobile processes

Theoretical Computer Science
Communication and Concurrency

Communication and Concurrency
Proof Systems for Cause Based Equivalences

MFCS '93 Proceedings of the 18th International Symposium on Mathematical Foundations of Computer Science
Locality and True-concurrency in Calculi for Mobile Processes

TACS '94 Proceedings of the International Conference on Theoretical Aspects of Computer Software
Proved Trees

ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming
Back and Forth Bisimulations

CONCUR '90 Proceedings of the Theories of Concurrency: Unification and Extension
A Theory of Process with Localities (Extended Abstract)

CONCUR '92 Proceedings of the Third International Conference on Concurrency Theory
Twenty Years on: Reflections on the CEDISYS Project. Combining True Concurrency with Process Algebra

Concurrency, Graphs and Models
On the expressiveness of interaction

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

Recent technological trends have pushed concurrency and mobile computing to the mainstream. Too many semantics have been proposed to picture the behavior of concurrent systems, and their relationship has been a hot topic in concurrency. We aim in this paper to bridge two important concurrent semantics, the true concurrency semantics and the interleaving semantics, based on the local cause semantics, in the framework of mobile computing. We enrich the polyadic π -calculus with the local cause semantics, and present a fully abstract, finiteness-respecting encoding from the local cause polyadic π -calculus to the polyadic π -calculus. Therefore, the local cause bisimulation is reduced to the observation bisimulation. Moreover, a new decidable approach is proposed for the local cause bisimulation on finite processes.