---
res:
  bibo_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.@eng
  bibo_authorlist:
  - foaf_Person:
      foaf_givenName: Thomas A
      foaf_name: Henzinger, Thomas A
      foaf_surname: Henzinger
      foaf_workInfoHomepage: http://www.librecat.org/personId=40876CD8-F248-11E8-B48F-1D18A9856A87
    orcid: 0000−0002−2985−7724
  - foaf_Person:
      foaf_givenName: Barbara
      foaf_name: Jobstmann, Barbara
      foaf_surname: Jobstmann
  - foaf_Person:
      foaf_givenName: Verena
      foaf_name: Wolf, Verena
      foaf_surname: Wolf
  bibo_doi: 10.1142/S0129054111008441
  bibo_issue: '4'
  bibo_volume: 22
  dct_date: 2011^xs_gYear
  dct_identifier:
  - UT:000291552600005
  dct_language: eng
  dct_publisher: World Scientific Publishing@
  dct_title: Formalisms for specifying Markovian population models@
...