On the decidability of model-checking for P systems

MaRDI QIDQ3505122zbMATH OpenFDO

Authors Zhe Dang, Cheng Li, Oscar H. Ibarra, Gaoyan Xie

Publication date 18 June 2008

zbMATH Keywords

membrane computing

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Unconventional Computation
• Mathematical Foundations of Computer Science 2005
• Computing with cells: membrane systems – some complexity issues
• A quick introduction to membrane computing
• Membrane Computing: Basics and Frontiers

Cited in

(16)

• Formal verification of cP systems using PAT3 and ProB
• How derivation modes and halting conditions may influence the computational power of P systems
• Formal verification of cP systems using Coq
• A proof theoretic view of spatial and temporal dependencies in biochemical systems
• Simulating and model checking membrane systems using strategies in Maude
• Undecidability of model checking in brane logic
• Formal verification of P systems with active membranes through model checking
• PARTIAL HALTING IN P SYSTEMS
• scientific article; zbMATH DE number 1979550 (Why is no real title available?)
• Model Checking Kernel P Systems
• Unconventional Computation
• Mathematical Foundations of Computer Science 2005
• Automata, Languages and Programming
• A model learning based testing approach for kernel P systems
• P versus B: P systems as a formal framework for controllability of Boolean networks
• Test generation from P systems using model checking

This page was built for publication: On the decidability of model-checking for P systems

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