On the Decidability and Complexity of the Structural Congruence for Beta-binders

Priami, Corrado and Romanel, Alessandro (2006) On the Decidability and Complexity of the Structural Congruence for Beta-binders. UNSPECIFIED.

[img]
Preview
PDF
Download (413Kb) | Preview

    Abstract

    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. Published in TCS 404(1-2):156-169, c2008 Elsevier, available at http://dx.doi.org/10.1016/j.tcs.2008.04.007

    Item Type: Departmental Technical Report
    Department or Research center: CoSBi (Center for Computational and Systems Biology)
    Subjects: Q Science > QA Mathematics > QA076 Computer software > QA076.7 Programming Languages - Semantics
    Repository staff approval on: 30 Nov 2009

    Actions (login required)

    View Item