Reachability Analysis of Low-Order Discrete State Reaction Networks Obeying Conservation Laws
In this paper we study the reachability problem of sub- and superconservative discrete state chemical reaction networks (d-CRNs). It is known that a subconservative network has bounded reachable state space, while that of a superconservative one is unbounded. The reachability problem of superconserv...
Saved in:
Main Authors: | Gergely Szlobodnyik, Gábor Szederkényi |
---|---|
Format: | Article |
Language: | English |
Published: |
Wiley
2019-01-01
|
Series: | Complexity |
Online Access: | http://dx.doi.org/10.1155/2019/1035974 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Reachable Set Estimation of Discrete Singular Systems with Time-Varying Delays and Bounded Peak Inputs
by: Hongli Yang, et al.
Published: (2024-12-01) -
Reachability testing algorithm for parallel program in heterogeneous network environment
by: WANG Wei1, et al.
Published: (2006-01-01) -
Further Results on Reachable Set Bounding for Discrete-Time System with Time-Varying Delay and Bounded Disturbance Inputs
by: Wei Kang, et al.
Published: (2018-01-01) -
On the Properties of Reachability, Observability, Controllability, and Constructibility of Discrete-Time Positive Time-Invariant Linear Systems with Aperiodic Choice of the Sampling Instants
by: M. De la Sen
Published: (2007-01-01) -
Study on generation of turbulence-distorted received signals in OAM optical communications obeying dual Johnson S<sub>B</sub>distribution
by: Chunyi CHEN, et al.
Published: (2020-11-01)