Polynomial Time Coverability Analysis in Discrete State Chemical Reaction Network Subclasses
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 th...
| Szerzők: | |
|---|---|
| Dokumentumtípus: | Cikk |
| Megjelent: |
2025
|
| Sorozat: | MATCH-COMMUNICATIONS IN MATHEMATICAL AND IN COMPUTER CHEMISTRY
93 No. 1 |
| doi: | 10.46793/match.93-1.041S |
| mtmt: | 35147133 |
| Online Access: | https://publikacio.ppke.hu/2742 |