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...
Principais autores: | Cardelli, L, Grosu, R, Larsen, KG, Tribastone, M, Tschaikowski, M, Vandin, A |
---|---|
Formato: | Journal article |
Idioma: | English |
Publicado em: |
IEEE
2023
|
Registros relacionados
-
Lumpability for uncertain continuous-time Markov chains
por: Cardelli, L, et al.
Publicado em: (2021) -
Comparing chemical reaction networks: a categorical and algorithmic perspective
por: Cardelli, L, et al.
Publicado em: (2016) -
Comparing chemical reaction networks: A categorical and algorithmic perspective
por: Cardelli, L, et al.
Publicado em: (2017) -
Syntactic markovian bisimulation for chemical reaction networks
por: Cardelli, L, et al.
Publicado em: (2017) -
Guaranteed Error Bounds on Approximate Model Abstractions through Reachability Analysis
por: Cardelli, L, et al.
Publicado em: (2018)