See this document in CiteSeerX!

Structured Coalbegras and Minimal Hd Automata for the Pi-Calculus (2000)  (Make Corrections)  
U. Montanari, M. Pistore



  Home/Search   Context   Related

 
View or download:
sra.itc.it/tr/MP00.ps.gz
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  sra.itc.it/trarch/2000 (more)
(Enter author homepages)

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

Abstract: The coalgebraic framework developed for the classical process algebras, and in particular its advantages concerning minimal realizations, does not fully apply to the pi-calculus, due to the constraints on the freshly generated names that appear in the bisimulation. In this paper we propose to model the transition system of the pi-calculus as a coalgebra on a category of name permutation algebras and to define its abstract semantics as the final coalgebra of such a category. We show that... (Update)

Active bibliography (related documents):   More   All
1.4:   History-Dependent Automata - Montanari, Pistore (1998)   (Correct)
0.8:   Models & Languages for Open Distributed Systems - Montanari (1999)   (Correct)
0.6:   History Dependent Automata - Montanari, Pistore (2001)   (Correct)

Similar documents based on text:   More   All
1.9:   Channeled Multicast For Group Communications - Busetta, Dona, Nori (2001)   (Correct)
1.9:   Industrial Applications Of Model Checking - Cimatti (2000)   (Correct)
1.9:   Planning as Model Checking for Extended Goals in.. - Pistore, Traverso (2001)   (Correct)

BibTeX entry:   (Update)

@misc{ montanari-structured,
  author = "U. Montanari et al.",
  title = "Structured Coalbegras And Minimal Hd Automata For The $\pi$-Calculus",
  url = "citeseer.ist.psu.edu/montanari00structured.html" }
Citations (may not include all citations):
854   Information and Computation (context) - Milner, Parrow et al. - 1992  DBLP
410   Mobile Ambients - Cardelli, Gordon - 1998  ACM   DBLP
404   A calculus for cryptographic protocols: the spi calculus - Abadi, Gordon - 1999  DBLP
291   A calculus of mobile agents - Fournet, Gonthier et al. - 1996  ACM   DBLP
186   Universal coalgebra: a theory of systems - Rutten - 2000
127   Information and Computation (context) - Walker, the - 1995
116   A typed language for distributed mobile processes - Hennessy, Riely - 1998
94   Seal: A framework for secure mobile computations - Vitek, Castagna - 1998  DBLP
69   Information and Computation (context) - Joyal, Nielsen et al. - 1996  DBLP
69   Abstract syntax and variable binding (context) - Fiore, Plotkin et al. - 1999  ACM   DBLP
67   Towards a mathematical operational semantics - Turi, Plotkin - 1997  ACM   DBLP
66   A new approach to abstract syntax involving binders - Gabbay, Pitts - 1999  ACM   DBLP
61   The fusion calculus: Expressiveness and symmetry in mobile p.. - Parrow, Victor - 1998
36   Higher level synchronising devices in MEIJE-SCCS (context) - De Simone - 1985
14   Minimal transition systems for history-preserving bisimulati.. (context) - Montanari, Pistore - 1997
10   Compositional SOS and beyond: A coalgebraic view of open sys.. - Corradini, Heckel et al. - 2001  DBLP
8   Dipartimento di Informatica (context) - Montanari, Pistore et al. - 1998
8   structured coalgebras and minimal HD-automata (context) - Montanari, Pistore
8   A fully abstract domain model for the pi-calculus (context) - Stark - 1996
5   Dipartimento di Informatica (context) - Pistore, Automata et al.
5   From SOS specications to structured coalgebras: How to make .. (context) - Corradini, Heckel et al. - 1999
5   Dipartimento di Matematica e Informatica (context) - Honsell, Miculan et al. - 1998
5   Structured transition systems as lax coalgebras (context) - Corradini, Gro et al. - 1998  DBLP
4   A fully-abstract model for the -calculus (context) - Fiore, Moggi et al. - 1996
3   An automata based verication environment for mobile processe.. (context) - Ferrari, Ferro et al. - 1997
3   Verifying mobile processes in the HAL environment (context) - Ferrari, Gnesi et al. - 1998  ACM   DBLP
3   Final semantics for the pi-calculus - Honsell, Lenisa et al. - 1998
2   History dependent verication for partial order systems (context) - Montanari, Pistore - 1997
2   Checking bisimilarity for nitary -calculus (context) - Montanari, Pistore - 1995
1   Ecient minimization up to location equivalence (context) - Montanari, Pistore et al. - 1996
1   Compositional constructor interpretation over coalgebraic mo.. (context) - Baldamus
1   Semantic analysis of higher-order abstract syntax (context) - Hofmann - 1999
1   calculus to higher-order -calculus { and back (context) - Sangiorgi - 1993

Documents on the same site (http://sra.itc.it/trarch/2000.html):   More
Conformant Planning via Symbolic Model Checking - Cimatti, Roveri (2000)   (Correct)
Model Checking Security Protocols Using a Logic of Belief - Benerecetti, Giunchiglia (2000)   (Correct)
Collaborative Filtering via Implicit Culture Support - Blanzieri, Giorgini, Massa.. (2001)   (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