Modeling Fresh Names in the π-calculus Using Abstractions

Authors:
Roberto Bruni;Furio Honsell;Marina Lenisa;Marino Miculan
Affiliations:
Dipartimento di Informatica, Università di Pisa, Via F. Buonarroti 2, 56127 Pisa, ITALY;Dipartimento di Matematica e Informatica, Università di Udine, Via delle Scienze 206, 33100 Udine, ITALY;Dipartimento di Matematica e Informatica, Università di Udine, Via delle Scienze 206, 33100 Udine, ITALY;Dipartimento di Matematica e Informatica, Università di Udine, Via delle Scienze 206, 33100 Udine, ITALY
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2004

Citing 11
Cited 0

A calculus of mobile processes, II

Information and Computation
Symbolic bisimulations

MFPS '92 Selected papers of the meeting on Mathematical foundations of programming semantics
A theory of bisimulation for the &lgr;-calculus

Acta Informatica
Foundational aspects of syntax

ACM Computing Surveys (CSUR)
&pgr;-calculus in (Co)inductive-type theory

Theoretical Computer Science - Special issues on models and paradigms for concurrency
PI-Calculus: A Theory of Mobile Processes

PI-Calculus: A Theory of Mobile Processes
Compositional SOS and beyond: a coalgebraic view of open systems

Theoretical Computer Science
A First Order Coalgebraic Model of pi-Calculus Early Observational Equivalence

CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
Final semantics for the pi-calculus

PROCOMET '98 Proceedings of the IFIP TC2/WG2.2,2.3 International Conference on Programming Concepts and Methods
On the Foundation of Final Semantics: Non-Standard Sets, Metric Spaces, Partial Orders

Proceedings of the REX Workshop on Sematics: Foundations and Applications
A Final Coalgebra Theorem

Category Theory and Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we model fresh names in the @p-calculus using abstractions with respect to a new binding operator @q. Both the theory and the metatheory of the @p-calculus benefit from this simple extension. The operational semantics of this new calculus is finitely branching. Bisimulation can be given without mentioning any constraint on names, thus allowing for a straightforward definition of a coalgebraic semantics, within a category of coalgebras over permutation algebras. Following previous work by Montanari and Pistore, we present also a finite representation for finitary processes and a finite state verification procedure for bisimilarity, based on the new notion of @q-automaton.