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...
Main Authors: | Cardelli, L, Grosu, R, Larsen, KG, Tribastone, M, Tschaikowski, M, Vandin, A |
---|---|
Format: | Journal article |
Language: | English |
Published: |
IEEE
2023
|
Similar Items
-
Lumpability for uncertain continuous-time Markov chains
by: Cardelli, L, et al.
Published: (2021) -
Comparing chemical reaction networks: A categorical and algorithmic perspective
by: Cardelli, L, et al.
Published: (2017) -
Comparing chemical reaction networks: a categorical and algorithmic perspective
by: Cardelli, L, et al.
Published: (2016) -
Efficient syntax-driven lumping of differential equations
by: Cardelli, L, et al.
Published: (2016) -
Syntactic markovian bisimulation for chemical reaction networks
by: Cardelli, L, et al.
Published: (2017)