Cycles and Global Attractors of Reaction Systems

DOI10.1007/978-3-319-09704-6_11zbMath1416.68070OpenAlexW2132434714MaRDI QIDQ5496182

Antonio E. Porreca, Luca Manzoni, Enrico Formenti

Publication date: 7 August 2014

Published in: Descriptional Complexity of Formal Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-09704-6_11

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (17)

Complexity of model checking for reaction systems ⋮ Minimal reaction systems: duration and blips ⋮ Minimal Reaction Systems Defining Subset Functions ⋮ Evolvability of reaction systems and the invisibility theorem ⋮ A graph isomorphism condition and equivalence of reaction systems ⋮ Complexity of the dynamics of reaction systems ⋮ Ancestors, descendants, and gardens of Eden in reaction systems ⋮ Fixed points and attractors of reactantless and inhibitorless reaction systems ⋮ Applications of the Chinese remainder theorem to reaction systems with duration ⋮ Dependency graphs and mass conservation in reaction systems ⋮ Reaction systems and extremal combinatorics properties ⋮ Facilitation in reaction systems ⋮ Controllability of reaction systems ⋮ Model checking temporal properties of reaction systems ⋮ Preimage Problems for Reaction Systems ⋮ Reaction systems with influence on environment ⋮ Towards Quantitative Verification of Reaction Systems

This page was built for publication: Cycles and Global Attractors of Reaction Systems