Trace Machines for Observing Continuous-Time Markov Chains. Wolf, V., Baier, C., & Majster-Cederbaum, M. Electronic Notes in Theoretical Computer Science, 2006. doi abstract bibtex In this paper, we study several linear-time equivalences (Markovian trace equivalence, failure and ready trace equivalence) for continuous-time Markov chains that refer to the probabilities for timed execution paths. Our focus is on testing scenarios by means of push-button experiments with appropriate trace machines and a discussion of the connections between the equivalences. For Markovian trace equivalence, we provide alternative characterizations, including one that abstracts away from the time instances where actions are observed, but just reports on the average sojourn times in the states. This result is used for a reduction of the question whether two finite-state continuous-time Markov chains are Markovian trace equivalent to the probabilistic trace equivalence problem for discrete-time Markov chains (and the latter is known to be solvable in polynomial time). © 2006 Elsevier B.V. All rights reserved.
@article{
title = {Trace Machines for Observing Continuous-Time Markov Chains},
type = {article},
year = {2006},
keywords = {Markov chain,button pushing experiment,linear-time semantics,trace equivalence,trace machine},
volume = {153},
id = {15fe5983-c973-300d-8d62-e465bc559b13},
created = {2017-12-21T13:50:26.456Z},
file_attached = {false},
profile_id = {bbb99b2d-2278-3254-820f-2de6d915ce63},
last_modified = {2017-12-21T13:50:26.456Z},
read = {false},
starred = {false},
authored = {true},
confirmed = {false},
hidden = {false},
private_publication = {false},
abstract = {In this paper, we study several linear-time equivalences (Markovian trace equivalence, failure and ready trace equivalence) for continuous-time Markov chains that refer to the probabilities for timed execution paths. Our focus is on testing scenarios by means of push-button experiments with appropriate trace machines and a discussion of the connections between the equivalences. For Markovian trace equivalence, we provide alternative characterizations, including one that abstracts away from the time instances where actions are observed, but just reports on the average sojourn times in the states. This result is used for a reduction of the question whether two finite-state continuous-time Markov chains are Markovian trace equivalent to the probabilistic trace equivalence problem for discrete-time Markov chains (and the latter is known to be solvable in polynomial time). © 2006 Elsevier B.V. All rights reserved.},
bibtype = {article},
author = {Wolf, V. and Baier, C. and Majster-Cederbaum, M.},
doi = {10.1016/j.entcs.2005.10.042},
journal = {Electronic Notes in Theoretical Computer Science},
number = {2 SPEC. ISS.}
}
Downloads: 0
{"_id":"BawFXnjmpPDBqkxHh","bibbaseid":"wolf-baier-majstercederbaum-tracemachinesforobservingcontinuoustimemarkovchains-2006","downloads":0,"creationDate":"2017-12-22T10:03:12.299Z","title":"Trace Machines for Observing Continuous-Time Markov Chains","author_short":["Wolf, V.","Baier, C.","Majster-Cederbaum, M."],"year":2006,"bibtype":"article","biburl":"https://bibbase.org/service/mendeley/bbb99b2d-2278-3254-820f-2de6d915ce63","bibdata":{"title":"Trace Machines for Observing Continuous-Time Markov Chains","type":"article","year":"2006","keywords":"Markov chain,button pushing experiment,linear-time semantics,trace equivalence,trace machine","volume":"153","id":"15fe5983-c973-300d-8d62-e465bc559b13","created":"2017-12-21T13:50:26.456Z","file_attached":false,"profile_id":"bbb99b2d-2278-3254-820f-2de6d915ce63","last_modified":"2017-12-21T13:50:26.456Z","read":false,"starred":false,"authored":"true","confirmed":false,"hidden":false,"private_publication":false,"abstract":"In this paper, we study several linear-time equivalences (Markovian trace equivalence, failure and ready trace equivalence) for continuous-time Markov chains that refer to the probabilities for timed execution paths. Our focus is on testing scenarios by means of push-button experiments with appropriate trace machines and a discussion of the connections between the equivalences. For Markovian trace equivalence, we provide alternative characterizations, including one that abstracts away from the time instances where actions are observed, but just reports on the average sojourn times in the states. This result is used for a reduction of the question whether two finite-state continuous-time Markov chains are Markovian trace equivalent to the probabilistic trace equivalence problem for discrete-time Markov chains (and the latter is known to be solvable in polynomial time). © 2006 Elsevier B.V. All rights reserved.","bibtype":"article","author":"Wolf, V. and Baier, C. and Majster-Cederbaum, M.","doi":"10.1016/j.entcs.2005.10.042","journal":"Electronic Notes in Theoretical Computer Science","number":"2 SPEC. ISS.","bibtex":"@article{\n title = {Trace Machines for Observing Continuous-Time Markov Chains},\n type = {article},\n year = {2006},\n keywords = {Markov chain,button pushing experiment,linear-time semantics,trace equivalence,trace machine},\n volume = {153},\n id = {15fe5983-c973-300d-8d62-e465bc559b13},\n created = {2017-12-21T13:50:26.456Z},\n file_attached = {false},\n profile_id = {bbb99b2d-2278-3254-820f-2de6d915ce63},\n last_modified = {2017-12-21T13:50:26.456Z},\n read = {false},\n starred = {false},\n authored = {true},\n confirmed = {false},\n hidden = {false},\n private_publication = {false},\n abstract = {In this paper, we study several linear-time equivalences (Markovian trace equivalence, failure and ready trace equivalence) for continuous-time Markov chains that refer to the probabilities for timed execution paths. Our focus is on testing scenarios by means of push-button experiments with appropriate trace machines and a discussion of the connections between the equivalences. For Markovian trace equivalence, we provide alternative characterizations, including one that abstracts away from the time instances where actions are observed, but just reports on the average sojourn times in the states. This result is used for a reduction of the question whether two finite-state continuous-time Markov chains are Markovian trace equivalent to the probabilistic trace equivalence problem for discrete-time Markov chains (and the latter is known to be solvable in polynomial time). © 2006 Elsevier B.V. All rights reserved.},\n bibtype = {article},\n author = {Wolf, V. and Baier, C. and Majster-Cederbaum, M.},\n doi = {10.1016/j.entcs.2005.10.042},\n journal = {Electronic Notes in Theoretical Computer Science},\n number = {2 SPEC. ISS.}\n}","author_short":["Wolf, V.","Baier, C.","Majster-Cederbaum, M."],"biburl":"https://bibbase.org/service/mendeley/bbb99b2d-2278-3254-820f-2de6d915ce63","bibbaseid":"wolf-baier-majstercederbaum-tracemachinesforobservingcontinuoustimemarkovchains-2006","role":"author","urls":{},"keyword":["Markov chain","button pushing experiment","linear-time semantics","trace equivalence","trace machine"],"metadata":{"authorlinks":{"wolf, v":"https://mosi.uni-saarland.de/research/"}},"downloads":0},"search_terms":["trace","machines","observing","continuous","time","markov","chains","wolf","baier","majster-cederbaum"],"keywords":["markov chain","button pushing experiment","linear-time semantics","trace equivalence","trace machine"],"authorIDs":["6TtMsgho6wSDppwNh"],"dataSources":["me3WD7pwWySxCKW8s","ya2CyA73rpZseyrZ8"]}