Formal verification of P systems with active membranes through model checking
From MaRDI portal
Recommendations
Cites work
- A fast \(P\) system for finding a balanced 2-partition
- A Hybrid Approach to Modeling Biological Systems
- A Logarithmic Bound for Solving Subset Sum with P Systems
- Complexity classes in models of cellular computing with membranes
- FORMAL VERIFICATION OF P SYSTEMS USING SPIN
- scientific article; zbMATH DE number 5671765 (Why is no real title available?)
- Membrane Computing
- On the decidability of model-checking for P systems
- P systems with active membranes: Attacking NP-complete problems
- Principles of the SPIN model checker. Foreword by Gerard J. Holzmann
- Solving the subset-problem by P systems with active membrans
- Test generation from P systems using model checking
- Unconventional Computation
Cited in
(13)- A Prolog simulator for deterministic P systems with active membranes
- Formal verification of cP systems using Coq
- Formal semantics and verification of network-based biocomputation circuits
- Transforming communicating X-machines into P systems
- Simulating and model checking membrane systems using strategies in Maude
- A model learning based testing approach for spiking neural P systems
- 3-Col problem modelling using simple kernel P systems
- Comparative analysis of statistical model checking tools
- An integrated approach to P systems formal verification
- Implementation of P systems by using big data technologies
- Boundaries of membrane in P systems relying on multiset approximation spaces in language R
- A model learning based testing approach for kernel P systems
- Towards a general methodology for formal verification on spiking neural P systems
This page was built for publication: Formal verification of P systems with active membranes through model checking
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2890294)