What is a free name in a process algebra?

Authors:
Flemming Nielson;Hanne Riis Nielson;Henrik Pilegaard
Affiliations:
Informatics and Mathematical Modelling, Technical University of Denmark, DK-2800 Kongens Lyngby, Denmark;Informatics and Mathematical Modelling, Technical University of Denmark, DK-2800 Kongens Lyngby, Denmark;Informatics and Mathematical Modelling, Technical University of Denmark, DK-2800 Kongens Lyngby, Denmark
Venue:
Information Processing Letters
Year:
2007

Citing 11
Cited 0

The chemical abstract machine

POPL '90 Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Communicating and mobile systems: the &pgr;-calculus

Communicating and mobile systems: the &pgr;-calculus
Linearity and the pi-calculus

ACM Transactions on Programming Languages and Systems (TOPLAS)
Mobile ambients

Theoretical Computer Science
A Calculus of Communicating Systems

A Calculus of Communicating Systems
Principles of Program Analysis

Principles of Program Analysis
Handbook of Process Algebra

Handbook of Process Algebra
Mobile safe ambients

ACM Transactions on Programming Languages and Systems (TOPLAS)
Predicative Polymorphism in Pi-Calculus

PARLE '94 Proceedings of the 6th International PARLE Conference on Parallel Architectures and Languages Europe
Modelling biochemical pathways through enhanced π-calculus

Theoretical Computer Science - Special issue: Computational systems biology
BioAmbients: an abstraction for biological compartments

Theoretical Computer Science - Special issue: Computational systems biology

Quantified Score

Hi-index	0.89

Visualization

Abstract

There are two popular approaches to specifying the semantics of process algebras: labelled transition semantics and reaction semantics. While the notion of free name is rather unproblematic for labelled transition semantics this is not so for reaction semantics in the presence of a structural congruence for unfolding recursive declarations. We show that the standard definition of free name is not preserved under the structural congruence. We then develop a fixed point approach to the set of free names and show that it is invariant under the structural congruence.