Unconventional Computation

DOI10.1007/11560319MaRDI QIDQ5479203zbMATH OpenOpenAlexFDO

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

Publication date 7 July 2006

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11560319

Mathematics Subject Classification ID

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

Recommendations

• On the decidability of model-checking for P systems
• 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

(17)

• How derivation modes and halting conditions may influence the computational power of P systems
• Simulating and model checking membrane systems using strategies in Maude
• An integrated model checking toolset for kernel P systems
• Undecidability of model checking in brane logic
• Formal verification of P systems with active membranes through model checking
• Global model checking of ordered multi-pushdown systems
• Parameterized Model Checking of Token-Passing Systems
• PARTIAL HALTING IN P SYSTEMS
• A bioinspired computing approach to model complex systems
• On the decidability of model-checking for P systems
• On Bounded Symport/Antiport P Systems
• N-PAT: A Nested Model-Checker
• On the Qualitative Analysis of Conformon P Systems
• Model Checking Kernel P Systems
• Mathematical Foundations of Computer Science 2005
• Automata, Languages and Programming
• P versus B: P systems as a formal framework for controllability of Boolean networks

This page was built for publication: Unconventional Computation

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