Book section
Syntactic markovian bisimulation for chemical reaction networks
- Abstract:
-
In chemical reaction networks (CRNs) with stochastic semantics based on continuous-time Markov chains (CTMCs), the typically large populations of species cause combinatorially large state spaces. This makes the analysis very difficult in practice and represents the major bottleneck for the applicability of minimization techniques based, for instance, on lumpability. In this paper we present syntactic Markovian bisimulation (SMB), a notion of bisimulation developed in the Larsen-Skou style of ...
Expand abstract
- Publication status:
- Published
- Peer review status:
- Peer reviewed
- Version:
- Accepted Manuscript
Actions
Access Document
- Files:
-
-
(pdf, 327.5KB)
-
- Publisher copy:
- 10.1007/978-3-319-63121-9_23
Why is the content I wish to access not available via ORA?
Bibliographic data (the information relating to research outputs) and full-text items (e.g. articles, theses, reports, etc.) arrive in ORA from several different sources. Unfortunately we are not able to make available the full-text for every research output.
Please contact the ORA team (
) if you have queries regarding unavailable content OR if you are aware of a full-text copy we can make available.
) if you have queries regarding unavailable content OR if you are aware of a full-text copy we can make available.
Content may be unavailable for the following four reasons
-
Version unsuitable
-
We have not obtained a suitable full-text for a given research output. See this page for more information.
-
Recently completed
-
Sometimes content is held in ORA but is unavailable for a fixed period of time to comply with the policies and wishes of rights holders.
-
Permissions
-
All content made available in ORA should comply with relevant rights, such as copyright. See this page for more information.
-
Clearance
-
Some thesis volumes scanned as part of the digitisation scheme funded by Dr Leonard Polonsky are currently unavailable due to sensitive material or uncleared third-party copyright content. We are attempting to contact authors whose theses are affected.
Alternative access to the full-text
You may be able to access the full-text directly from the publisher's website using the 'Publisher Copy' link in the 'Links & Downloads' box from a research output's ORA record page. This method may require an institutional or individual subscription to the journal/resource.
Authors
Contributors
+ Aceto, L
Role:
Editor
+ Bacci, G
Role:
Editor
+ Bacci, G
Role:
Editor
+ Ingólfsdóttir, A
Role:
Editor
+ Legay, A
Role:
Editor
Expand contributors...
Funding
Bibliographic Details
- Publisher:
- Springer, Cham Publisher's website
- Volume:
- 10460
- Pages:
- 466-483
- Series:
- Lecture Notes in Computer Science
- Host title:
- Models, Algorithms, Logics and Tools
- Publication date:
- 2017-07-25
- DOI:
- ISSN:
-
0302-9743
- Pubs id:
-
pubs:724764
- URN:
-
uri:6b46dbcb-a2f0-4bef-8b8f-f1d8ea278129
- UUID:
-
uuid:6b46dbcb-a2f0-4bef-8b8f-f1d8ea278129
- Local pid:
- pubs:724764
- ISBN:
- 978-3-319-63120-2
Terms of use
- Copyright holder:
- Springer International Publishing AG
- Copyright date:
- 2017
- Notes:
-
Copyright © 2017 Springer International Publishing AG. This is the accepted manuscript version of the chapter. The final version is available online from Springer at: https://doi.org/10.1007/978-3-319-63121-9_23
If you are the owner of this record, you can report an update to it here: Report update to this record