Approximation of Probabilistic Reachability for Chemical Reaction Networks Using the Linear Noise Approximation View Full Text


Ontology type: schema:Chapter      Open Access: True


Chapter Info

DATE

2016-08-03

AUTHORS

Luca Bortolussi , Luca Cardelli , Marta Kwiatkowska , Luca Laurenti

ABSTRACT

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. More... »

PAGES

72-88

Identifiers

URI

http://scigraph.springernature.com/pub.10.1007/978-3-319-43425-4_5

DOI

http://dx.doi.org/10.1007/978-3-319-43425-4_5

DIMENSIONS

https://app.dimensions.ai/details/publication/pub.1020794792


Indexing Status Check whether this publication has been indexed by Scopus and Web Of Science using the SN Indexing Status Tool
Incoming Citations Browse incoming citations for this publication using opencitations.net

JSON-LD is the canonical representation for SciGraph data.

TIP: You can open this SciGraph record using an external JSON-LD service: JSON-LD Playground Google SDTT

[
  {
    "@context": "https://springernature.github.io/scigraph/jsonld/sgcontext.json", 
    "about": [
      {
        "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/08", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Information and Computing Sciences", 
        "type": "DefinedTerm"
      }, 
      {
        "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/0802", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Computation Theory and Mathematics", 
        "type": "DefinedTerm"
      }
    ], 
    "author": [
      {
        "affiliation": {
          "alternateName": "Department of Mathematics and Geosciences, University of Trieste, Trieste, Italy", 
          "id": "http://www.grid.ac/institutes/grid.5133.4", 
          "name": [
            "Department of Mathematics and Geosciences, University of Trieste, Trieste, Italy"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Bortolussi", 
        "givenName": "Luca", 
        "id": "sg:person.0722040335.58", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.0722040335.58"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Department of Computer Science, University of Oxford, Oxford, UK", 
          "id": "http://www.grid.ac/institutes/grid.4991.5", 
          "name": [
            "Microsoft Research, Cambridge, UK", 
            "Department of Computer Science, University of Oxford, Oxford, UK"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Cardelli", 
        "givenName": "Luca", 
        "id": "sg:person.013522516217.56", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.013522516217.56"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Department of Computer Science, University of Oxford, Oxford, UK", 
          "id": "http://www.grid.ac/institutes/grid.4991.5", 
          "name": [
            "Department of Computer Science, University of Oxford, Oxford, UK"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Kwiatkowska", 
        "givenName": "Marta", 
        "id": "sg:person.011375012273.39", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.011375012273.39"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Department of Computer Science, University of Oxford, Oxford, UK", 
          "id": "http://www.grid.ac/institutes/grid.4991.5", 
          "name": [
            "Department of Computer Science, University of Oxford, Oxford, UK"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Laurenti", 
        "givenName": "Luca", 
        "id": "sg:person.011532541500.46", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.011532541500.46"
        ], 
        "type": "Person"
      }
    ], 
    "datePublished": "2016-08-03", 
    "datePublishedReg": "2016-08-03", 
    "description": "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.", 
    "editor": [
      {
        "familyName": "Agha", 
        "givenName": "Gul", 
        "type": "Person"
      }, 
      {
        "familyName": "Van Houdt", 
        "givenName": "Benny", 
        "type": "Person"
      }
    ], 
    "genre": "chapter", 
    "id": "sg:pub.10.1007/978-3-319-43425-4_5", 
    "inLanguage": "en", 
    "isAccessibleForFree": true, 
    "isPartOf": {
      "isbn": [
        "978-3-319-43424-7", 
        "978-3-319-43425-4"
      ], 
      "name": "Quantitative Evaluation of Systems", 
      "type": "Book"
    }, 
    "keywords": [
      "linear noise approximation", 
      "chemical reaction networks", 
      "discrete-time Markov chain", 
      "noise approximation", 
      "Gaussian process", 
      "probabilistic reachability", 
      "reaction networks", 
      "state space explosion problem", 
      "stochastic semantics", 
      "reachability region", 
      "Markov chain", 
      "state space", 
      "approximate computation", 
      "linear inequalities", 
      "space explosion problem", 
      "time-bounded reachability probabilities", 
      "reachability probabilities", 
      "reachability properties", 
      "approximation", 
      "scalable computation", 
      "explosion problem", 
      "reachability", 
      "computation", 
      "algorithm", 
      "complex temporal properties", 
      "network", 
      "inequality", 
      "dimensionality", 
      "space", 
      "problem", 
      "probability", 
      "case study", 
      "accuracy", 
      "intersection", 
      "terms", 
      "properties", 
      "restriction", 
      "temporal properties", 
      "number", 
      "process", 
      "abstraction", 
      "number of species", 
      "semantics", 
      "chain", 
      "region", 
      "study", 
      "species", 
      "time-bounded probabilistic reachability", 
      "discrete stochastic semantics", 
      "continuous space Gaussian process", 
      "space Gaussian process", 
      "original Gaussian process", 
      "time-inhomogeneous discrete-time Markov chain"
    ], 
    "name": "Approximation of Probabilistic Reachability for Chemical Reaction Networks Using the Linear Noise Approximation", 
    "pagination": "72-88", 
    "productId": [
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1020794792"
        ]
      }, 
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/978-3-319-43425-4_5"
        ]
      }
    ], 
    "publisher": {
      "name": "Springer Nature", 
      "type": "Organisation"
    }, 
    "sameAs": [
      "https://doi.org/10.1007/978-3-319-43425-4_5", 
      "https://app.dimensions.ai/details/publication/pub.1020794792"
    ], 
    "sdDataset": "chapters", 
    "sdDatePublished": "2021-12-01T20:04", 
    "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
    "sdPublisher": {
      "name": "Springer Nature - SN SciGraph project", 
      "type": "Organization"
    }, 
    "sdSource": "s3://com-springernature-scigraph/baseset/20211201/entities/gbq_results/chapter/chapter_308.jsonl", 
    "type": "Chapter", 
    "url": "https://doi.org/10.1007/978-3-319-43425-4_5"
  }
]
 

