_:N3b62014e36cd4052b1f9abde3028aa6b "Springer Nature - SN SciGraph project" .
.
_:Ne4e878b3b4f04f9ba02416217fe7460e .
_:N3b62014e36cd4052b1f9abde3028aa6b .
"state space explosion problem" .
"true"^^ .
"reachability probabilities" .
.
_:N3612852ca2ad448fa5da07c9483db95a .
.
"explosion problem" .
_:Ne4e878b3b4f04f9ba02416217fe7460e _:N66f48ecd27c145a4a550ef547a3e1347 .
"linear noise approximation" .
"approximation" .
"Approximation of Probabilistic Reachability for Chemical Reaction Networks Using the Linear Noise Approximation" .
.
"2022-01-01T19:24" .
"terms" .
_:N178c9290b0724b76ac1ed368553b826f .
"chapter" .
.
"abstraction" .
"space Gaussian process" .
_:N7c26e52197614d9dac8c34cc706aecd6 .
"Marta" .
"We study time-bounded probabilistic reachability for Chemical Reaction Networks (CRNs) using the Linear Noise Approximation (LNA). The LNA approximates the discrete stochastic semantics of a CRN in terms of a continuous space Gaussian process. We consider reachability regions expressed as intersections of finitely many linear inequalities over the species of a CRN. This restriction allows us to derive an abstraction of the original Gaussian process as a time-inhomogeneous discrete-time Markov chain (DTMC), such that the dimensionality of its state space is independent of the number of species of the CRN, ameliorating the state space explosion problem. We formulate an algorithm for approximate computation of time-bounded reachability probabilities on the resulting DTMC and show how to extend it to more complex temporal properties. We implement the algorithm and demonstrate on two case studies that it permits fast and scalable computation of reachability properties with controlled accuracy." .
.
_:N178c9290b0724b76ac1ed368553b826f "dimensions_id" .
"reachability" .
.
"intersection" .
"semantics" .
"state space" .
"Markov chain" .
"time-bounded probabilistic reachability" .
.
"number of species" .
"Bortolussi" .
_:Nf8ee59c4f7d14e79b3d88d63d9ac04f2 .
"reachability region" .
"Cardelli" .
"72-88" .
"accuracy" .
.
_:Nb645362f81484b62964feac163dbefc6 .
"discrete stochastic semantics" .
_:N995970fd31374e5cb58326bd87a91baf "Springer Nature" .
_:N79381817cdd047b0af8b624e656a0b16 .
"chemical reaction networks" .
"process" .
_:N995970fd31374e5cb58326bd87a91baf .
"probability" .
"continuous space Gaussian process" .
"Computation Theory and Mathematics" .
.
"algorithm" .
"probabilistic reachability" .
_:N66f48ecd27c145a4a550ef547a3e1347 .
_:Nfaa1ec5611c14e6d806ce40316dcb519 .
_:N178c9290b0724b76ac1ed368553b826f "pub.1020794792" .
_:N7b1812db920744a6871abc2ea4f149ed _:Nf8ee59c4f7d14e79b3d88d63d9ac04f2 .
_:N3612852ca2ad448fa5da07c9483db95a "doi" .
.
_:Nfaa1ec5611c14e6d806ce40316dcb519 "Benny" .
_:N7c26e52197614d9dac8c34cc706aecd6 .
_:N7c26e52197614d9dac8c34cc706aecd6 "Quantitative Evaluation of Systems" .
.
"linear inequalities" .
"Kwiatkowska" .
"reaction networks" .
"approximate computation" .
"computation" .
.
_:N178c9290b0724b76ac1ed368553b826f .
"chapters" .
"restriction" .
"Luca" .
"dimensionality" .
_:N3612852ca2ad448fa5da07c9483db95a .
"stochastic semantics" .
"original Gaussian process" .
_:N3a2433337455462cafed3cf141e7667c _:Nfaa1ec5611c14e6d806ce40316dcb519 .
"discrete-time Markov chain" .
"network" .
"Information and Computing Sciences" .
_:Nf8ee59c4f7d14e79b3d88d63d9ac04f2 "Agha" .
"region" .
"number" .
_:N7c26e52197614d9dac8c34cc706aecd6 "978-3-319-43424-7" .
_:Ne4e878b3b4f04f9ba02416217fe7460e .
"properties" .
"2016-08-03" .
"space" .
"2016-08-03" .
_:Nfaa1ec5611c14e6d806ce40316dcb519 "Van Houdt" .
"https://scigraph.springernature.com/explorer/license/" .
.
"time-inhomogeneous discrete-time Markov chain" .
_:N3a2433337455462cafed3cf141e7667c .
"temporal properties" .
"Luca" .
"Department of Computer Science, University of Oxford, Oxford, UK" .
"Department of Computer Science, University of Oxford, Oxford, UK" .
_:Nf8ee59c4f7d14e79b3d88d63d9ac04f2 "Gul" .
_:Nb645362f81484b62964feac163dbefc6 .
"noise approximation" .
"case study" .
_:N3612852ca2ad448fa5da07c9483db95a "10.1007/978-3-319-43425-4_5" .
_:N7b1812db920744a6871abc2ea4f149ed _:N3a2433337455462cafed3cf141e7667c .
"scalable computation" .
"space explosion problem" .
"chain" .
"Microsoft Research, Cambridge, UK" .
.
.
_:N7b1812db920744a6871abc2ea4f149ed .
"complex temporal properties" .
"https://doi.org/10.1007/978-3-319-43425-4_5" .
"en" .
.
"Luca" .
"inequality" .
"reachability properties" .
"study" .
_:N995970fd31374e5cb58326bd87a91baf .
_:N66f48ecd27c145a4a550ef547a3e1347 _:N79381817cdd047b0af8b624e656a0b16 .
_:N79381817cdd047b0af8b624e656a0b16 _:Nb645362f81484b62964feac163dbefc6 .