Szlobodnyik, Gergely and Szederkényi, Gábor (2025) Polynomial Time Coverability Analysis in Discrete State Chemical Reaction Network Subclasses. MATCH-COMMUNICATIONS IN MATHEMATICAL AND IN COMPUTER CHEMISTRY, 93 (1). pp. 41-68. ISSN 0340-6253 10.46793/match.93-1.041S

Text Szlobodnyik_41_35147133_ny.pdf Download (10MB)

Abstract

In this paper the coverability problem of discrete state Chemical Reaction Networks (d-CRNs) is considered. We study certain sub-classes of d-CRN reaction network structures and prove that the coverability relation is implied by the reachability property in another reaction network class in which the reachability problem is proven to be decidable in polynomial time. We make use of the equivalent Petri net representation of d-CRNs and the concept of dual graph to obtain networks for which the reachability relation can be decided in polynomial time. Making use of the reachability relations of the dual graph, we provide theoretical guarantee for the coverability property in the initial network. This way sufficient condition is obtained for d-CRN coverability with polynomial time complexity. The studied sub-classes of d-CRNs include subconservative network structures, in addition, complexes composed of more than one species are allowed as well. The basic concepts and the new results are illustrated on several examples.

Item Type:	Article
Subjects:	Q Science > QA Mathematics and Computer Science > QA75 Electronic computers. Computer science / számítástechnika, számítógéptudomány
Divisions:	Systems and Control Lab
SWORD Depositor:	MTMT Injector
Depositing User:	MTMT Injector
Date Deposited:	02 Aug 2024 13:29
Last Modified:	02 Aug 2024 13:29
URI:	https://eprints.sztaki.hu/id/eprint/10773

Update Item