Download the RDF metadata as:  json-ld nt turtle xml License info

HOW TO GET THIS DATA PROGRAMMATICALLY:

JSON-LD is a popular format for linked data which is fully compatible with JSON.

curl -H 'Accept: application/ld+json' 'https://scigraph.springernature.com/pub.10.1007/978-3-319-43425-4_5'

N-Triples is a line-based linked data format ideal for batch operations.

curl -H 'Accept: application/n-triples' 'https://scigraph.springernature.com/pub.10.1007/978-3-319-43425-4_5'

Turtle is a human-readable linked data format.

curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/978-3-319-43425-4_5'

RDF/XML is a standard XML format for linked data.

curl -H 'Accept: application/rdf+xml' 'https://scigraph.springernature.com/pub.10.1007/978-3-319-43425-4_5'


 

This table displays all metadata directly associated to this object as RDF triples.

143 TRIPLES      23 PREDICATES      78 URIs      71 LITERALS      7 BLANK NODES

Subject Predicate Object
1 sg:pub.10.1007/978-3-319-43425-4_5 schema:about anzsrc-for:08
2 anzsrc-for:0802
3 schema:author N8153c3adf28747baa7910716d6941482
4 schema:datePublished 2016-08-03
5 schema:datePublishedReg 2016-08-03
6 schema:description 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.
7 schema:editor Nfb24cff62089474f9b51c79229134ca9
8 schema:genre chapter
9 schema:inLanguage en
10 schema:isAccessibleForFree true
11 schema:isPartOf Ndc72f10f3b0d48cda49f8fa164ae6157
12 schema:keywords Gaussian process
13 Markov chain
14 abstraction
15 accuracy
16 algorithm
17 approximate computation
18 approximation
19 case study
20 chain
21 chemical reaction networks
22 complex temporal properties
23 computation
24 continuous space Gaussian process
25 dimensionality
26 discrete stochastic semantics
27 discrete-time Markov chain
28 explosion problem
29 inequality
30 intersection
31 linear inequalities
32 linear noise approximation
33 network
34 noise approximation
35 number
36 number of species
37 original Gaussian process
38 probabilistic reachability
39 probability
40 problem
41 process
42 properties
43 reachability
44 reachability probabilities
45 reachability properties
46 reachability region
47 reaction networks
48 region
49 restriction
50 scalable computation
51 semantics
52 space
53 space Gaussian process
54 space explosion problem
55 species
56 state space
57 state space explosion problem
58 stochastic semantics
59 study
60 temporal properties
61 terms
62 time-bounded probabilistic reachability
63 time-bounded reachability probabilities
64 time-inhomogeneous discrete-time Markov chain
65 schema:name Approximation of Probabilistic Reachability for Chemical Reaction Networks Using the Linear Noise Approximation
66 schema:pagination 72-88
67 schema:productId N0dedc8c50cfd4628b52952b33b7365e0
68 Nbc732c5881a0452da7cfb3dba6d8a745
69 schema:publisher N316edccbe5644fbab6a4d058a49a09fb
70 schema:sameAs https://app.dimensions.ai/details/publication/pub.1020794792
71 https://doi.org/10.1007/978-3-319-43425-4_5
72 schema:sdDatePublished 2021-12-01T20:04
73 schema:sdLicense https://scigraph.springernature.com/explorer/license/
74 schema:sdPublisher N14def4237cab4b01b81d294c528038bf
75 schema:url https://doi.org/10.1007/978-3-319-43425-4_5
76 sgo:license sg:explorer/license/
77 sgo:sdDataset chapters
78 rdf:type schema:Chapter
79 N061ccf799f724006a28237f0f655d3d6 rdf:first sg:person.011532541500.46
80 rdf:rest rdf:nil
81 N0856f9e050ee4a96b518f296c6cdcdf1 schema:familyName Van Houdt
82 schema:givenName Benny
83 rdf:type schema:Person
84 N0dedc8c50cfd4628b52952b33b7365e0 schema:name doi
85 schema:value 10.1007/978-3-319-43425-4_5
86 rdf:type schema:PropertyValue
87 N14def4237cab4b01b81d294c528038bf schema:name Springer Nature - SN SciGraph project
88 rdf:type schema:Organization
89 N166d3164407f4cc8b8dd666b41262a55 schema:familyName Agha
90 schema:givenName Gul
91 rdf:type schema:Person
92 N316edccbe5644fbab6a4d058a49a09fb schema:name Springer Nature
93 rdf:type schema:Organisation
94 N8153c3adf28747baa7910716d6941482 rdf:first sg:person.0722040335.58
95 rdf:rest Nbd44753db3f64ed7b7bdf3ddcd33333e
96 Nbc732c5881a0452da7cfb3dba6d8a745 schema:name dimensions_id
97 schema:value pub.1020794792
98 rdf:type schema:PropertyValue
99 Nbd44753db3f64ed7b7bdf3ddcd33333e rdf:first sg:person.013522516217.56
100 rdf:rest Nec3a11a89ab641ddb81ab76e6c537783
101 Nca8c89d78c2548dcb6f6ad8fa7adf54e rdf:first N0856f9e050ee4a96b518f296c6cdcdf1
102 rdf:rest rdf:nil
103 Ndc72f10f3b0d48cda49f8fa164ae6157 schema:isbn 978-3-319-43424-7
104 978-3-319-43425-4
105 schema:name Quantitative Evaluation of Systems
106 rdf:type schema:Book
107 Nec3a11a89ab641ddb81ab76e6c537783 rdf:first sg:person.011375012273.39
108 rdf:rest N061ccf799f724006a28237f0f655d3d6
109 Nfb24cff62089474f9b51c79229134ca9 rdf:first N166d3164407f4cc8b8dd666b41262a55
110 rdf:rest Nca8c89d78c2548dcb6f6ad8fa7adf54e
111 anzsrc-for:08 schema:inDefinedTermSet anzsrc-for:
112 schema:name Information and Computing Sciences
113 rdf:type schema:DefinedTerm
114 anzsrc-for:0802 schema:inDefinedTermSet anzsrc-for:
115 schema:name Computation Theory and Mathematics
116 rdf:type schema:DefinedTerm
117 sg:person.011375012273.39 schema:affiliation grid-institutes:grid.4991.5
118 schema:familyName Kwiatkowska
119 schema:givenName Marta
120 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.011375012273.39
121 rdf:type schema:Person
122 sg:person.011532541500.46 schema:affiliation grid-institutes:grid.4991.5
123 schema:familyName Laurenti
124 schema:givenName Luca
125 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.011532541500.46
126 rdf:type schema:Person
127 sg:person.013522516217.56 schema:affiliation grid-institutes:grid.4991.5
128 schema:familyName Cardelli
129 schema:givenName Luca
130 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.013522516217.56
131 rdf:type schema:Person
132 sg:person.0722040335.58 schema:affiliation grid-institutes:grid.5133.4
133 schema:familyName Bortolussi
134 schema:givenName Luca
135 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.0722040335.58
136 rdf:type schema:Person
137 grid-institutes:grid.4991.5 schema:alternateName Department of Computer Science, University of Oxford, Oxford, UK
138 schema:name Department of Computer Science, University of Oxford, Oxford, UK
139 Microsoft Research, Cambridge, UK
140 rdf:type schema:Organization
141 grid-institutes:grid.5133.4 schema:alternateName Department of Mathematics and Geosciences, University of Trieste, Trieste, Italy
142 schema:name Department of Mathematics and Geosciences, University of Trieste, Trieste, Italy
143 rdf:type schema:Organization
 




Preview window. Press ESC to close (or click here)


...