The Decidability of the Structural Congruence for Beta-binders | Zendy

Corrado Priami | Zendy; Alessandro Romanel | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

The Decidability of the Structural Congruence for Beta-binders

Author(s) -

Corrado Priami,

Alessandro Romanel

Publication year - 2007

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.2007.05.014

Subject(s) - congruence (geometry) , decidability , implementation , process calculus , algebra over a field , pi calculus , computer science , mathematics , congruence relation , theoretical computer science , programming language , discrete mathematics , pure mathematics , geometry

Beta-binders is a recent process algebra developed for modeling and simulating biological systems. As usual for process calculi, the semantic definition heavily relies on a structural congruence. The treatment of the structural congruence is essential for implementation. The proof of the decidability of this congruence, reported in this paper, is a first step towards implementations

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