Enabling equivalence and its cover relation for reaction systems
Natural Computing, vol. 24, pp. 707–718
Abstract
Abstract A reaction system consists of a background set of entities and a set of reactions. Reactions are specified by three sets of entities: reactants, inhibitors, and products. A reaction is enabled by a state (a subset of entities), if all its reactants are present in that state and none of its inhibitors. The result of a set of reactions on a given state is a new state that consists of the products of the reactions that were enabled at the original state. In this paper, we further investigate enabling equivalence. This relation equates two sets of reactions for which the states that enable all their reactions simultaneously, are the same and, moreover, their results on those states are the same. From the point of view of enabling equivalence, sets of reactions act as if they were a single (combined) reaction. We show how combined reactions characterize enabling equivalence classes. Furthermore, enabling equivalence induces a partial order in the form of a cover relation on its equivalence classes. The resulting partially ordered set turns out to be a lattice and we demonstrate how this lattice relates to the enabling cover relation introduced earlier for single reactions.
Authors 3
-
Affiliation as printed
Department of Mathematics and Statistics, University of North Florida, Jacksonville, FL, 32224, USA
-
Affiliation as printed
Leiden Institute of Advanced Computer Science, Leiden University, Einsteinweg 55, 2333 CC, Leiden, The Netherlands
-
Affiliation as printed
Leiden Institute of Advanced Computer Science, Leiden University, Einsteinweg 55, 2333 CC, Leiden, The Netherlands
Cited by 0 stored of 0
No patents citing this paper on Lens.org (checked 2026-10-11).