Membrane computing. An introduction.

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Related Items

Tissue Systems and Petri Net Synthesis, From P Colonies to 2D P Colonies and Simulations of Multiagent Systems, Priorities, Promoters and Inhibitors in Deterministic Non-cooperative P Systems, P Systems with Toxic Objects, Promoters and Inhibitors in Purely Catalytic P Systems, The Abilities of P Colony Based Models in Robot Control, Polymorphic P Systems with Non-cooperative Rules and No Ingredients, Universality in Molecular and Cellular Computing, Quantifying Communication in Synchronized Languages, Systolic Automata and P Systems, Small Universal Devices, Asynchronous Spiking Neural P Systems with Structural Plasticity, Going Beyond Turing with P Automata: Partial Adult Halting and Regular Observer $$\omega $$-Languages, A Uniform Family of Tissue P Systems with Protein on Cells Solving 3-Coloring in Linear Time, Unnamed Item, Variants of spiking neural P systems and their operational semantics in Haskell, Solving SAT with P systems with anti-membranes, Extended spiking neural P systems with white hole rules and their red-green variants, A uniform family of tissue P systems with protein on cells solving 3-coloring in linear time, On simulating cooperative transition P systems in evolution-communication P systems with energy, Some wonders of a bio-computer-scientist, Spiking Neural P Systems Used as Acceptors and Transducers, The power of synchronizing rules in membrane computing, Parallel contextual array insertion deletion grammars, pure 2D context-free grammars and associated P systems, Self-adapting spiking neural P systems with refractory period and propagation delay, P Automata: Membrane Systems as Acceptors, On the Computational Power of Enhanced Mobile Membranes, On the efficiency of synchronized P systems, Array P systems and pure 2D context-free grammars with independent mode of rewriting, Universality of spiking neural P systems with polarizations working in sequential mode induced by maximum spike number, Neighbourhood message passing computation on a lattice with cP systems, A bibliometric analysis of membrane computing (1998--2019), A tutorial on the formal framework for spiking neural P systems, A membrane computing framework for self-reconfigurable robots, A model learning based testing approach for kernel P systems, Spiking neural P systems with weights and delays on synapses, Relating randomized right-hand sides to communicating rewriting rules, Turing universality of sequential spiking neural P systems with polarizations as number accepting devices, Spiking neural P systems: main ideas and results, Solving subset sum by spiking neural P systems with astrocytes producing calcium, On the power of boundary rule application in membrane computing, Spiking neural P systems and their semantics in Haskell, A process calculus for spiking neural P systems, A time-free uniform solution to subset sum problem by tissue P systems with cell division, Timed P Automata, On Some Classes of Sequential Spiking Neural P Systems, Spiking Neural P Systems with Thresholds, Spiking Neural P Systems with a Generalized Use of Rules, The Expressiveness of Concentration Controlled P Systems, A Characterisation of NL Using Membrane Systems without Charges and Dissolution, On the Computational Complexity of Spiking Neural P Systems, Lifted Bayesian Filtering in Multiset Rewriting Systems, Spatial Calculus of Looping Sequences, A Framework for Modelling and Simulating Networks of Cells, Strategy-Based Rewrite Semantics for Membrane Systems Preserves Maximal Concurrency of Evolution Rule Actions, Rewriting Logic Specification of Membrane Systems with Promoters and Inhibitors, Strategy-Based Proof Calculus for Membrane Systems, Patterns for Maude Metalanguage Applications, Modelling Biological Compartments in Bio-PEPA, Type Disciplines for Analysing Biologically Relevant Properties, Testing Non-deterministic Stream X-machine Models and P systems, Psim: A Computational Platform for Metabolic P Systems, Modeling the Dynamics of HIV Infection with Conformon-P Systems and Cellular Automata, (UREM) P Systems with a Quantum-Like Behavior: Background, Definition, and Computational Power, The Calculus of Looping Sequences for Modeling Biological Membranes, Membrane Computing in Connex Environment, Skin Output in P Systems with Minimal Symport/Antiport and Two Membranes, On the Reachability Problem in P Systems with Mobile Membranes, Simulating the Bitonic Sort Using P Systems, On the Number of Agents in P Colonies, P Systems with String Objects and with Communication by Request, A Logarithmic Bound for Solving Subset Sum with P Systems, A Formal Framework for Static (Tissue) P Systems, Conformon-P Systems with Negative Values, Hill Kinetics Meets P Systems: A Case Study on Gene Regulatory Networks as Computing Agents in silico and in vivo, Solving Numerical NP-Complete Problems with Spiking Neural P Systems, Active Membrane Systems Without Charges and Using Only Symmetric Elementary Division Characterise P, Characterizing Membrane Structures Through Multiset Tree Automata, Asynchronous Spiking Neural P Systems: Decidability and Undecidability, P Systems with Anti-Matter, Universality of SNQ P Systems Using One Type of Spikes and Restrictive Rule Application, A Framework for Complexity Classes in Membrane Computing, Complexity classes for membrane systems, Membrane Computing and Brane Calculi (Some Personal Notes), Translating Mobile Ambients into P Systems, Membrane Systems with Marked Membranes, Membrane Systems with Peripheral Proteins: Transport and Evolution, A Linear–time Tissue P System Based Solution for the 3–coloring Problem, Computing by Floating Strings, Tissue P Systems and (Mem)Brane Systems with Mate and Drip Operations Working on Strings, Expressiveness Issues in Brane Calculi: A Survey, Describing the Immune System Using Enhanced Mobile Membranes, An Intermediate Language for the Simulation of Biological Systems, A Survey on Analog Models of Computation, Time-free Solution to Independent Set Problem using P Systems with Active Membranes, Flat maximal parallelism in P systems with promoters, Investigating dynamic causalities in reaction systems, Modeling membrane systems using colored stochastic Petri nets, Modelling DNA and RNA secondary structures using matrix insertion-deletion systems, An efficient time-free solution to SAT problem by P systems with proteins on membranes, P systems without multiplicities of symbol-objects, Non-confluence in divisionless P systems with active membranes, Solving the N-queens problem using dP systems with active membranes, Predictors for flat membrane systems, Membrane computing and complexity theory: A characterization of PSPACE, Deterministic catalytic systems are not universal, Quorum sensing P systems, A uniform solution to SAT using membrane creation, Universality results for P systems based on brane calculi operations, On the computational complexity of membrane systems, Using well-structured transition systems to decide divergence for catalytic P systems, Multiset random context grammars, checkers, and transducers, On small universal antiport P systems, Discrete solutions to differential equations by metabolic P systems, On the degree of parallelism in membrane systems, Normal forms for spiking neural P systems, Three ``quantum algorithms to solve 3-SAT, Cycles and communicating classes in membrane systems and molecular dynamics, An adaptive and robust biological network based on the vacant-particle transportation model, A rewriting logic framework for operational semantics of membrane systems, P system implementation of dynamic programming stereo, P systems with minimal parallelism, Universality of sequential spiking neural P systems based on minimum spike number, Similarity in languages and programs, Denotational semantics of membrane systems by using complete metric spaces, Signal set tissue systems and overlapping localities, On generalized communicating P systems with minimal interaction rules, P systems with minimal insertion and deletion, Compositional semantics and behavioural equivalences for reaction systems with restriction, Accelerated execution of P systems with active membranes to solve the $N$-queens problem, Minimal probabilistic P systems for modelling ecological systems, Execution information rate for some classes of automata, Asynchronous P systems with active membranes, Localities in systems with a/sync communication, Towards bridging two cell-inspired models: P systems and R systems, An infinite hierarchy of languages defined by dP systems, Simulation techniques for the calculus of wrapped compartments, Typed stochastic semantics for the calculus of looping sequences, A $P$ system model with pure context-free rules for picture array generation, A weakly universal spiking neural P system, P systems and computational algebraic topology, Networks of polarized evolutionary processors, Minimization strategies for maximally parallel multiset rewriting systems, Properties of enhanced mobile membranes via coloured Petri nets, Information systems in modeling interactive computations on granules, On path-controlled insertion-deletion systems, Spatial calculus of looping sequences, Compositional semantics and behavioral equivalences for P systems, Relational state transition dynamics, Catalytic and communicating Petri nets are Turing complete, The foundation of self-developing blob machines for spatial computing, Computational efficiency and universality of timed P systems with active membranes, Verification of membrane systems with delays via Petri nets with delays, Contextual array grammars and array P systems, Computational power of tissue P systems for generating control languages, On languages generated by spiking neural P systems with weights, Generalized contexts for reaction systems: definition and study of dynamic causalities, Membrane computing and brane calculi. Old, new, and future bridges, Membrane systems with proteins embedded in membranes, Decision problems in membrane systems with peripheral proteins, transport and evolution, (Mem)brane automata, A uniform family of tissue P systems with cell division solving 3-COL in a linear time, A DNA computing inspired computational model, Processes of membrane systems with promoters and inhibitors, A simple calculus for proteins and cells, The metabolic algorithm for P systems: principles and applications, Generalized communicating P systems, On the computational power of networks of polarized evolutionary processors, Computational efficiency and universality of timed P systems with membrane creation, Numerical P systems with production thresholds, Efficiently solving the bin packing problem through bio-inspired mobility, Languages generated by P systems with active membranes, Deterministic solutions to QSAT and Q3SAT by spiking neural P systems with pre-computed resources, Reversing computation in membrane systems, Computational complexity of tissue-like P systems, P automata revisited, Interactive information systems: toward perception based computing, Accepting networks of genetic processors are computationally complete, Matrix insertion-deletion systems, A quick introduction to membrane computing, Rule-based and object-based event structures for membrane systems, Compositional semantics of spiking neural P systems, Simulating a P system based efficient solution to SAT by using GPUs, P systems and the Byzantine agreement, Test generation from P systems using model checking, Metabolic approximation of real periodical functions, An extensible, maintainable and elegant approach to hardware source code generation in Reconfig-P, Computational expressiveness of genetic systems, Membrane computing with transport and embedded proteins, Asynchronous spiking neural P systems, On languages generated by asynchronous spiking neural P systems, Probabilistic model checking of biological systems with uncertain kinetic rates, Optical computing, On the computational power of BlenX, Generating and accepting P systems with minimal left and right insertion and deletion, On trace languages generated by (small) spiking neural P systems, On the computational completeness of graph-controlled insertion-deletion systems with binary sizes, BioAmbients: an abstraction for biological compartments, Catalytic P systems, semilinear sets, and vector addition systems, The computational power of tissue-like P systems with promoters, Numerical P systems with migrating variables, Variants of derivation modes for which purely catalytic P systems are computationally complete, Membrane computing to enhance time efficiency of minimum dominating set, Simulating polarization by random context filters in networks of evolutionary processors, When catalytic P systems with one catalyst can be computationally complete, Spiking neural P systems with a flat maximally parallel use of rules, Variants of derivation modes for which catalytic P systems with one catalyst are computationally complete, Solving a PSPACE-complete problem by symport/antiport P systems with promoters and membrane division, Information rate of some classes of non-regular languages: an automata-theoretic approach, Simulating and model checking membrane systems using strategies in Maude, Spiking neural P systems with multiple channels, The computational power of enzymatic numerical P systems working in the sequential mode, Language generating alphabetic flat splicing P systems, Kernel P systems: from modelling to verification and testing, Rule synchronization for monodirectional tissue-like P systems with channel states, A model learning based testing approach for spiking neural P systems, Twenty years of rewriting logic, A path to computational efficiency through membrane computing, Computation power of asynchronous spiking neural P systems with polarizations, A general overview of formal languages for individual-based modelling of ecosystems, Simulation of spatial P system models, Time-free solution to SAT problem using P systems with active membranes, Cell-like P systems with evolutional symport/antiport rules and membrane creation, On solutions and representations of spiking neural P systems with rules on synapses, Automata complete computation with Hodgkin-Huxley neural networks composed of synfire rings, Dendrite P systems, Distributed computation of a $k$ P systems with active membranes for SAT using clause completion, Computing with SN P systems with I/O mode, Reversible computation in nature inspired rule-based systems, Coping with dynamical reaction system topologies using deterministic P modules: a case study of photosynthesis, Simulating counting oracles with cooperation, Seeking computational efficiency boundaries: the Păun's conjecture, Description of membrane systems with time Petri nets: promoters/inhibitors, membrane dissolution, and priorities, Generating pictures in string representation with P systems: the case of space-filling curves, From P systems to morphogenetic systems: an overview and open problems, P systems with limited number of objects, Implementation of RSA cryptographic algorithm using SN P systems based on HP/LP neurons, Theory of reaction automata: a survey, Travelling salesman problem in tissue P systems with costs, Memory associated with membranes systems, Spiking neural P systems: matrix representation and formal verification, A novel solution for GCP based on an OLMS membrane algorithm with dynamic operators, How derivation modes and halting conditions may influence the computational power of P systems, A survey of results on evolution-communication P systems with energy, Synchronization of rules in membrane computing, From biopolymer duplication to membrane duplication and beyond, Control languages accepted by labeled spiking neural P systems with rules on synapses, A multiset-based model of synchronizing agents: Computability and robustness, Small SNQ P systems with multiple types of spikes, Filters defined by random contexts versus polarization in networks of evolutionary processors, Interval-valued computations and their connection with PSPACE, Time-free solution to SAT problem by P systems with active membranes and standard cell division rules, Hierarchies of parallel rewriting P systems -- a survey, A Prolog simulator for deterministic P systems with active membranes, P systems with local graph productions, Results on catalytic and evolution-communication P systems, Tissue P systems with channel states, Computationally universal P systems without priorities: Two catalysts are sufficient, Context-free insertion-deletion systems, Solving the subset-problem by P systems with active membrans, Sequential SNP systems based on min/max spike number, An intermediate language for the stochastic simulation of biological systems, On membrane hierarchy in P systems, Rewriting P systems: improved hierarchies, Characterizations of context-sensitive languages and other language classes in terms of symport/antiport P systems, Design of logic gates using spiking neural P systems with homogeneous neurons and astrocytes-like control, Testing based on identifiable P systems using cover automata and X-machines, Local time membrane systems and time Petri nets, P systems with symport/antiport rules: when do the surroundings matter?, Minimal model of a cell connecting amoebic motion and adaptive transport networks, Tissue-like P systems with evolutional symport/antiport rules, Solution to PSPACE-complete problem using P systems with active membranes with time-freeness, Inference of bounded L systems with polymorphic P systems, Minimal cooperation as a way to achieve the efficiency in cell-like membrane systems, Polarization: a new communication protocol in networks of bio-inspired processors, Metabolic computing, Rule synchronization for tissue P systems, The computational power of monodirectional tissue P systems with symport rules, Neural-like P systems with plasmids, Monodirectional tissue P systems with channel states, Parallel contextual array insertion deletion P systems and tabled matrix grammars, Evolutionary P systems: the notion and an example, Cell-like P systems with polarizations and minimal rules, Simulating P systems with membrane dissolution in a chemical calculus, Notes on spiking neural P systems and finite automata, On the universality of purely catalytic P systems, Theory of tailor automata, A uniform solution to SAT problem by symport/antiport P systems with channel states and membrane division, Cell-like spiking neural P systems with evolution rules, Depth-two P systems can simulate Turing machines with \textbf{NP} oracles, Synthesising elementary net systems with localities, Small universal simple spiking neural P systems with weights, On determinism versus nondeterminism in P systems, P systems with evolutional communication and separation rules, Generalized finite automata over real and complex numbers