Abstract | ||
---|---|---|
In this paper, we model fresh names in the π-calculus using abstractions with respect to 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, 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 θ-automaton. |
Year | DOI | Venue |
---|---|---|
2004 | 10.1016/j.entcs.2004.02.039 | Electronic Notes in Theoretical Computer Science |
Keywords | DocType | Volume |
π-calculus,binding operator,abstractions,bisimulation,colagebra | Journal | 106 |
ISSN | Citations | PageRank |
1571-0661 | 0 | 0.34 |
References | Authors | |
10 | 4 |
Name | Order | Citations | PageRank |
---|---|---|---|
Roberto Bruni | 1 | 1238 | 80.58 |
Furio Honsell | 2 | 1254 | 146.59 |
Marina Lenisa | 3 | 264 | 30.25 |
Marino Miculan | 4 | 502 | 43.24 |