A Pi-Calculus with Explicit Substitutions: the Late Semantics

  title={A Pi-Calculus with Explicit Substitutions: the Late Semantics},
  author={Gian Luigi Ferrari and Ugo Montanari and Paola Quaglia},
A new formulation of the π-calculus, where name instantiation is handled explicitly, is presented. The explicit handling of name instantiation allows us to reduce the π-calculus transitional semantics to a standard SOS framework. Hence, π-calculus bisimulation models can take fully advantage of the SOS metatheory developed for ‘static’ process calculi. For instance, complete axiomatic characterizations of π-calculus bisimulation equivalences can be automatically derived by turning SOS rules… 
A Pi-Calculus with Explicit Substitutions
The Calculus of Explicit Substitutions
The aim of this work is to describe the prototypical mobility expressed by the π-calculus within a CCS-like approach to process algebras by introducing suitable constructors for both the explicit handling of name substitutions and the explicit instantiation of names.
The Weak Late pi-Calculus Semantics as Observation Equivalence
The Weak Late π-calculus semantics can be characterized as ordinary Observation congruence over a specialized transition system where both the instantiation of input placeholders and the name substitutions are explicitly handled via suitable constructors.
Towards a Semantic-based Verification Environment for the pi-calculus,
A prototype version of a semantic-based veriication environment for manipulating and analyzing mobile systems speciied in the-calculus is presented and the re-use of software modules, based on semantical considerations, is the key feature of this proposal.
Reification of substitutions in the asynchronous pi-calculus
It is shown that this calculus can faithfully simulate the pi-calculus, thus putting in evidence the fact that terms of the latter can be interpreted more efficiently.
Structured Transition Systems with Parametric Observations: Observational Congruences and Minimal Realizations
This paper considers in detail the problem of defining a semantic framework to unify a range of observational semantics within a single underlying presentation and shows that it is enough to consider different mappings and algebras of observations.
- calculus , internal mobility , and agent-passing calculi
There is an exact correspondence, in terms of expressiveness, between the two hierarchies of the-calculus, and it is shown that there is the full symmetry between input and output constructs.
Lazy functions and mobile processes
  • D. Sangiorgi
  • Computer Science
    Proof, Language, and Interaction
  • 2000
The encoding is shown to give rise to a $\lambda$-model in which, in accordance with the theory of the lazy $\ lambda$-calculus, conditional extensionality holds, however, the model is not fully abstract.
On the Bisimulation Proof Method
It is shown that the class of sound functions contains non-trivial functions and the closure properties of the class with respect to various important function constructors allow us to construct sophisticated sound functions – and hence sophisticated proof techniques for bisimilarity – from simpler ones.


A Theory of Bisimulation for the pi-Calculus
In contrast with the previously known bisimilarity equivalences, ∼ is preserved by name substitution and (hence) by input prefix, and seems promising for the development of automated-verification tools and also shows the call-by-need flavour of ∼.
Modal Logics for Mobile Processes
An Extended Expansion Theorem
Closed CCS is a CCS-like algebra of processes with a generalized form of prefixing based on a full-fledged algebra of transitions rather than on basic actions only, and defines a general form of expansion theorem.
Higher-Level Synchronising Devices in Meije-SCCS
  • R. Simone
  • Computer Science
    Theor. Comput. Sci.
  • 1985
Turning SOS Rules into Equations
This work gives a procedure for converting any GSOS language definition to a finite complete equational axiom system (possibly with one infinitary induction principle) which precisely characterizes strong bisimulation of processes.
Bisimulation can't be traced. Preliminary report
The authors examine what additional operations are needed to explain bisimulation similarly-specifically in the case of finitely branching processes without silent moves, and formulate a general notion of Structured Operational Semantics for processes with Guarded recursion (GSOS), and demonstrate that bisimulations does not agree with trace congruence with respect to any set of GSOS-definable contexts.
The concurrency workbench: a semantics-based tool for the verification of concurrent systems
The Concurrency Workbench is an automated tool for analyzing networks of finite-state processes expressed in Milner's Calculus of Communicating Systems and a large number of interesting verification methods can be formulated as combinations of a small number of primitive algorithms.
Algebraic laws for nondeterminism and concurrency
The paper demonstrates, for a sequence of simple languages expressing finite behaviors, that in each case observation congruence can be axiomatized algebraically and the algebraic language described here becomes a calculus for writing and specifying concurrent programs and for proving their properties.
Concurrency and Automata on Infinite Sequences
  • D. Park
  • Computer Science
    Theoretical Computer Science
  • 1981
A general method for proving/deciding equivalences between omega-regular languages, whose recognizers are modified forms of Buchi or Muller-McNaughton automata, derived from Milner's notion of “simulation” is obtained.