Algebraic laws for nondeterminism and concurrency
Journal of the ACM (JACM)
Anytime, anywhere: modal logics for mobile ambients
Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Extensionality and intensionality of the ambient logics
POPL '01 Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Communication and Concurrency
Separation Logic: A Logic for Shared Mutable Data Structures
LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
Model checking mobile ambients
Theoretical Computer Science
Abstract machines of systems biology
Transactions on Computational Systems Biology III
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
Synapses as stochastic concurrent systems
Theoretical Computer Science
Undecidability of Model Checking in Brane Logic
Electronic Notes in Theoretical Computer Science (ENTCS)
Deducing interactions in partially unspecified biological systems
AB'07 Proceedings of the 2nd international conference on Algebraic biology
Hi-index | 0.00 |
The Brane Calculus is a calculus of mobile processes, intended to model the transport machinery of a cell system. In this paper, we introduce the Brane Logic, a modal logic for expressing formally properties about systems in Brane Calculus. Similarly to previous logics for mobile ambients, Brane Logic has specific spatial and temporal modalities. Moreover, since in Brane Calculus the activity resides on membrane surfaces and not inside membranes, we need to add a specific logic (akin Hennessy-Milner’s) for reasoning about membrane activity. We present also a proof system for deriving valid sequents in Brane Logic. Finally, we present a model checker for a decidable fragment of this logic.