Undecidability of Model Checking in Brane Logic

Authors:
Giorgio Bacci;Marino Miculan
Affiliations:
Department of Mathematics and Computer Science, University of Udine, Italy;Department of Mathematics and Computer Science, University of Udine, Italy
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2008

Citing 10
Cited 0

Algebraic laws for nondeterminism and concurrency

Journal of the ACM (JACM)
Extensionality and intensionality of the ambient logics

POPL '01 Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Nominal logic, a first order theory of names and binding

Information and Computation - TACS 2001
Model checking mobile ambients

Theoretical Computer Science
A proof theory for generic judgments

ACM Transactions on Computational Logic (TOCL)
Modal logics for brane calculus

CMSB'06 Proceedings of the 2006 international conference on Computational Methods in Systems Biology
Deciding behavioural properties in brane calculi

CMSB'06 Proceedings of the 2006 international conference on Computational Methods in Systems Biology
Beta binders for biological interactions

CMSB'04 Proceedings of the 20 international conference on Computational Methods in Systems Biology
Projective brane calculus

CMSB'04 Proceedings of the 20 international conference on Computational Methods in Systems Biology
Brane calculi

CMSB'04 Proceedings of the 20 international conference on Computational Methods in Systems Biology

Quantified Score

Hi-index	0.00

Visualization

Abstract

The Brane Calculus is a calculus intended to model the structure and the dynamics of biological membranes. In order to express properties of systems in this calculus, in previous work we have introduced a temporal-spatial logic called Brane Logic. A natural question of great practical importance is if model checking of this logic is decidable, that is, if it is possible to check automatically whether a given system satisfies a given formula. We have already shown that model checking is decidable for replication-free systems and guarantee-free formulas. In this paper, we show that admitting replication in systems, or any guarantee constructor in formulas (and quantifiers), leads model checking to be undecidable. Moreover, we give also a correspondence result between membranes and systems, showing that any system can be obtained by a canonical one where all information are contained on a membrane enclosing an empty compartment.