{"file":[{"access_level":"open_access","relation":"main_file","file_name":"IST-2016-628-v1+1_journals-ijfcs-HenzingerJW11.pdf","checksum":"df88431872586c773fbcfea37d7b36a2","file_id":"4707","date_created":"2018-12-12T10:08:45Z","content_type":"application/pdf","creator":"system","date_updated":"2020-07-14T12:46:11Z","file_size":222840}],"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","page":"823 - 841","file_date_updated":"2020-07-14T12:46:11Z","publist_id":"3226","language":[{"iso":"eng"}],"quality_controlled":"1","pubrep_id":"628","related_material":{"record":[{"relation":"earlier_version","id":"3841","status":"public"}]},"intvolume":"        22","oa":1,"_id":"3381","volume":22,"author":[{"orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","last_name":"Henzinger","first_name":"Thomas A"},{"first_name":"Barbara","last_name":"Jobstmann","full_name":"Jobstmann, Barbara"},{"full_name":"Wolf, Verena","last_name":"Wolf","first_name":"Verena"}],"doi":"10.1142/S0129054111008441","day":"01","publication_status":"published","publication":"IJFCS: International Journal of Foundations of Computer Science","date_published":"2011-06-01T00:00:00Z","department":[{"_id":"ToHe"}],"oa_version":"Submitted Version","status":"public","issue":"4","publisher":"World Scientific Publishing","abstract":[{"text":"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.","lang":"eng"}],"ddc":["000"],"year":"2011","month":"06","date_updated":"2023-02-23T11:45:03Z","title":"Formalisms for specifying Markovian population models","scopus_import":1,"date_created":"2018-12-11T12:03:00Z","has_accepted_license":"1","type":"journal_article","citation":{"mla":"Henzinger, Thomas A., et al. “Formalisms for Specifying Markovian Population Models.” <i>IJFCS: International Journal of Foundations of Computer Science</i>, vol. 22, no. 4, World Scientific Publishing, 2011, pp. 823–41, doi:<a href=\"https://doi.org/10.1142/S0129054111008441\">10.1142/S0129054111008441</a>.","ama":"Henzinger TA, Jobstmann B, Wolf V. Formalisms for specifying Markovian population models. <i>IJFCS: International Journal of Foundations of Computer Science</i>. 2011;22(4):823-841. doi:<a href=\"https://doi.org/10.1142/S0129054111008441\">10.1142/S0129054111008441</a>","ieee":"T. A. Henzinger, B. Jobstmann, and V. Wolf, “Formalisms for specifying Markovian population models,” <i>IJFCS: International Journal of Foundations of Computer Science</i>, vol. 22, no. 4. World Scientific Publishing, pp. 823–841, 2011.","ista":"Henzinger TA, Jobstmann B, Wolf V. 2011. Formalisms for specifying Markovian population models. IJFCS: International Journal of Foundations of Computer Science. 22(4), 823–841.","short":"T.A. Henzinger, B. Jobstmann, V. Wolf, IJFCS: International Journal of Foundations of Computer Science 22 (2011) 823–841.","apa":"Henzinger, T. A., Jobstmann, B., &#38; Wolf, V. (2011). Formalisms for specifying Markovian population models. <i>IJFCS: International Journal of Foundations of Computer Science</i>. World Scientific Publishing. <a href=\"https://doi.org/10.1142/S0129054111008441\">https://doi.org/10.1142/S0129054111008441</a>","chicago":"Henzinger, Thomas A, Barbara Jobstmann, and Verena Wolf. “Formalisms for Specifying Markovian Population Models.” <i>IJFCS: International Journal of Foundations of Computer Science</i>. World Scientific Publishing, 2011. <a href=\"https://doi.org/10.1142/S0129054111008441\">https://doi.org/10.1142/S0129054111008441</a>."}}