Formalisms For Specifying Markovian Population Models

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.

@article{henzingerFormalismsForSpecifyingMarkovian2011,
 author = {Thomas Henzinger and Barbara Jobstmann and Verena Wolf},
 doi = {10.1142/S0129054111008441},
 journal = {International Journal of Foundations of Computer Science},
 month = {6},
 number = {04},
 pages = {823-841},
 publisher = {World Scientific Publishing Company, Singapur},
 title = {Formalisms For Specifying Markovian Population Models},
 volume = {22},
 year = {2011}
}