Undecidability of model checking in brane logic
From MaRDI portal
Publication:2864500
Recommendations
Cites work
- scientific article; zbMATH DE number 1696431 (Why is no real title available?)
- scientific article; zbMATH DE number 3057871 (Why is no real title available?)
- A proof theory for generic judgments
- Algebraic laws for nondeterminism and concurrency
- Computational Methods in Systems Biology
- Computational Methods in Systems Biology
- Computational methods in systems biology. International conference CMSB 2004, Paris, France, May 26--28, 2004. Revised selected papers.
- Computational methods in systems biology. International conference, CMSB 2006, Trento, Italy, October 18--19, 2006. Proceedings
- Decidable Extensions of Hennessy-Milner Logic
- Extensionality and intensionality of the ambient logics
- Foundations of Software Science and Computation Structures
- Measurable stochastics for Brane calculus
- Model checking mobile ambients
- Nominal logic, a first order theory of names and binding
- Recursively enumerable sets of positive integers and their decision problems
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)