{"project":[{"grant_number":"P 23499-N23","call_identifier":"FWF","name":"Modern Graph Algorithmic Techniques in Formal Verification","_id":"2584A770-B435-11E9-9278-68D0E5697425"},{"_id":"25863FF4-B435-11E9-9278-68D0E5697425","name":"Game Theory","grant_number":"S11407","call_identifier":"FWF"},{"call_identifier":"FP7","grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"volume":7721,"ec_funded":1,"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1209.4499"}],"abstract":[{"text":"We focus on the realizability problem of Message Sequence Graphs (MSG), i.e. the problem whether a given MSG specification is correctly distributable among parallel components communicating via messages. This fundamental problem of MSG is known to be undecidable. We introduce a well motivated restricted class of MSG, so called controllable-choice MSG, and show that all its models are realizable and moreover it is decidable whether a given MSG model is a member of this class. In more detail, this class of MSG specifications admits a deadlock-free realization by overloading existing messages with additional bounded control data. We also show that the presented class is the largest known subclass of MSG that allows for deadlock-free realization.","lang":"eng"}],"status":"public","intvolume":"      7721","date_updated":"2020-08-11T10:09:52Z","quality_controlled":"1","day":"09","title":"Controllable-choice message sequence graphs","month":"01","_id":"2886","doi":"10.1007/978-3-642-36046-6_12","type":"conference","citation":{"ista":"Chmelik M, Řehák V. 2013. Controllable-choice message sequence graphs. 7721, 118–130.","ama":"Chmelik M, Řehák V. Controllable-choice message sequence graphs. 2013;7721:118-130. doi:<a href=\"https://doi.org/10.1007/978-3-642-36046-6_12\">10.1007/978-3-642-36046-6_12</a>","mla":"Chmelik, Martin, and Vojtěch Řehák. <i>Controllable-Choice Message Sequence Graphs</i>. Vol. 7721, Springer, 2013, pp. 118–30, doi:<a href=\"https://doi.org/10.1007/978-3-642-36046-6_12\">10.1007/978-3-642-36046-6_12</a>.","ieee":"M. Chmelik and V. Řehák, “Controllable-choice message sequence graphs,” vol. 7721. Springer, pp. 118–130, 2013.","chicago":"Chmelik, Martin, and Vojtěch Řehák. “Controllable-Choice Message Sequence Graphs.” Lecture Notes in Computer Science. Springer, 2013. <a href=\"https://doi.org/10.1007/978-3-642-36046-6_12\">https://doi.org/10.1007/978-3-642-36046-6_12</a>.","short":"M. Chmelik, V. Řehák, 7721 (2013) 118–130.","apa":"Chmelik, M., &#38; Řehák, V. (2013). Controllable-choice message sequence graphs. Presented at the MEMICS: Mathematical and Engineering Methods in Computer Science, Znojmo, Czech Republic: Springer. <a href=\"https://doi.org/10.1007/978-3-642-36046-6_12\">https://doi.org/10.1007/978-3-642-36046-6_12</a>"},"oa_version":"Submitted Version","series_title":"Lecture Notes in Computer Science","publisher":"Springer","scopus_import":1,"oa":1,"conference":{"name":"MEMICS: Mathematical and Engineering Methods in Computer Science","start_date":"2012-10-25","location":"Znojmo, Czech Republic","end_date":"2012-10-28"},"publication_status":"published","publist_id":"3873","author":[{"full_name":"Chmelik, Martin","first_name":"Martin","id":"3624234E-F248-11E8-B48F-1D18A9856A87","last_name":"Chmelik"},{"first_name":"Vojtěch","full_name":"Řehák, Vojtěch","last_name":"Řehák"}],"language":[{"iso":"eng"}],"department":[{"_id":"KrCh"}],"page":"118 - 130","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2018-12-11T12:00:09Z","alternative_title":["LNCS"],"date_published":"2013-01-09T00:00:00Z","year":"2013"}