International Conference on Language and Automata Theory and Applications

LATA 2016: Language and Automata Theory and Applications pp 592-602

Reachability in Resource-Bounded Reaction Systems

  • Alberto Dennunzio
  • Enrico Formenti
  • Luca Manzoni
  • Antonio E. Porreca
Conference paper

DOI: 10.1007/978-3-319-30000-9_45

Volume 9618 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Dennunzio A., Formenti E., Manzoni L., Porreca A.E. (2016) Reachability in Resource-Bounded Reaction Systems. In: Dediu AH., Janoušek J., Martín-Vide C., Truthe B. (eds) Language and Automata Theory and Applications. LATA 2016. Lecture Notes in Computer Science, vol 9618. Springer, Cham

Abstract

Reaction systems, a formalism describing biochemical reactions in terms of sets of reactants, inhibitors, and products, are known to have a PSPACE-complete configuration reachability problem. We show that the complexity of the problem remains unchanged even for some classes of resource-bounded reaction systems, where we disallow either inhibitors or reactants. We also prove that the complexity decreases to NP in the specific case of inhibitorless reaction systems using only one reactant per reaction.

Keywords

Unconventional models of computationNatural computingReaction systemsDiscrete dynamical systemsReachability

Copyright information

© Springer International Publishing Switzerland 2016

Authors and Affiliations

  • Alberto Dennunzio
    • 1
  • Enrico Formenti
    • 2
  • Luca Manzoni
    • 1
  • Antonio E. Porreca
    • 1
  1. 1.Dipartimento di Informatica, Sistemistica e ComunicazioneUniversità Degli Studi di Milano-BicoccaMilanoItaly
  2. 2.University of Nice Sophia Antipolis, CNRS, I3S, UMR 7271Sophia AntipolisFrance