Approximating acceptance probabilities of CTMC-paths on multi-clock deterministic timed automata

DOI10.1145/2461328.2461376zbMath1362.68171arXiv1210.4787OpenAlexW2151062843MaRDI QIDQ2986937

Hongfei Fu

Publication date: 16 May 2017

Published in: Proceedings of the 16th international conference on Hybrid systems: computation and control (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1210.4787

zbMATH Keywords

model checkingcontinuous-time Markov chainsdeterministic timed automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Applications of continuous-time Markov processes on discrete state spaces (60J28)

Related Items (2)

Fluid Model Checking of Timed Properties ⋮ Verifying Probabilistic Timed Automata Against Omega-Regular Dense-Time Properties

Cites Work

• A note on two problems in connexion with graphs
• Enhancing model checking in verification by AI techniques
• Receding horizon control for temporal logic specifications
• Model Repair for Probabilistic Systems
• Markov decision processes and regular events
• A Fully Automated Framework for Control of Linear Systems from Temporal Logic Specifications
• Controlling a Class of Nonlinear Systems on Rectangles
• Diagnostic Information for Realizability
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Approximating acceptance probabilities of CTMC-paths on multi-clock deterministic timed automata