See this document in CiteSeerX!

Modeling Fresh Names in the π-calculus Using Abstractions (2002)  (Make Corrections)  
Roberto Bruni, Furio Honsell, Marina Lenisa, Marino Miculan



  Home/Search   Context   Related

 
View or download:
di.unipi.it/~bruni/pub...TR2002UD.ps.gz
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  di.unipi.it/~bruni...ListOfPapers (more)
Homepages:  R.Bruni  

Rate this article: (best)
  Comment on this article  
(Enter summary)

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)

Active bibliography (related documents):   More   All
1.7:   Modeling Fresh Names in the π-calculus Using.. - Bruni, Honsell, Lenisa..   (Correct)
0.3:   A Proof Search Specification of the π-Calculus - Tiu, Miller   (Correct)
0.3:   Comparing Higher-Order Encodings in Logical.. - Bruni, Honsell.. (2002)   (Correct)

Similar documents based on text:   More   All
0.4:   An axiomatic approach to metareasoning on nominal.. - Honsell, Miculan.. (2001)   (Correct)
0.3:   A Natural Deduction Approach to Dynamic Logic - Honsell, Miculan (1996)   (Correct)
0.3:   pi-calculus in (Co)Inductive Type Theory - Honsell, Miculan, Scagnetto   (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
8   Foundational aspects of syntax - Miller, Palmidessi - 1999
5   A first order coalgebraic model of #-calculus early observat.. (context) - Buscemi, Montanari - 2002
5   Number 51 in Encyclopedia of Mathematics and its Application.. (context) - Borceux, Categorical et al. - 1994
5   i and M. Pistore. #-calculus, structured coalgebras, and min.. (context) - Montanar - 2000
3   Theory and models of the #-calculus using Fraenkel-Mostowski.. (context) - Gabbay - 2002

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