Undecidability of model checking in brane logic

DOI10.1016/J.ENTCS.2008.10.025zbMATH Open1277.68131OpenAlexW2121442433MaRDI QIDQ2864500FDOQ2864500

Authors: Giorgio Bacci, Marino Miculan 

Publication date: 6 December 2013

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.entcs.2008.10.025

Recommendations

• On the decidability of model-checking for P systems
• Computational Methods in Systems Biology
• Model checking mobile ambients
• Unconventional Computation
• scientific article; zbMATH DE number 1841829

zbMATH Keywords

brane calculusspatial logicsbiological and bio-inspired computation

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Logic in computer science (03B70)

Cites Work

• Nominal logic, a first order theory of names and binding
• Algebraic laws for nondeterminism and concurrency
• Computational Methods in Systems Biology
• Computational methods in systems biology. International conference, CMSB 2006, Trento, Italy, October 18--19, 2006. Proceedings
• Recursively enumerable sets of positive integers and their decision problems
• Model checking mobile ambients
• Measurable stochastics for Brane calculus
• Foundations of Software Science and Computation Structures
• Title not available (Why is that?)
• A proof theory for generic judgments
• Extensionality and intensionality of the ambient logics
• Title not available (Why is that?)
• Computational methods in systems biology. International conference CMSB 2004, Paris, France, May 26--28, 2004. Revised selected papers.
• Computational Methods in Systems Biology
• Decidable Extensions of Hennessy-Milner Logic

Uses Software

• SLMC

This page was built for publication: Undecidability of model checking in brane logic

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2864500)