Skip to main content
Log in

On categorical approach to reaction systems

  • Published:
Natural Computing Aims and scope Submit manuscript

Abstract

In every matured theory, there is a need to investigate possible relationships between considered objects. To address this issue, it is natural to relate a category with given model of computing. Thanks to such approach, many properties are unified and simplified. In this paper, we investigate how category theory can be used to give a faithful semantics for reaction systems. In particular, we propose and discuss possible approaches to the problem of defining morphisms between reaction systems. We provide the definition of morphism that keeps the behaviour of the original reaction system. Especially, some equivalences of reaction systems are reflected in terms of morphisms. For this purpose we expressed isomorphisms and sections in term of transition systems. Moreover, the accelerating morphism defined in the last section gives a new approach for including time in reaction systems.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5

Similar content being viewed by others

Availability of data and materials

No Data associated in the manuscript.

References

  • Adámek J (1974) Free algebras and automata realizations in the language of categories. Comment Math Univ Carol 15(4):589–602

    MathSciNet  Google Scholar 

  • Adámek J, Herrlich H, Strecker G (1990) Abstract and concrete categories. Wiley-Interscience, New York

    Google Scholar 

  • Ehrenfeucht A, Rozenberg G (2007) Reaction systems. Fund Inform 75(1–4):263–280

    MathSciNet  Google Scholar 

  • Ehrenfeucht A, Rozenberg G (2009) Introducing time in reaction systems. Theoret Comput Sci 410(4–5):310–322

    Article  MathSciNet  Google Scholar 

  • Ehrig H, Kiermeier K, Kreowski H, Kühnel W (1974) Universal theory of automata—a categorial approach. Teubner Studienbücher, Teubner, Stuttgart

    Book  Google Scholar 

  • Genova D, Hoogeboom HJ, Jonoska N (2017) A graph isomorphism condition and equivalence of reaction systems. Theoret Comput Sci 701:109–119

    Article  MathSciNet  Google Scholar 

  • Hasuo I, Jacobs B, Uustalu T (2007) Categorical views on computations on trees. In: ICALP, vol 4596. Springer, pp 619–630

  • Kleijn J, Koutny M, Mikulski Ł (2020) Reaction systems and enabling equivalence. Fund Inform 171(1–4):261–277

    MathSciNet  Google Scholar 

  • Kleijn J, Koutny M, Mikulski Ł, Rozenberg G (2018) Reaction systems, transition systems, and equivalences. Adventures between lower bounds and higher altitudes: essays dedicated to Juraj Hromkovič on the occasion of his 60th birthday, pp 63–84

  • Kleijn J, Koutny M, Rozenberg G (2011) Modelling reaction systems with Petri nets. In: BioPPN-2011, 2nd international workshop on biological processes & petri nets. Newcastle University

  • Kreowski H-J, Lye A (2020) Graph surfing in reaction systems from a categorial perspective. arXiv preprint arXiv:2012.01659

  • Kreowski H-J, Lye A (2021) A categorial approach to reaction systems: first steps. Theoret Comput Sci 881:111–128

    Article  MathSciNet  Google Scholar 

  • Lawvere FW, Schanuel SH (2009) Conceptual mathematics: a first introduction to categories, 2nd edn. Cambridge University Press, Cambridge

    Book  Google Scholar 

  • Lye A (2021) Transformations of reaction systems over categories by means of epi-mono factorization and functors. In: Graph transformation: 14th international conference, ICGT 2021, held as part of STAF 2021, virtual event, June 24–25, 2021, proceedings. Springer, pp 40–59

  • Mac Lane S (2013) Categories for the working mathematician, vol 5. Springer, New York

    Google Scholar 

  • Manzoni L, Poças D, Porreca AE (2014) Simple reaction systems and their classification. Int J Found Comput Sci 25:441–458

    Article  MathSciNet  Google Scholar 

  • Meseguer J, Montanari U (1990) Petri nets are monoids. Inf Comput 88(2):105–155

    Article  MathSciNet  Google Scholar 

  • Mȩski A, Koutny M, Penczek W (2019) Model checking for temporal-epistemic properties of distributed reaction systems. School of computing technical report series

  • Salomaa A (2015) Two-step simulations of reaction systems by minimal ones. Acta Cybernet 22(2):247–257

    Article  MathSciNet  Google Scholar 

  • Winskel G (1983) Synchronisation trees. In: Automata, languages and programming: 10th Colloquium Barcelona, Spain, July 18–22, 1983 10. Springer, pp 695–711

  • Winskel G (1987) Petri nets, algebras, morphisms, and compositionality. Inf Comput 72(3):197–238

    Article  MathSciNet  Google Scholar 

Download references

Funding

This research was funded in part, by the Polish National Center for Research and Develeopment (NCBR) the Luxembourg National Research Fund (FNR), under the PolLux/FNR-CORE project SpaceVote (POLLUX-XI/14/SpaceVote/2023). For the purpose of open access, and in fulfilment of the obligations arising from the grant agreement, the author has applied a Creative Commons Attribution 4.0 International (CC BY 4.0) license to any Author Accepted Manuscript version arising from this submission.

Author information

Authors and Affiliations

Authors

Contributions

MK and ŁM have contributed equally.

Corresponding author

Correspondence to Mariusz Kaniecki.

Ethics declarations

Conflict of interest

The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.

Ethical approval

Not applicable.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Kaniecki, M., Mikulski, Ł. On categorical approach to reaction systems. Nat Comput (2024). https://doi.org/10.1007/s11047-024-09978-1

Download citation

  • Accepted:

  • Published:

  • DOI: https://doi.org/10.1007/s11047-024-09978-1

Keywords

Navigation