Model-checking continuous-time Markov chains-Reference-Cited by-同舟云学术

Model-checking continuous-time Markov chains

Published:2000-07 Issue:1 Volume:1 Page:162-170
ISSN:1529-3785
Container-title:ACM Transactions on Computational Logic
language:en
Short-container-title:ACM Trans. Comput. Logic

Author:

Aziz Adnan¹,Sanwal Kumud²,Singhal Vigyan³,Brayton Robert⁴

Affiliation:

1. Univ. of Texas at Austin, Austin

2. Lucent Technologies

3. Tempus-Fugit, Inc.

4. Univ. of California at Berkeley, Berkeley

Abstract

We present a logical formalism for expressing properties of continuous-time Markov chains. The semantics for such properties arise as a natural extension of previous work on discrete-time Markov chains to continuous time. The major result is that the verification problem is decidable; this is shown using results in algebraic and transcendental number theory.

Publisher

Association for Computing Machinery (ACM)

Subject

Computational Mathematics,Logic,General Computer Science,Theoretical Computer Science

Link

https://dl.acm.org/doi/pdf/10.1145/343369.343402

Reference13 articles.

1. Temporal and modal logic. In Handbook of Theoretical Computer Science, Vol. B: Formal Models and Semantics, J. van Leeuwen, Ed. MIT Press, Cambridge;EMERSON E.A.;MA,1990

Cited by 226 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Formal dependability analysis of fault tolerant Virtual Machine allocation strategies in Cloud Radio Access Network;Journal of Network and Computer Applications;2024-09

2. Patterns of Applied Control for Public Health Measures on Transportation Services under Epidemic;Proceedings of the 19th International Symposium on Software Engineering for Adaptive and Self-Managing Systems;2024-04-15

3. A Formal Framework of Model and Logical Embeddings for Verification of Stochastic Systems;Proceedings of the 39th ACM/SIGAPP Symposium on Applied Computing;2024-04-08

4. Formally verifying decompositions of stochastic specifications;International Journal on Software Tools for Technology Transfer;2024-02-21

5. Bounded model checking for interval probabilistic timed graph transformation systems against properties of probabilistic metric temporal graph logic;Journal of Logical and Algebraic Methods in Programming;2024-02