Lumpability for uncertain continuous-time Markov chains
From MaRDI portal
Publication:832091
DOI10.1007/978-3-030-85172-9_21zbMath1492.60219OpenAlexW3195444073MaRDI QIDQ832091
Luca Cardelli, Mirco Tribastone, Andrea Vandin, Max Tschaikowski, Kim Guldstrand Larsen, Radu Grosu
Publication date: 24 March 2022
Full work available at URL: https://backend.orbit.dtu.dk/ws/files/262406426/qest2021.pdf
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Constraint Markov chains
- Exact epidemic models on graphs using graph-automorphism driven lumping
- Optimal state-space lumping in Markov chains
- Continuous-time Markov decision processes. Theory and applications
- Interval-valued finite Markov chains
- Exploiting robust optimization for interval probabilistic bisimulation
- From generic partition refinement to weighted tree automata minimization
- Precise parameter synthesis for stochastic biochemical systems
- Bisimulations and Logical Characterizations on Continuous-Time Markov Decision Processes
- Optimal Continuous Time Markov Decisions
- Bisimulation and Logical Preservation for Continuous-Time Markov Decision Processes
- Simple O(m logn) Time Markov Chain Lumping
- Markov Chains
- Exact and ordinary lumpability in finite Markov chains
- Discrete, Continuous, and Hybrid Petri Nets
- Polynomial-Time Alternating Probabilistic Bisimulation for Interval MDPs
- Efficient Coalgebraic Partition Refinement
- Syntactic Markovian Bisimulation for Chemical Reaction Networks
- Three-Valued Abstraction for Continuous-Time Markov Chains
- A Compositional Approach to Performance Modelling
- Symbolic computation of differential equivalences
- Model Checking Software
- Tools and Algorithms for the Construction and Analysis of Systems
