Model-checking continuous-time Markov chains

By A. Aziz, K. Sanwal, V. Singhal, Robert K. Brayton. ACM Transactions on Computational Logic, 2000

455 citations recorded by the source corpus.

Subfields: Computational Theory and Mathematics, Hardware and Architecture

View Paper: https://www.semanticscholar.org/paper/eddd839f63dd36e1d5998e02baecd920fbb499f2

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computational Theory and Mathematics

1. Marta Z. Kwiatkowska
2. David Parker
3. Gethin Norman
4. Joost-Pieter Katoen
5. Koushik Sen
6. Christel Baier
7. Gul A. Agha
8. Mahesh Viswanathan

In Hardware and Architecture

1. Koushik Sen
2. Marta Z. Kwiatkowska

Citations in the corpus

• Stochastic Model Checking (2007, methodology): “[4,5] and since extended by Baier et al.”
• Probabilistic Verification of Discrete Event Systems Using Acceptance Sampling (2002, background): “CSL has previously been proposed as a formalism for expressing temporal and probabilistic properties of continuous-time Markov chains (CTMCs) [3, 4 , 5] and SMPs [12].”
• Model-Checking Algorithms for Continuous-Time Markov Chains (2002, methodology): “CSL is a branching-time temporal logic a ´ la CTL [32] with state and path formulas based on [9].”
• Statistical Model Checking of Black-Box Probabilistic Systems (2004, background): “This can be specified using the CSL formula P ≥0.9 (P ≥0.5 (true U ≤T2 communicate) U ≤T1 goal ).”