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