A probabilistic logic for verifying continuous-time Markov chains

DOI10.1007/978-3-030-99527-0_1zbMATH Open1547.68426MaRDI QIDQ6535602FDOQ6535602

Publication date: 1 February 2024

Recommendations

Model-checking continuous-time Markov chains
scientific article; zbMATH DE number 1670788
Model checking conditional CSL for continuous-time Markov chains
Theoretical Aspects of Computing – ICTAC 2005
Model Checking of Continuous-Time Markov Chains Against Timed Automata Specifications

Probability and inductive logic (03B48) Continuous-time Markov processes on general state spaces (60J25) Specification and verification (program logics, model checking, etc.) (68Q60) Temporal logic (03B44)

Cites Work

Title not available (Why is that?)
A theory of timed automata
Time-Bounded Verification of CTMCs against Real-Time Specifications
Title not available (Why is that?)
A logic for reasoning about time and reliability
Über die analytischen Methoden in der Wahrscheinlichkeitsrechnung
On the zeros of exponential polynomials
Title not available (Why is that?)
Title not available (Why is that?)
Parametric real-time reasoning
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Model-checking continuous-time Markov chains
Some Consequences of Schanuel's Conjecture in Exponential Rings
Title not available (Why is that?)
How to recognize zero?
Real root isolation for tame elementary functions
Reachability problems for Markov chains
Deciding polynomial-exponential problems
Real root isolation for exp-log functions
Approximate verification of the symbolic dynamics of Markov chains
Automata-based CSL model checking
Reachability Analysis for Solvable Dynamical Systems
Decision problems for linear recurrence sequences
Model Checking of Continuous-Time Markov Chains Against Timed Automata Specifications
Efficient CTMC Model Checking of Linear Real-Time Objectives
On the zeros of exponential polynomials.
The probabilistic model checking landscape
On the Skolem problem for continuous linear dynamical systems
Time-bounded termination analysis for probabilistic programs with delays
Positive root isolation for poly-powers
Observing continuous-time MDPs by 1-clock timed automata
Monitoring CTMCs by multi-clock timed automata

Cited In (1)

On the metric temporal logic for continuous stochastic processes

This page was built for publication: A probabilistic logic for verifying continuous-time Markov chains

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6535602)