Output details
11 - Computer Science and Informatics
Birkbeck College
Article title
Model Checking of Continuous-Time Markov Chains Against Timed Automata Specifications
Type
D - Journal article
Title of journal
Logical Methods in Computer Science
Article number
12
Volume number
7
Issue number
1
First page of article
1
ISSN of journal
18605974
Year of publication
2011
URL
-
Number of additional authors
3
Additional information
<7> This paper gives a solution to a long-standing open problem of model-checking finite continuous-time Markov chains against a linear real-time specification given as a deterministic timed automaton with finite or Muller acceptance conditions. This work has been applied to queuing networks, robotics, and system biology, by researchers from University of Saarland. The paper is an extended version of a paper presented at LICS'09, itself extensively cited in Google Scholar.
Interdisciplinary
-
Cross-referral requested
-
Research group
B - Information Management and Web Technologies
Citation count
16
Proposed double-weighted
No
Double-weighted statement
-
Reserve for a double-weighted output
No
Non-English
No
English abstract
-
