Time-freeness and clock-freeness and related concepts in P systems

DOI10.1016/J.TCS.2018.09.009zbMATH Open1436.68109OpenAlexW2786988550MaRDI QIDQ2285665FDOQ2285665

Authors: Artiom Alhazov, Rudolf Freund, Sergiu Ivanov, Bosheng Song, Linqiang Pan 

Publication date: 8 January 2020

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2018.09.009

Recommendations

• Membrane Computing
• FURTHER RESULTS ON TIME-FREE P SYSTEMS
• Basic concurrency resolution in clock-free P systems
• Computational efficiency and universality of timed P systems with active membranes
• Time-free solution to SAT problem using P systems with active membranes

zbMATH Keywords

P-systemtime-freenessclock-freenessmode-freeness

Mathematics Subject Classification ID

Biologically inspired models of computation (DNA computing, membrane computing, etc.) (68Q07)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Time-free solution to SAT problem by P systems with active membranes and standard cell division rules
• Time-free solution to SAT problem using P systems with active membranes
• An efficient time-free solution to SAT problem by P systems with proteins on membranes
• Membrane Computing
• Functional reactive animation
• A Formal Framework for Static (Tissue) P Systems
• A time-free uniform solution to subset sum problem by tissue P systems with cell division
• Membrane Computing
• P systems working in maximal variants of the set derivation mode
• A formal framework for clock-free networks of cells
• A general framework for regulated rewriting based on the applicability of rules
• Asynchronous and maximally parallel deterministic controlled non-cooperative P systems characterize NFIN and coNFIN

Cited In (8)

• Frequency membrane systems
• Timed P automata
• The computational power of monodirectional tissue P systems with symport rules
• FURTHER RESULTS ON TIME-FREE P SYSTEMS
• A formal framework for clock-free networks of cells
• Timed P Automata
• Basic concurrency resolution in clock-free P systems
• Membrane Computing

Uses Software

• Fran

This page was built for publication: Time-freeness and clock-freeness and related concepts in P systems

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