Comparative branching-time semantics for Markov chains. Baier, C., Katoen, J., Hermanns, H., & Wolf, V. Information and Computation, 200:149-214, Elsevier, 2005.
Website abstract bibtex This paper presents various semantics in the branching-time spectrum of discrete-time and continuous-time Markov chains (DTMCs and CTMCs). Strong and weak bisimulation equivalence and simulation pre-orders are covered and are logically characterized in terms of the temporal logics Probabilistic Computation Tree Logic (PCTL) and Continuous Stochastic Logic (CSL). Apart from presenting various existing branching-time relations in a uniform manner, this paper presents the following new results: (i) strong simulation for CTMCs, (ii) weak simulation for CTMCs and DTMCs, (iii) logical characterizations thereof (including weak bisimulation for DTMCs), (iv) a relation between weak bisimulation and weak simulation equivalence, and (v) various connections between equivalences and pre-orders in the continuous- and discrete-time setting. The results are summarized in a branching-time spectrum for DTMCs and CTMCs elucidating their semantics as well as their relationship.
@article{
title = {Comparative branching-time semantics for Markov chains},
type = {article},
year = {2005},
pages = {149-214},
volume = {200},
websites = {http://www.sciencedirect.com/science/article/pii/S0890540105000441},
publisher = {Elsevier},
id = {b52099dd-a8ff-36b2-8677-2fa31b1bcb9d},
created = {2016-02-15T08:58:38.000Z},
file_attached = {false},
profile_id = {bbb99b2d-2278-3254-820f-2de6d915ce63},
last_modified = {2017-03-22T13:51:34.979Z},
read = {false},
starred = {false},
authored = {true},
confirmed = {true},
hidden = {false},
citation_key = {BKHW05},
source_type = {article},
private_publication = {false},
abstract = {This paper presents various semantics in the branching-time spectrum of discrete-time and continuous-time Markov chains (DTMCs and CTMCs). Strong and weak bisimulation equivalence and simulation pre-orders are covered and are logically characterized in terms of the temporal logics Probabilistic Computation Tree Logic (PCTL) and Continuous Stochastic Logic (CSL). Apart from presenting various existing branching-time relations in a uniform manner, this paper presents the following new results: (i) strong simulation for CTMCs, (ii) weak simulation for CTMCs and DTMCs, (iii) logical characterizations thereof (including weak bisimulation for DTMCs), (iv) a relation between weak bisimulation and weak simulation equivalence, and (v) various connections between equivalences and pre-orders in the continuous- and discrete-time setting. The results are summarized in a branching-time spectrum for DTMCs and CTMCs elucidating their semantics as well as their relationship.},
bibtype = {article},
author = {Baier, C and Katoen, J.-P. and Hermanns, H and Wolf, V},
journal = {Information and Computation}
}
Downloads: 0
{"_id":"LWNfghKq5dtxRwxdy","bibbaseid":"baier-katoen-hermanns-wolf-comparativebranchingtimesemanticsformarkovchains-2005","author_short":["Baier, C.","Katoen, J.","Hermanns, H.","Wolf, V."],"bibdata":{"title":"Comparative branching-time semantics for Markov chains","type":"article","year":"2005","pages":"149-214","volume":"200","websites":"http://www.sciencedirect.com/science/article/pii/S0890540105000441","publisher":"Elsevier","id":"b52099dd-a8ff-36b2-8677-2fa31b1bcb9d","created":"2016-02-15T08:58:38.000Z","file_attached":false,"profile_id":"bbb99b2d-2278-3254-820f-2de6d915ce63","last_modified":"2017-03-22T13:51:34.979Z","read":false,"starred":false,"authored":"true","confirmed":"true","hidden":false,"citation_key":"BKHW05","source_type":"article","private_publication":false,"abstract":"This paper presents various semantics in the branching-time spectrum of discrete-time and continuous-time Markov chains (DTMCs and CTMCs). Strong and weak bisimulation equivalence and simulation pre-orders are covered and are logically characterized in terms of the temporal logics Probabilistic Computation Tree Logic (PCTL) and Continuous Stochastic Logic (CSL). Apart from presenting various existing branching-time relations in a uniform manner, this paper presents the following new results: (i) strong simulation for CTMCs, (ii) weak simulation for CTMCs and DTMCs, (iii) logical characterizations thereof (including weak bisimulation for DTMCs), (iv) a relation between weak bisimulation and weak simulation equivalence, and (v) various connections between equivalences and pre-orders in the continuous- and discrete-time setting. The results are summarized in a branching-time spectrum for DTMCs and CTMCs elucidating their semantics as well as their relationship.","bibtype":"article","author":"Baier, C and Katoen, J.-P. and Hermanns, H and Wolf, V","journal":"Information and Computation","bibtex":"@article{\n title = {Comparative branching-time semantics for Markov chains},\n type = {article},\n year = {2005},\n pages = {149-214},\n volume = {200},\n websites = {http://www.sciencedirect.com/science/article/pii/S0890540105000441},\n publisher = {Elsevier},\n id = {b52099dd-a8ff-36b2-8677-2fa31b1bcb9d},\n created = {2016-02-15T08:58:38.000Z},\n file_attached = {false},\n profile_id = {bbb99b2d-2278-3254-820f-2de6d915ce63},\n last_modified = {2017-03-22T13:51:34.979Z},\n read = {false},\n starred = {false},\n authored = {true},\n confirmed = {true},\n hidden = {false},\n citation_key = {BKHW05},\n source_type = {article},\n private_publication = {false},\n abstract = {This paper presents various semantics in the branching-time spectrum of discrete-time and continuous-time Markov chains (DTMCs and CTMCs). Strong and weak bisimulation equivalence and simulation pre-orders are covered and are logically characterized in terms of the temporal logics Probabilistic Computation Tree Logic (PCTL) and Continuous Stochastic Logic (CSL). Apart from presenting various existing branching-time relations in a uniform manner, this paper presents the following new results: (i) strong simulation for CTMCs, (ii) weak simulation for CTMCs and DTMCs, (iii) logical characterizations thereof (including weak bisimulation for DTMCs), (iv) a relation between weak bisimulation and weak simulation equivalence, and (v) various connections between equivalences and pre-orders in the continuous- and discrete-time setting. The results are summarized in a branching-time spectrum for DTMCs and CTMCs elucidating their semantics as well as their relationship.},\n bibtype = {article},\n author = {Baier, C and Katoen, J.-P. and Hermanns, H and Wolf, V},\n journal = {Information and Computation}\n}","author_short":["Baier, C.","Katoen, J.","Hermanns, H.","Wolf, V."],"urls":{"Website":"http://www.sciencedirect.com/science/article/pii/S0890540105000441"},"biburl":"https://bibbase.org/service/mendeley/bbb99b2d-2278-3254-820f-2de6d915ce63","bibbaseid":"baier-katoen-hermanns-wolf-comparativebranchingtimesemanticsformarkovchains-2005","role":"author","metadata":{"authorlinks":{}}},"bibtype":"article","biburl":"https://bibbase.org/service/mendeley/bbb99b2d-2278-3254-820f-2de6d915ce63","dataSources":["5u2EFGtZ3pCiduxDD","dXRJbWa2wiNDJKxYE","qA8W3BSHDuk7cCNvk","2252seNhipfTmjEBQ"],"keywords":[],"search_terms":["comparative","branching","time","semantics","markov","chains","baier","katoen","hermanns","wolf"],"title":"Comparative branching-time semantics for Markov chains","year":2005}