{"_id":"YcL5Zq2LLgHAWjkYA","bibbaseid":"baier-hermanns-katoen-wolf-comparativebranchingtimesemanticsformarkovchainsextendedabstract-2003","author_short":["Baier, C.","Hermanns, H.","Katoen, J.","Wolf, V."],"bibdata":{"title":"Comparative branching-time semantics for Markov chains (extended abstract)","type":"book","year":"2003","source":"Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)","volume":"2761","id":"37133f37-2c84-3b70-ab32-118413b61ccd","created":"2017-12-21T13:50:26.393Z","file_attached":false,"profile_id":"bbb99b2d-2278-3254-820f-2de6d915ce63","last_modified":"2017-12-21T13:50:26.393Z","read":false,"starred":false,"authored":"true","confirmed":false,"hidden":false,"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 characterised in terms of the temporal logics PCTL and CSL. Apart from presenting various existing branching-time relations in a uniform manner, our contributions are: (i) weak simulation for DTMCs is defined, (ii) weak bisimulation equivalence is shown to coincide with weak simulation equivalence, (iii) logical characterisation of weak (bi)simulations are provided, and (iv) a classification of branching-time relations is presented, elucidating the semantics of DTMCs, CTMCs and their interrelation. © Springer-Verlag Berlin Heidelberg 2003.","bibtype":"book","author":"Baier, C. and Hermanns, H. and Katoen, J.-P. and Wolf, V.","bibtex":"@book{\n title = {Comparative branching-time semantics for Markov chains (extended abstract)},\n type = {book},\n year = {2003},\n source = {Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)},\n volume = {2761},\n id = {37133f37-2c84-3b70-ab32-118413b61ccd},\n created = {2017-12-21T13:50:26.393Z},\n file_attached = {false},\n profile_id = {bbb99b2d-2278-3254-820f-2de6d915ce63},\n last_modified = {2017-12-21T13:50:26.393Z},\n read = {false},\n starred = {false},\n authored = {true},\n confirmed = {false},\n hidden = {false},\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 characterised in terms of the temporal logics PCTL and CSL. Apart from presenting various existing branching-time relations in a uniform manner, our contributions are: (i) weak simulation for DTMCs is defined, (ii) weak bisimulation equivalence is shown to coincide with weak simulation equivalence, (iii) logical characterisation of weak (bi)simulations are provided, and (iv) a classification of branching-time relations is presented, elucidating the semantics of DTMCs, CTMCs and their interrelation. © Springer-Verlag Berlin Heidelberg 2003.},\n bibtype = {book},\n author = {Baier, C. and Hermanns, H. and Katoen, J.-P. and Wolf, V.}\n}","author_short":["Baier, C.","Hermanns, H.","Katoen, J.","Wolf, V."],"biburl":"https://bibbase.org/service/mendeley/bbb99b2d-2278-3254-820f-2de6d915ce63","bibbaseid":"baier-hermanns-katoen-wolf-comparativebranchingtimesemanticsformarkovchainsextendedabstract-2003","role":"author","urls":{},"metadata":{"authorlinks":{}},"downloads":0},"bibtype":"book","biburl":"https://bibbase.org/service/mendeley/bbb99b2d-2278-3254-820f-2de6d915ce63","dataSources":["2252seNhipfTmjEBQ"],"keywords":[],"search_terms":["comparative","branching","time","semantics","markov","chains","extended","abstract","baier","hermanns","katoen","wolf"],"title":"Comparative branching-time semantics for Markov chains (extended abstract)","year":2003}