Algorithmic minimization of uncertain continuous-time Markov chains
The assumption of perfect knowledge of rate parameters in continuous-time Markov chains (CTMCs) is undermined when confronted with reality, where they may be uncertain due to lack of information or because of measurement noise. Here we consider uncertain CTMCs (UCTMCs), where rates are assumed to va...
Những tác giả chính: | Cardelli, L, Grosu, R, Larsen, KG, Tribastone, M, Tschaikowski, M, Vandin, A |
---|---|
Định dạng: | Journal article |
Ngôn ngữ: | English |
Được phát hành: |
IEEE
2023
|
Những quyển sách tương tự
-
Lumpability for uncertain continuous-time Markov chains
Bằng: Cardelli, L, et al.
Được phát hành: (2021) -
Comparing chemical reaction networks: a categorical and algorithmic perspective
Bằng: Cardelli, L, et al.
Được phát hành: (2016) -
Comparing chemical reaction networks: A categorical and algorithmic perspective
Bằng: Cardelli, L, et al.
Được phát hành: (2017) -
Syntactic markovian bisimulation for chemical reaction networks
Bằng: Cardelli, L, et al.
Được phát hành: (2017) -
Guaranteed Error Bounds on Approximate Model Abstractions through Reachability Analysis
Bằng: Cardelli, L, et al.
Được phát hành: (2018)