-calculus, internal mobility, and agent-passing calculi

DOI10.1016/0304-3975(96)00075-8zbMATH Open0874.68103OpenAlexW2001299902MaRDI QIDQ671684FDOQ671684

Authors: Davide Sangiorgi 

Publication date: 27 February 1997

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(96)00075-8

Recommendations

• Internal mobility and agent-passing calculi
• On the expressiveness of internal mobility in name-passing calculi
• On the expressiveness of internal mobility in name-passing calculi
• A calculus of mobile processes. I

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cites Work

• A fully abstract semantics for causality in the \(\pi\)-calculus
• Title not available (Why is that?)
• Functions as processes
• A \(\pi \)-calculus with explicit substitutions: the late semantics
• A calculus of mobile processes. II
• Algebra of communicating processes with abstraction
• Fundamental properties of infinite trees
• Title not available (Why is that?)
• The lambda calculus, its syntax and semantics
• Observational structures and their logic
• A fully abstract denotational model for higher-order processes
• Asynchronous process calculi: The first- and higher-order paradigms
• Objects in the \(\pi\)-calculus
• Title not available (Why is that?)
• Title not available (Why is that?)
• A fully abstract denotational semantics for the calculus of higher-order communicating systems
• Locality and interleaving semantics in calculi for mobile processes

Cited In (69)

• On parameterization of higher-order processes
• First-order semantics for higher-order processes
• Internal mobility and agent-passing calculi
• On decidability of the bisimilarity on higher-order processes with parameterization
• Title not available (Why is that?)
• Towards races in linear logic
• The name discipline of uniform receptiveness (extended abstract)
• A subexponential view of domains in session types
• Title not available (Why is that?)
• Constructing weak simulations from linear implications for processes with private names
• Order algebras: a quantitative model of interaction
• On the expressiveness of \(\pi\)-calculus for encoding mobile ambients
• Event structures for the reversible early internal \(\pi\)-calculus
• On the relative expressive power of calculi for mobility
• Title not available (Why is that?)
• Taking linear logic apart
• An interpretation of CCS into ludics
• The \(C_\pi\)-calculus: a model for confidential name passing
• Minimality and separation results on asynchronous mobile processes -- representability theorems by concurrent combinators
• On the expressiveness of interaction
• Models for name-passing processes: Interleaving and causal
• Explicit fusions
• Asynchronous process calculi: The first- and higher-order paradigms
• Topology in process calculus. I: Limit behaviour of agents
• Probabilistic and nondeterministic aspects of anonymity
• A randomized encoding of the \(\pi\)-calculus with mixed choice
• Mechanized metatheory revisited
• A fully abstract model for the \(\pi\)-calculus.
• Typed event structures and the linear \(\pi \)-calculus
• Eager functions as processes
• Linear logic propositions as session types
• Fundamentals of session types
• Some congruence properties for \(\pi\)-calculus bisimilarities
• Nominal SOS
• Leader election in rings of ambient processes
• A functional presentation of pi calculus
• Probabilistic \(\pi\)-calculus and event structures
• Denotational semantics of channel mobility in UTP-CSP
• On the expressiveness and decidability of higher-order process calculi
• Tutorial on separation results in process calculi via leader election problems
• A truly concurrent game model of the asynchronous \(\pi\)-calculus
• Decoding choice encodings
• Linear forwarders
• Rule formats for nominal process calculi
• The name discipline of uniform receptiveness
• Tau laws for pi calculus
• Free-algebra models for the \(\pi \)-calculus
• Linear logical relations and observational equivalences for session-based concurrency
• HOCore in Coq
• Rule formats for nominal process calculi
• Strong normalisation in the \(\pi\)-calculus
• On the relative expressiveness of higher-order session processes
• Name-passing calculi: from fusions to preorders and types
• Matching systems for concurrent calculi
• On the relative expressiveness of higher-order session processes
• Bisimulation congruence of \(\chi\)-calculus
• Linearity and bisimulation
• Encoding generic judgments: preliminary results
• The \(\lambda \)-calculus in the \(\pi \)-calculus
• A behavioural theory for a \(\pi\)-calculus with preorders
• Distinguishing and relating higher-order and first-order processes by expressiveness
• On the expressiveness of internal mobility in name-passing calculi
• Title not available (Why is that?)
• Variations on mobile processes
• Choreographies, logically
• Symmetries and Dualities in Name-Passing Process Calculi
• Modelling patterns of gene regulation in the bond-calculus
• Theory of interaction
• The \(\pi\)-calculus: A theory of mobile processes

This page was built for publication: \(\pi\)-calculus, internal mobility, and agent-passing calculi

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q671684)