{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T16:47:41Z","timestamp":1725727661826},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642385919"},{"type":"electronic","value":"9783642385926"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38592-6_12","type":"book-chapter","created":{"date-parts":[[2013,5,29]],"date-time":"2013-05-29T04:56:11Z","timestamp":1369803371000},"page":"161-177","source":"Crossref","is-referenced-by-count":10,"title":["An Abstract Framework for Deadlock Prevention in BIP"],"prefix":"10.1007","author":[{"given":"Paul C.","family":"Attie","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Saddek","family":"Bensalem","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marius","family":"Bozga","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohamad","family":"Jaber","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joseph","family":"Sifakis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fadi A.","family":"Zaraket","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"12_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"658","DOI":"10.1007\/978-3-540-45236-2_36","volume-title":"FME 2003: Formal Methods","author":"A. Aldini","year":"2003","unstructured":"Aldini, A., Bernardo, M.: A General Approach to Deadlock Freedom Verification for Software Architectures. In: Araki, K., Gnesi, S., Mandrioli, D. (eds.) FME 2003. LNCS, vol.\u00a02805, pp. 658\u2013677. Springer, Heidelberg (2003)"},{"key":"12_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1007\/3-540-48320-9_11","volume-title":"CONCUR\u201999. Concurrency Theory","author":"P.C. Attie","year":"1999","unstructured":"Attie, P.C.: Synthesis of large concurrent programs via pairwise composition. In: Baeten, J.C.M., Mauw, S. (eds.) CONCUR 1999. LNCS, vol.\u00a01664, pp. 130\u2013145. Springer, Heidelberg (1999)"},{"key":"12_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1007\/978-3-540-30579-8_30","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"P.C. Attie","year":"2005","unstructured":"Attie, P.C., Chockler, H.: Efficiently verifiable conditions for deadlock-freedom of large concurrent programs. In: Cousot, R. (ed.) VMCAI 2005. LNCS, vol.\u00a03385, pp. 465\u2013481. Springer, Heidelberg (2005)"},{"issue":"1","key":"12_CR4","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1145\/271510.271519","volume":"20","author":"P.C. Attie","year":"1998","unstructured":"Attie, P.C., Allen Emerson, E.: Synthesis of Concurrent Systems with Many Similar Processes. TOPLAS\u00a020(1), 51\u2013115 (1998)","journal-title":"TOPLAS"},{"key":"12_CR5","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/BF02242712","volume":"6","author":"P.C. Attie","year":"1993","unstructured":"Attie, P.C., Francez, N., Grumberg, O.: Fairness and Hyperfairness in Multiparty Interactions. Distributed Computing\u00a06, 245\u2013254 (1993)","journal-title":"Distributed Computing"},{"key":"12_CR6","unstructured":"Basu, A., Bozga, M., Sifakis, J.: Modeling Heterogeneous Real-time Components in BIP. In: SEFM, pp. 3\u201312 (September 2006)"},{"issue":"3","key":"12_CR7","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1049\/iet-sen.2009.0011","volume":"4","author":"S. Bensalem","year":"2010","unstructured":"Bensalem, S., Bozga, M., Nguyen, T.H., Sifakis, J.: Compositional verification for component-based systems and application. IET Software\u00a04(3), 181\u2013193 (2010)","journal-title":"IET Software"},{"key":"12_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1007\/978-3-642-20398-5_32","volume-title":"NASA Formal Methods","author":"S. Bensalem","year":"2011","unstructured":"Bensalem, S., Griesmayer, A., Legay, A., Nguyen, T.-H., Sifakis, J., Yan, R.: D-finder 2: Towards efficient correctness of incremental design. In: Bobaru, M., Havelund, K., Holzmann, G.J., Joshi, R. (eds.) NFM 2011. LNCS, vol.\u00a06617, pp. 453\u2013458. Springer, Heidelberg (2011)"},{"key":"12_CR9","doi-asserted-by":"crossref","unstructured":"Bonakdarpour, B., Bozga, M., Jaber, M., Quilbeuf, J., Sifakis, J.: From High-level Component-based Models to Distributed Implementations. In: EMSOFT, pp. 209\u2013218 (2010)","DOI":"10.1145\/1879021.1879049"},{"key":"12_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-30564-1_1","volume-title":"Software Composition","author":"M. Bozga","year":"2012","unstructured":"Bozga, M., Jaber, M., Maris, N., Sifakis, J.: Modeling Dynamic Architectures Using Dy-BIP. In: Gschwind, T., De Paoli, F., Gruhn, V., Book, M. (eds.) SC 2012. LNCS, vol.\u00a07306, pp. 1\u201316. Springer, Heidelberg (2012)"},{"key":"12_CR11","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/BF01784721","volume":"4","author":"S.D. Brookes","year":"1991","unstructured":"Brookes, S.D., Roscoe, A.W.: Deadlock analysis in networks of communicating processes. Distributed Computing\u00a04, 209\u2013230 (1991)","journal-title":"Distributed Computing"},{"key":"12_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"420","DOI":"10.1007\/978-3-540-24597-1_36","volume-title":"FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science","author":"G. G\u00f6\u00dfler","year":"2003","unstructured":"G\u00f6\u00dfler, G., Sifakis, J.: Component-based construction of deadlock-free systems. In: Pandya, P.K., Radhakrishnan, J. (eds.) FSTTCS 2003. LNCS, vol.\u00a02914, pp. 420\u2013433. Springer, Heidelberg (2003)"},{"issue":"2","key":"12_CR13","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1109\/MS.1985.230351","volume":"2","author":"D. Heimbold","year":"1985","unstructured":"Heimbold, D., Luckham, D.: Debugging Ada tasking programs. IEEE Software\u00a02(2), 47\u201357 (1985)","journal-title":"IEEE Software"},{"key":"12_CR14","first-page":"129","volume":"41","author":"M. Martens","year":"2012","unstructured":"Martens, M., Majster-Cederbaum, M.: Deadlock-freedom in component systems with architectural constraints. FMSD\u00a041, 129\u2013177 (2012)","journal-title":"FMSD"},{"key":"12_CR15","unstructured":"Papadimitriou, C.H.: Computational complexity. Addison-Wesley (1994)"}],"container-title":["Lecture Notes in Computer Science","Formal Techniques for Distributed Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38592-6_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,13]],"date-time":"2019-05-13T11:48:26Z","timestamp":1557748106000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38592-6_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642385919","9783642385926"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38592-6_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}