Free-Algebra Models for the π-Calculus

نویسنده

  • Ian Stark
چکیده

The finite π-calculus has an explicit set-theoretic functor-category model that is known to be fully abstract for strong late bisimulation congruence. We characterize this as the initial free algebra for an appropriate set of operations and equations in the enriched Lawvere theories of Plotkin and Power. Thus we obtain a novel algebraic description for models of the π-calculus, and validate an existing construction as the universal such model. The algebraic operations are intuitive, covering name creation, communication of names over channels, and nondeterminism; the equations then combine these features in a modular fashion. We work in an enriched setting, over a “possible worlds” category of sets indexed by available names. This expands significantly on the classical notion of algebraic theories, and in particular allows us to use nonstandard arities that vary as processes evolve. Based on our algebraic theory we describe a category of models for the π-calculus, and show that they all preserve bisimulation congruence. We develop a direct construction of free models in this category; and generalise previous results to prove that all free-algebra models are fully abstract.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Stochastic Process Algebra Models of a Circadian Clock

We present stochastic process algebra models of a Circadian clock mechanism used in many biological organisms to regulate time-based behaviour. We compare modelling techniques from different modelling paradigms, PEPA and stochastic π-calculus.

متن کامل

Translation of Systems Biology Markup Language into Process Algebra

We address the automatic translation of Systems Biology Mark-Up Language (SBML) models of network of biochemical reactions into the Biochemical Stochastic π-calculus. SBML is XML-based widespread exchange language for systems biology. The Biochemical Stochastic π-calculus can describe the concurrency of a network of biochemical reactions. Available tools allow to simulate π-calculus models to o...

متن کامل

Imperial College London Department of Computing a Session Type Discipline for Event Driven Programming Models

This work develops a session type discipline for event driven programming models. Event models are used to describe asynchrony in concurrent systems. Session types is a typing system for π calculus developed for sound and safe process interaction. The studying of events through a session type definition presents great interest for concurrent systems. For the purpose of this thesis event driven ...

متن کامل

A Fully Abstract Model for the π - calculus

This paper provides both a fully abstract (domain-theoretic) model for the π -calculus and a universal (set-theoretic) model for the finite π -calculus with respect to strong late bisimulation and congruence. This is done by considering categorical models, defining a metalanguage for these models, and translating the π -calculus into the metalanguage. A technical novelty of our approach is an a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1997