The Kell Calculus: A Family of Higher-Order Distributed Process Calculi

@inproceedings{Schmitt2004TheKC,
  title={The Kell Calculus: A Family of Higher-Order Distributed Process Calculi},
  author={Alan Schmitt and Jean-Bernard Stefani},
  booktitle={Global Computing},
  year={2004}
}
This paper presents the Kell calculus, a family of distributed process calculi, parameterized by languages for input patterns, that is intended as a basis for studying component-based distributed programming. The Kell calculus is built around a π-calculus core, and follows five design principles which are essential for a foundational model of distributed and mobile programming: hierarchical localities, local actions, higher-order communication, programmable membranes, and dynamic binding. The… 
An Abstract Machine for the Kell Calculus
TLDR
An abstract machine for an instance of the Kell Calculus, a proof of its correctness, and a prototype OCaml implementation is presented, independent of any supporting network services.
A Sorted Semantic Framework for Applied Process Calculi (Extended Abstract)
TLDR
This work extends previous work on psi-calculi with novel abstract patterns and pattern matching, and adds sorts to the data term language, giving sufficient criteria for subject reduction to hold, and develops a unified framework to represent different process calculi and notions of computation.
A Sorted Semantic Framework for Applied Process Calculi
TLDR
This work extends previous work on psi-calculi with novel abstract patterns and pattern matching, and adds sorts to the data term language, giving sufficient criteria for subject reduction to hold, and proves standard congruence and structural properties of bisimulation.
On the Expressiveness of Polyadicity in Higher-Order Process Calculi
TLDR
A study of the expressive power of strictly higher-order process calculi, i.e. calculi in which only process passing is allowed and no name-passing is present, which is shown to induce a hierarchy of calculi of strictly increasing expressiveness.
Bisimulation Congruences for Homer a calculus of Higher-order mobile embedded resources
We extend Howe’s method for proving that late labelled transition bisimulations are congruences to a core process passing calculus with local names, extended with non-linear active process mobility
Higher-Order Concurrency: Expressiveness and Decidability Results
TLDR
The basic theory of this core calculus for higher-order concurrency is developed and relied on to study the expressive power of issues universally accepted as basic in process calculi, namely synchrony, forwarding, and polyadic communication.
A Higher-Order Distributed Calculus with Name Creation
TLDR
This paper introduces HOpiPn, the higher-order pi-calculus with passivation and name creation, and develops an equivalence theory for this calculus, and defines for this new calculus a theory of sound and complete environmental bisimulation to prove reduction-closed barbed equivalence and (a reasonable form of) congruence.
Termination in higher-order concurrent calculi
Semantics and Encoding of the kell-m Calculus
TLDR
Kell-m, an asynchronous higher-order process algebra with hierarchical localities, is presented and the variation of the -calculus as implemented in the Mobility Model Checker (MMC) is presented.
...
...

References

SHOWING 1-10 OF 71 REFERENCES
Bisimulation for Higher-Order Process Calculi
TLDR
A new form of bisimulation is proposed for higher-order process calculus, called context bisimulations, which yields a more satisfactory discriminanting power and is played by the factorisation theorem.
A Theory of Higher Order Communicating Systems
TLDR
An investigation of the foundation of the theory of this calculus, together with the full proofs of all major theorems, and a set of algebraic laws satisfied by the calculus is presented.
The m-calculus: a higher-order distributed process calculus
TLDR
A new distributed process calculus, called the M-calculus, that can be understood as a higher-order version of the Distributed Join calculus with programmable localities with polymorphic type system.
Contextual equivalence for higher-order pi-calculus revisited
TLDR
This calculus is revisited and an alternative presentation of the labelled transition system and a novel proof technique is offered which allows to provide a fully abstract characterisation of contextual equivalence using labelled transitions and bisimulations for higher-order pi-calculus with recursive types also.
A calculus of Kells
  • J. Stefani
  • Computer Science
    Electron. Notes Theor. Comput. Sci.
  • 2003
Process Algebras with Localities
The Pi-Calculus - a theory of mobile processes
TLDR
This book presents the pi-calculus, a theory of mobile systems, which provides a conceptual framework for understanding mobility, and mathematical tools for expressing systems and reasoning about their behaviors.
safeDpi: a language for controlling mobile code
TLDR
A sophisticated static type system for ports is defined, which restrict the capabilities and access rights of any processes launched by incoming code, and shows that a natural contextually defined behavioural equivalence can be characterised coinductively, using bisimulations based on typed actions.
...
...