Relationally Staged Computations in Calculi of Mobile Processes

Authors:
Neil Ghani;Kidane Yemane;Björn Victor
Affiliations:
Dept. of Mathematics and Computer Science, University of Leicester, University Road, Leicester, LE1 7RH, United Kingdom;Dept. of Information Technology, Uppsala University, Box 337, S-751 05 Uppsala, Sweden;Dept. of Information Technology, Uppsala University, Box 337, S-751 05 Uppsala, Sweden
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2004

Citing 16
Cited 8

A calculus of mobile processes, II

Information and Computation
A theory of bisimulation for the &lgr;-calculus

Acta Informatica
A partition refinement algorithm for the &pgr;-calculus

Information and Computation - Special issue on FLOC '96
A Calculus of Communicating Systems

A Calculus of Communicating Systems
PI-Calculus: A Theory of Mobile Processes

PI-Calculus: A Theory of Mobile Processes
Bigraphs and transitions

POPL '03 Proceedings of the 30th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Minimizing Transition Systems for Name Passing Calculi: A Co-algebraic Formulation

FoSSaCS '02 Proceedings of the 5th International Conference on Foundations of Software Science and Computation Structures
Verifying Mobile Processes in the HAL Environment

CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
The Mobility Workbench - A Tool for the pi-Calculus

CAV '94 Proceedings of the 6th International Conference on Computer Aided Verification
A Fully-Abstract Model for the p-calculus

LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Towards a Mathematical Operational Semantics

LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science
The Fusion Calculus: Expressiveness and Symmetry in Mobile Processes

LICS '98 Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science
Abstract Syntax and Variable Binding

LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
Semantics of Name and Value Passing

LICS '01 Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science
History-Dependent Automata

History-Dependent Automata
A unified category theoretic approach to variable binding

MERLIN '03 Proceedings of the 2003 ACM SIGPLAN workshop on Mechanized reasoning about languages with variable binding

A Category of Explicit Fusions

Concurrency, Graphs and Models
A congruence rule format for name-passing process calculi

Information and Computation
Two Cotensors in One: Presentations of Algebraic Theories for Local State and Fresh Names

Electronic Notes in Theoretical Computer Science (ENTCS)
Reactive systems, (semi-)saturated semantics and coalgebras on presheaves

Theoretical Computer Science
Families of Symmetries as Efficient Models of Resource Binding

Electronic Notes in Theoretical Computer Science (ENTCS)
Symmetries, local names and dynamic (de)-allocation of names

Information and Computation
A unifying model of variables and names

FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
A Presheaf Environment for the Explicit Fusion Calculus

Journal of Automated Reasoning

Quantified Score

Hi-index	0.00

Visualization

Abstract

We apply the recently developed techniques of higher order abstract syntax and functorial operational semantics to give a compositional and fully abstract semantics for the @p-calculus equipped with open bisimulation. The key novelty in our work is the realisation that the sophistication of open bisimulation requires us to move from the usual semantic domain of presheaves over subcategories of Set to presheaves over subcategories of Rel. This extra structure is crucial in controlling the renaming of extruded names and in providing a variety of different dynamic allocation operators to model the different binders of the @p-calculus.