Roberto Bruni, Furio Honsell, Marina Lenisa, Marino Miculan  Home/Search
Context
Related
| di.unipi.it/~bruni/pub...TR2002UD.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: di.unipi.it/~bruni...ListOfPapers (more) Homepages: R.Bruni |
Rate this article:      (best)Comment on this article |
Abstract: In this paper, we model fresh names in the π-calculus using abstractions w.r.t. a new binding operator θ. Both the theory and the metatheory of the π-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. This is cast within a category of coalgebras over algebras with infinitely... (Update)
Similar documents based on text: More All
1.0: Modeling Fresh Names in the π-calculus Using.. - Bruni, Honsell, Lenisa.. (Correct)
0.6: Comparing Higher-Order Encodings in Logical.. - Bruni, Honsell.. (2001) (Correct)
0.4: An axiomatic approach to metareasoning on nominal.. - Honsell, Miculan.. (2001) (Correct)
BibTeX entry: (Update)
@misc{ bruni-modeling,
author = "Roberto Bruni and Furio Honsell and Marina Lenisa and Marino Miculan",
title = "Modeling Fresh Names in the $\pi$-calculus Using Abstractions",
url = "citeseer.ist.psu.edu/bruni02modeling.html" }
Citations (may not include all citations):434 A framework for defining logics - Harper, Honsell et al. - 1993
297 A calculus of mobile processes (context) - Milner, Parrow et al. - 1992
186 Universal coalgebra: a theory of systems - Rutten - 2000
159 Non-well-founded sets (context) - Aczel - 1988
91 A final coalgebra theorem (context) - Aczel, Mendler - 1989
81 calculus: a Theory of Mobile Processes (context) - Sangiorgi, Walker
49 A theory of bisimulation for the #-calculus (context) - Sangiorgi - 1996
46 the foundations of final semantics: Non-standard sets (context) - Rutten, Turi - 1993
33 Theoretical Computer Science (context) - Honsell, Miculan et al. - 2001
28 Symbolic bisimulations (context) - Hennessy, Lin - 1995
14 Final semantics for the #-calculus (context) - Honsell, Lenisa et al. - 1998
14 Dipartimento di Informatica (context) - Lenisa, Final et al. - 1998
11 An introduction to the #-calculus (context) - Parrow - 2001
10 Compositional SOS and beyond: A coalgebraic view of open sys.. - Corradini, Heckel et al. - 2001
8 A higher-order specification of the #-calculus (context) - Despeyroux - 2000
[Article contains additional citations not shown here]
Documents on the same site (http://www.di.unipi.it/~bruni/publications/ListOfPapers.html): More
Executable Tile Specifications for Process Calculi - Bruni, Meseguer, Montanari (1999) (Correct)
Tile Logic for Synchronized Rewriting of Concurrent Systems - Bruni (1999) (Correct)
Process and Term Tile Logic - Bruni, Meseguer, Monzanari (1998) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC