Model Checking of Continuous-Time Markov Chains Against Timed Automata Specifications

Model Checking of Continuous-Time Markov Chains Against Timed Automata Specifications

We study the verification of a finite continuous-time Markov chain (CTMC) C against a linear real-time specification given as a deterministic timed automaton (DTA) A with finite or Muller acceptance conditions. The central question that we address is: what is the probability of the set of paths of C...

Cijeli opis

Bibliografski detalji
Glavni autori: Taolue Chen, Tingting Han, Joost-Pieter Katoen, Alexandru Mereacre
Format: Članak
Jezik:English
Izdano: Logical Methods in Computer Science e.V. 2011-03-01
Serija:Logical Methods in Computer Science
Teme:
computer science - logic in computer science
d.2.4
Online pristup:https://lmcs.episciences.org/697/pdf

Internet

https://lmcs.episciences.org/697/pdf

Slični predmeti