A probabilistic logic for verifying continuous-time Markov chains
From MaRDI portal
Publication:6535602
DOI10.1007/978-3-030-99527-0_1zbMath1547.68426MaRDI QIDQ6535602
Publication date: 1 February 2024
Continuous-time Markov processes on general state spaces (60J25) Probability and inductive logic (03B48) Specification and verification (program logics, model checking, etc.) (68Q60) Temporal logic (03B44)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Reachability problems for Markov chains
- On the zeros of exponential polynomials
- A theory of timed automata
- A logic for reasoning about time and reliability
- How to recognize zero?
- Über die analytischen Methoden in der Wahrscheinlichkeitsrechnung
- On the zeros of exponential polynomials.
- Time-bounded termination analysis for probabilistic programs with delays
- Real root isolation for tame elementary functions
- Positive Root Isolation for Poly-Powers
- Efficient CTMC Model Checking of Linear Real-Time Objectives
- Model Checking of Continuous-Time Markov Chains Against Timed Automata Specifications
- Automata-Based CSL Model Checking
- Time-Bounded Verification of CTMCs against Real-Time Specifications
- Observing Continuous-Time MDPs by 1-Clock Timed Automata
- Some Consequences of Schanuel's Conjecture in Exponential Rings
- The Probabilistic Model Checking Landscape
- Reachability Analysis for Solvable Dynamical Systems
- Decision Problems for Linear Recurrence Sequences
- Parametric real-time reasoning
- Deciding polynomial-exponential problems
- Approximate Verification of the Symbolic Dynamics of Markov Chains
- Model-checking continuous-time Markov chains
- Monitoring CTMCs by multi-clock timed automata
This page was built for publication: A probabilistic logic for verifying continuous-time Markov chains
