Skip to main content

Reaction Systems with Duration

  • Chapter
Computation, Cooperation, and Life

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6610))

Abstract

A reaction system is essentially a finite set of reactions, where each reaction consists of a finite set of reactants (needed for the reaction to take place), a finite set of inhibitors (each of which inhibits the reaction from taking place), and a finite set of products produced when the reaction takes place. A crucial feature of a reaction system is that (unless introduced from outside the system) an element (entity) from a current state will belong also to the successor state only if it is in the product set of a reaction that took place in the current state. In other words, an entity vanishes unless it is sustained by a reaction — a sort of “immediate decay” property. In this paper we relax this property, by providing each entity x with its duration d(x), which guarantees that x will last through at least d(x) consecutive states. Such reaction systems with duration are investigated in this paper. Among others we demonstrate that duration/decay is a result of an interaction with a “structured environment”, and we also investigate fundamental properties of state sequences of reaction systems with duration.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Kari, L., Rozenberg, G.: The many facets of natural computing. Communications of the ACM 51(10), 72–83 (2008)

    Article  Google Scholar 

  2. Ehrenfeucht, A., Main, M.G., Rozenberg, G.: Combinatorics of life and death for reaction systems. International Journal of Foundations of Computer Science 21(3), 345–356 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  3. Ehrenfeucht, A., Rozenberg, G.: Events and modules in reaction systems. Theoretical Computer Science 376(1-2), 3–16 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  4. Ehrenfeucht, A., Rozenberg, G.: Reaction systems. Fundamenta Informaticae 75(1-4), 263–280 (2007)

    MathSciNet  MATH  Google Scholar 

  5. Ehrenfeucht, A., Rozenberg, G.: Introducing time in reaction systems. Theoretical Computer Science 410(4-5), 310–322 (2009)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Brijder, R., Ehrenfeucht, A., Rozenberg, G. (2011). Reaction Systems with Duration. In: Kelemen, J., Kelemenová, A. (eds) Computation, Cooperation, and Life. Lecture Notes in Computer Science, vol 6610. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-20000-7_16

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-20000-7_16

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-19999-8

  • Online ISBN: 978-3-642-20000-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics