Simulation for Continuous-Time Markov Chains
Aus International Center for Computational Logic
Simulation for Continuous-Time Markov Chains
Christel BaierChristel Baier, Joost-Pieter KatoenJoost-Pieter Katoen, Holger HermannsHolger Hermanns, Boudewijn R. HaverkortBoudewijn R. Haverkort
Christel Baier, Joost-Pieter Katoen, Holger Hermanns, Boudewijn R. Haverkort
Simulation for Continuous-Time Markov Chains
13th International Conference on Concurrency Theory (CONCUR), volume 2421 of Lecture Notes in Computer Science, 338--354, 2002. Springer
Simulation for Continuous-Time Markov Chains
13th International Conference on Concurrency Theory (CONCUR), volume 2421 of Lecture Notes in Computer Science, 338--354, 2002. Springer
- KurzfassungAbstract
This paper presents a simulation preorder for continuoustime Markov chains (CTMCs). The simulation preorder is a conservative extension of a weak variant of probabilistic simulation on fully probabilistic systems, i.e., discrete-time Markov chains. The main result of the paper is that the simulation preorder preserves safety and liveness properties expressed in continuous stochastic logic (CSL), a stochastic branching-time temporal logic interpreted over CTMCs. - Forschungsgruppe:Research Group: Algebraische und logische Grundlagen der InformatikAlgebraic and Logical Foundations of Computer Science
@inproceedings{BKHH2002,
author = {Christel Baier and Joost-Pieter Katoen and Holger Hermanns and
Boudewijn R. Haverkort},
title = {Simulation for Continuous-Time Markov Chains},
booktitle = {13th International Conference on Concurrency Theory (CONCUR)},
series = {Lecture Notes in Computer Science},
volume = {2421},
publisher = {Springer},
year = {2002},
pages = {338--354},
doi = {10.1007/3-540-45694-5_23}
}