{"doi":"10.1007/978-3-642-04420-5_2","page":"3 - 23","author":[{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","first_name":"Thomas A","last_name":"Henzinger","orcid":"0000−0002−2985−7724"},{"full_name":"Jobstmann, Barbara","first_name":"Barbara","last_name":"Jobstmann"},{"full_name":"Wolf, Verena","first_name":"Verena","last_name":"Wolf"}],"has_accepted_license":"1","conference":{"name":"RP: Reachability Problems","start_date":"2009-09-23","end_date":"2009-09-25","location":"Palaiseau, France"},"citation":{"short":"T.A. Henzinger, B. Jobstmann, V. Wolf, in:, Springer, 2009, pp. 3–23.","ama":"Henzinger TA, Jobstmann B, Wolf V. Formalisms for specifying Markovian population models. In: Vol 5797. Springer; 2009:3-23. doi:<a href=\"https://doi.org/10.1007/978-3-642-04420-5_2\">10.1007/978-3-642-04420-5_2</a>","apa":"Henzinger, T. A., Jobstmann, B., &#38; Wolf, V. (2009). Formalisms for specifying Markovian population models (Vol. 5797, pp. 3–23). Presented at the RP: Reachability Problems, Palaiseau, France: Springer. <a href=\"https://doi.org/10.1007/978-3-642-04420-5_2\">https://doi.org/10.1007/978-3-642-04420-5_2</a>","ista":"Henzinger TA, Jobstmann B, Wolf V. 2009. Formalisms for specifying Markovian population models. RP: Reachability Problems, LNCS, vol. 5797, 3–23.","chicago":"Henzinger, Thomas A, Barbara Jobstmann, and Verena Wolf. “Formalisms for Specifying Markovian Population Models,” 5797:3–23. Springer, 2009. <a href=\"https://doi.org/10.1007/978-3-642-04420-5_2\">https://doi.org/10.1007/978-3-642-04420-5_2</a>.","ieee":"T. A. Henzinger, B. Jobstmann, and V. Wolf, “Formalisms for specifying Markovian population models,” presented at the RP: Reachability Problems, Palaiseau, France, 2009, vol. 5797, pp. 3–23.","mla":"Henzinger, Thomas A., et al. <i>Formalisms for Specifying Markovian Population Models</i>. Vol. 5797, Springer, 2009, pp. 3–23, doi:<a href=\"https://doi.org/10.1007/978-3-642-04420-5_2\">10.1007/978-3-642-04420-5_2</a>."},"language":[{"iso":"eng"}],"pubrep_id":"67","_id":"3841","volume":5797,"publist_id":"2352","intvolume":"      5797","year":"2009","file_date_updated":"2020-07-14T12:46:16Z","acknowledgement":"This research was supported in part by the Excellence Cluster on Multimodal Computing and Interaction and the Swiss National Science Foundation.","ddc":["005"],"day":"07","file":[{"file_id":"4702","date_created":"2018-12-12T10:08:41Z","file_size":222840,"date_updated":"2020-07-14T12:46:16Z","content_type":"application/pdf","access_level":"open_access","creator":"system","file_name":"IST-2012-67-v1+1_Formalisms_for_specifying_Markovian_population_models.pdf","checksum":"df88431872586c773fbcfea37d7b36a2","relation":"main_file"}],"type":"conference","date_updated":"2023-02-23T11:24:49Z","month":"09","date_published":"2009-09-07T00:00:00Z","publication_status":"published","abstract":[{"lang":"eng","text":"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. "}],"department":[{"_id":"ToHe"}],"date_created":"2018-12-11T12:05:28Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1,"oa_version":"Submitted Version","scopus_import":1,"publisher":"Springer","related_material":{"record":[{"id":"3381","relation":"later_version","status":"public"}]},"status":"public","title":"Formalisms for specifying Markovian population models","quality_controlled":"1","alternative_title":["LNCS"]}