Monitoring CTMCs by multi-clock timed automata

DOI10.1007/978-3-319-96145-3_27MaRDI QIDQ6041132zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Yijun Feng, Joost-Pieter Katoen, Haokun Li, Bican Xia, Naijun Zhan

Publication date 26 May 2023

Published in Computer Aided Verification (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-96145-3_27

Mathematics Subject Classification ID

Continuous-time Markov processes on discrete state spaces (60J27) Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Recommendations

• Model Checking of Continuous-Time Markov Chains Against Timed Automata Specifications
• scientific article; zbMATH DE number 1759607
• Observing continuous-time MDPs by 1-clock timed automata
• Approximating acceptance probabilities of CTMC-paths on multi-clock deterministic timed automata
• Efficient CTMC Model Checking of Linear Real-Time Objectives

Cited in

(5)

• On-the-fly verification and optimization of DTA-properties for large Markov chains
• Measuring performance of continuous-time stochastic processes using timed automata
• Approximating acceptance probabilities of CTMC-paths on multi-clock deterministic timed automata
• Observing continuous-time MDPs by 1-clock timed automata
• A probabilistic logic for verifying continuous-time Markov chains

This page was built for publication: Monitoring CTMCs by multi-clock timed automata

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