Reachability in resource-bounded reaction systems

DOI10.1007/978-3-319-30000-9_45MaRDI QIDQ2798751zbMATH OpenOpenAlexFDO

Authors Alberto Dennunzio, Luca Manzoni, Antonio E. Porreca, Enrico Formenti

Publication date 13 April 2016

Published in Language and Automata Theory and Applications (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/10281/107073

zbMATH Keywords

discrete dynamical systemsnatural computingreachabilityreaction systemsunconventional models of computation

Mathematics Subject Classification ID

Biochemistry, molecular biology (92C40) Analysis of algorithms and problem complexity (68Q25) Biologically inspired models of computation (DNA computing, membrane computing, etc.) (68Q07)

Recommendations

• Complexity of the dynamics of reaction systems
• On the complexity of occurrence and convergence problems in reaction systems
• Complexity of model checking for reaction systems
• Reaction systems made simple. A normal form and a classification theorem
• Steady states of constrained reaction systems

Cited in

(12)

• Facilitation in reaction systems
• Complexity of model checking for reaction systems
• Fixed points and attractors of reactantless and inhibitorless reaction systems
• Computational complexity of reversible reaction systems
• Controllability of reaction systems
• A graph isomorphism condition and equivalence of reaction systems
• On the complexity of occurrence and convergence problems in reaction systems
• Complexity of the dynamics of reaction systems
• Transition graphs of reversible reaction systems
• Evolvability of reaction systems and the invisibility theorem
• scientific article; zbMATH DE number 7603548 (Why is no real title available?)
• Companions and an essential motion of a reaction system

This page was built for publication: Reachability in resource-bounded reaction systems

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