Membrane Computing
From MaRDI portal
Publication:5316627
Recommendations
Cited in
(39)- A survey of timed automata for the development of real-time systems
- Membrane computing and brane calculi. Old, new, and future bridges
- Frequency membrane systems
- Solving the SAT problem by cell-like P systems with channel states and symport rules
- Time-free solution to SAT problem by tissue P systems
- Membrane systems with proteins embedded in membranes
- Timed P automata
- Local time membrane systems and time Petri nets
- P systems attacking hard problems beyond NP: a survey
- Solution to PSPACE-complete problem using P systems with active membranes with time-freeness
- Time-free cell-like P systems with multiple promoters/inhibitors
- Asynchronous spiking neural P systems
- Processes of membrane systems with promoters and inhibitors
- Time-free spiking neural P systems
- An efficient time-free solution to SAT problem by P systems with proteins on membranes
- Experiments on the reliability of stochastic spiking neural P systems
- Computational efficiency and universality of timed P systems with active membranes
- Computational efficiency and universality of timed P systems with membrane creation
- FURTHER RESULTS ON TIME-FREE P SYSTEMS
- Counting Time in Computing with Cells
- Membrane systems with marked membranes
- A time-free uniform solution to subset sum problem by tissue P systems with cell division
- An efficient time-free solution to QSAT problem using P systems with proteins on membranes
- Cell-like P systems with polarizations and minimal rules
- Membrane Computing
- Timed P Automata
- A Petri net model for membrane systems with dynamic structure
- Time-free solution to SAT problem by P systems with active membranes and standard cell division rules
- Time-freeness and clock-freeness and related concepts in P systems
- Virtually timed ambients: a calculus of nested virtualization
- Time-free solution to independent set problem using P systems with active membranes
- Membrane systems with peripheral proteins: transport and evolution
- A formal framework for clock-free networks of cells
- Time-free solution to SAT problem using P systems with active membranes
- Basic concurrency resolution in clock-free P systems
- Timed P Automata
- P SYSTEMS WITH SINGLE PASSENGER CARRIERS
- The computational power of timed P systems with active membranes using promoters
- A toolbox for simpler active membrane algorithms
This page was built for publication: Membrane Computing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5316627)
