On the Computational Power of BlenX

Romanel, Alessandro and Priami, Corrado (2008) On the Computational Power of BlenX. UNSPECIFIED. (Unpublished)

Download (422Kb) | Preview


    We present some decidability and undecidability results for subsets of the BlenX Language, a process-calculi-based programming language developed for modelling biological processes. We show that for a core subset of the language (which considers only communications primitives) termination is decidable. Moreover, we prove that by adding either global priorities or events to this core language, we obtain Turing equivalent languages. The proof is through encodings of Random Access Machines (RAMs), a well known Turing equivalent formalism, into our subsets of BlenX. All the encodings are shown to be correct.

    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
    Report Number: TR-02-2008
    Repository staff approval on: 01 Dec 2009

    Actions (login required)

    View Item