Statecharts: A visual formalism for complex systems
Science of Computer Programming
Priorities in process algebras
Information and Computation - Selections from 1988 IEEE symposium on logic in computer science
The PEPA workbench: a tool to support a process algebra-based approach to performance modelling
Proceedings of the 7th international conference on Computer performance evaluation : modelling techniques and tools: modelling techniques and tools
Information and Computation
A compositional approach to performance modelling
A compositional approach to performance modelling
Computability of Recursive Functions
Journal of the ACM (JACM)
Well-structured transition systems everywhere!
Theoretical Computer Science
Information Processing Letters
Communication and Concurrency
PI-Calculus: A Theory of Mobile Processes
PI-Calculus: A Theory of Mobile Processes
Membrane Computing: An Introduction
Membrane Computing: An Introduction
On the expressive power of movement and restriction in pure mobile ambients
Theoretical Computer Science - Special issue: Foundations of wide area network computing
Theoretical Computer Science - Special issue: Computational systems biology
BioAmbients: an abstraction for biological compartments
Theoretical Computer Science - Special issue: Computational systems biology
On the computational strength of pure ambient calculi
Theoretical Computer Science - Expressiveness in concurrency
Computation: finite and infinite machines
Computation: finite and infinite machines
BetaWB: modelling and simulating biological processes
Proceedings of the 2007 Summer Computer Simulation Conference
Theoretical Computer Science
On the decidability and complexity of the structural congruence for beta-binders
Theoretical Computer Science
On the expressive power of recursion, replication and iteration in process calculi
Mathematical Structures in Computer Science
On the computational power of brane calculi
Transactions on Computational Systems Biology VI
Beta binders for biological interactions
CMSB'04 Proceedings of the 20 international conference on Computational Methods in Systems Biology
CMSB'04 Proceedings of the 20 international conference on Computational Methods in Systems Biology
Operational patterns in beta-binders
Transactions on Computational Systems Biology I
On the expressive power of global and local priority in process calculi
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
Biochemical reaction rules with constraints
ESOP'11/ETAPS'11 Proceedings of the 20th European conference on Programming languages and systems: part of the joint European conferences on theory and practice of software
| Hi-index | 5.23 |
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 communication 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.