Abstract
We will write a language for specifying continuous-time Markov chains (CTMCs) and for computing the likelihood of parameters in such CTMCs given a trace of which states the chain is in at different time points. As with the list comprehension example in the previous chapter, we are not going to use operators to create a new syntax for the language but will create a DSL by providing functions that can be strung together to construct “sentences.”
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2018 Thomas Mailund
About this chapter
Cite this chapter
Mailund, T. (2018). Continuous-Time Markov Chains. In: Domain-Specific Languages in R. Apress, Berkeley, CA. https://doi.org/10.1007/978-1-4842-3588-1_10
Download citation
DOI: https://doi.org/10.1007/978-1-4842-3588-1_10
Published:
Publisher Name: Apress, Berkeley, CA
Print ISBN: 978-1-4842-3587-4
Online ISBN: 978-1-4842-3588-1
eBook Packages: Professional and Applied ComputingApress Access BooksProfessional and Applied Computing (R0)