Formalisms for Specifying Markovian Population Models

  • Authors:
  • Thomas A. Henzinger;Barbara Jobstmann;Verena Wolf

  • Affiliations:
  • EPFL, Switzerland and IST Austria (Institute of Science and Technology, Austria);EPFL, Switzerland;EPFL, Switzerland and Saarland University, Germany

  • Venue:
  • RP '09 Proceedings of the 3rd International Workshop on Reachability Problems
  • Year:
  • 2009

Quantified Score

Hi-index 0.02

Visualization

Abstract

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.