On the decidability of model-checking for P systems
From MaRDI portal
Recommendations
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
- Deciding Presburger arithmetic by model checking and comparisons with other methods
- Model Checking Kernel P Systems
- Unconventional Computation
- Mathematical Foundations of Computer Science 2005
- Signaling P systems and verification problems
- 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)