Reachability in resource-bounded reaction systems
From MaRDI portal
Recommendations
Cited in
(13)- On the complexity of occurrence and convergence problems in reaction systems
- A graph isomorphism condition and equivalence of reaction systems
- Facilitation in reaction systems
- Controllability of reaction systems
- Transition graphs of reversible reaction systems
- Complexity of the dynamics of reaction systems
- Complexity of model checking for reaction systems
- Evolvability of reaction systems and the invisibility theorem
- Companions and an essential motion of a reaction system
- Note on simulation by strictly minimal reaction systems with limited resources
- Fixed points and attractors of reactantless and inhibitorless reaction systems
- Computational complexity of reversible reaction systems
- Cycles and global attractors of reactantless and inhibitorless reaction systems
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)