{"status":"public","project":[{"name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF","grant_number":"P 23499-N23","_id":"2584A770-B435-11E9-9278-68D0E5697425"},{"grant_number":"S11407","_id":"25863FF4-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Game Theory"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307","call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"page":"118 - 130","oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"KrCh"}],"month":"01","date_created":"2018-12-11T12:00:09Z","citation":{"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>.","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>","short":"M. Chmelik, V. Řehák, 7721 (2013) 118–130.","ieee":"M. Chmelik and V. Řehák, “Controllable-choice message sequence graphs,” vol. 7721. Springer, pp. 118–130, 2013.","ista":"Chmelik M, Řehák V. 2013. Controllable-choice message sequence graphs. 7721, 118–130.","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>.","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>"},"alternative_title":["LNCS"],"_id":"2886","doi":"10.1007/978-3-642-36046-6_12","author":[{"last_name":"Chmelik","id":"3624234E-F248-11E8-B48F-1D18A9856A87","full_name":"Chmelik, Martin","first_name":"Martin"},{"last_name":"Řehák","first_name":"Vojtěch","full_name":"Řehák, Vojtěch"}],"conference":{"name":"MEMICS: Mathematical and Engineering Methods in Computer Science","location":"Znojmo, Czech Republic","start_date":"2012-10-25","end_date":"2012-10-28"},"abstract":[{"lang":"eng","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."}],"publication_status":"published","type":"conference","date_updated":"2020-08-11T10:09:52Z","volume":7721,"day":"09","publisher":"Springer","year":"2013","ec_funded":1,"date_published":"2013-01-09T00:00:00Z","series_title":"Lecture Notes in Computer Science","quality_controlled":"1","scopus_import":1,"title":"Controllable-choice message sequence graphs","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1209.4499"}],"oa_version":"Submitted Version","publist_id":"3873","language":[{"iso":"eng"}],"intvolume":"      7721"}