@article{3381,
  abstract     = {In this survey, we compare several languages for specifying Markovian population models such as queuing networks and chemical reaction networks. All these languages — matrix descriptions, stochastic Petri nets, stoichiometric equations, stochastic process algebras, and guarded command models — describe continuous-time Markov chains, but they differ according to important properties, such as compositionality, expressiveness and succinctness, executability, and ease of use. Moreover, they provide different support for checking the well-formedness of a model and for analyzing a model.},
  author       = {Henzinger, Thomas A and Jobstmann, Barbara and Wolf, Verena},
  journal      = {IJFCS: International Journal of Foundations of Computer Science},
  number       = {4},
  pages        = {823 -- 841},
  publisher    = {World Scientific Publishing},
  title        = {{Formalisms for specifying Markovian population models}},
  doi          = {10.1142/S0129054111008441},
  volume       = {22},
  year         = {2011},
}