Modeling Fresh Names in the π-calculus Using Abstractions | Zendy

Roberto Bruni | Zendy; Furio Honsell | Zendy; Marina Lenisa | Zendy; Marino Miculan | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Modeling Fresh Names in the π-calculus Using Abstractions

Author(s) -

Roberto Bruni,

Furio Honsell,

Marina Lenisa,

Marino Miculan

Publication year - 2004

Publication title -

electronic notes in theoretical computer science

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.242

H-Index - 60

ISSN - 1571-0661

DOI - 10.1016/j.entcs.2004.02.039

Subject(s) - finitary , bisimulation , coalgebra , semantics (computer science) , automaton , computer science , mathematics , process calculus , algebra over a field , permutation (music) , calculus (dental) , discrete mathematics , theoretical computer science , programming language , pure mathematics , medicine , physics , dentistry , acoustics

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

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research