Formalisms for Specifying Markovian Population Models

We compare several languages for specifying Markovian population models such as queuing networks and chemical reaction networks. These languages -matrix descriptions, stochastic Petri nets, stoichiometric equations, stochastic process algebras, and guarded command models- all describe continuous-time Markov chains, but they differ according to important properties, such as compositionality, expressiveness; and succinctness, executability, ease of use, and the support they provide for checking the well-formedness of a model and for analyzing a model.


Published in:
Reachability Problems, Proceedings, 5797, 3-23
Presented at:
3rd International Workshop on Reachability Problems, Palaiseau, FRANCE, Sep 23-25, 2009
Year:
2009
Publisher:
Springer-Verlag New York, Ms Ingrid Cunningham, 175 Fifth Ave, New York, Ny 10010 Usa
Keywords:
Laboratories:




 Record created 2010-11-30, last modified 2018-01-28


Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)