{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T22:06:51Z","timestamp":1725746811882},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642402128"},{"type":"electronic","value":"9783642402135"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40213-5_2","type":"book-chapter","created":{"date-parts":[[2013,8,29]],"date-time":"2013-08-29T09:26:23Z","timestamp":1377768383000},"page":"17-33","source":"Crossref","is-referenced-by-count":6,"title":["On the Complexity of Adding Convergence"],"prefix":"10.1007","author":[{"given":"Alex","family":"Klinkhamer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ali","family":"Ebnenasir","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,8,30]]},"reference":[{"issue":"11","key":"2_CR1","doi-asserted-by":"crossref","first-page":"643","DOI":"10.1145\/361179.361202","volume":"17","author":"E.W. Dijkstra","year":"1974","unstructured":"Dijkstra, E.W.: Self-stabilizing systems in spite of distributed control. Communications of the ACM 17(11), 643\u2013644 (1974)","journal-title":"Communications of the ACM"},{"key":"2_CR2","unstructured":"Arora, A.: A foundation of fault-tolerant computing. PhD thesis, The University of Texas at Austin (1992)"},{"issue":"11","key":"2_CR3","doi-asserted-by":"crossref","first-page":"1015","DOI":"10.1109\/32.256850","volume":"19","author":"A. Arora","year":"1993","unstructured":"Arora, A., Gouda, M.G.: Closure and convergence: A foundation of fault-tolerant computing. IEEE Transactions on Software Engineering 19(11), 1015\u20131027 (1993)","journal-title":"IEEE Transactions on Software Engineering"},{"issue":"5","key":"2_CR4","doi-asserted-by":"crossref","first-page":"442","DOI":"10.1007\/BF01211393","volume":"4","author":"Z. Liu","year":"1992","unstructured":"Liu, Z., Joseph, M.: Transformation of programs for fault-tolerance. Formal Aspects of Computing 4(5), 442\u2013469 (1992)","journal-title":"Formal Aspects of Computing"},{"issue":"3","key":"2_CR5","doi-asserted-by":"crossref","first-page":"293","DOI":"10.3233\/JHS-1996-5305","volume":"5","author":"A. Arora","year":"1996","unstructured":"Arora, A., Gouda, M., Varghese, G.: Constraint satisfaction as a basis for designing nonmasking fault-tolerant systems. Journal of High Speed Networks 5(3), 293\u2013306 (1996)","journal-title":"Journal of High Speed Networks"},{"key":"2_CR6","doi-asserted-by":"crossref","unstructured":"Kulkarni, S.S., Arora, A.: Automating the addition of fault-tolerance. In: Formal Techniques in Real-Time and Fault-Tolerant Systems, pp. 82\u201393. Springer, London (2000)","DOI":"10.1007\/3-540-45352-0_9"},{"key":"2_CR7","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/0020-0190(85)90056-0","volume":"21","author":"B. Alpern","year":"1985","unstructured":"Alpern, B., Schneider, F.B.: Defining liveness. Information Processing Letters 21, 181\u2013185 (1985)","journal-title":"Information Processing Letters"},{"issue":"3","key":"2_CR8","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1109\/TDSC.2005.29","volume":"2","author":"S.S. Kulkarni","year":"2005","unstructured":"Kulkarni, S.S., Ebnenasir, A.: Complexity issues in automated synthesis of failsafe fault-tolerance. IEEE Transactions on Dependable and Secure Computing (TDSC) 2(3), 201\u2013215 (2005)","journal-title":"IEEE Transactions on Dependable and Secure Computing (TDSC)"},{"key":"2_CR9","unstructured":"Gary, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman (1979)"},{"issue":"3","key":"2_CR10","first-page":"201","volume":"7","author":"M. Davis","year":"1960","unstructured":"Davis, M., Putnam, H.: A computing procedure for quantification theory. Communications of the ACM 7(3), 201\u2013215 (1960)","journal-title":"Communications of the ACM"},{"key":"2_CR11","doi-asserted-by":"crossref","unstructured":"Ebnenasir, A., Kulkarni, S.S.: SAT-based synthesis of fault-tolerance. In: Fast Abstracts of the International Conference on Dependable Systems and Networks (2004)","DOI":"10.1109\/DSN.2004.1311891"},{"key":"2_CR12","doi-asserted-by":"crossref","unstructured":"Gouda, M.: The triumph and tribulation of system stabilization. In: Helary, J.-M., Raynal, M. (eds.) WDAG 1995. LNCS, vol. 972, pp. 1\u201318. Springer, Heidelberg (1995)","DOI":"10.1007\/BFb0022135"},{"key":"2_CR13","doi-asserted-by":"crossref","unstructured":"Gouda, M.G.: The theory of weak stabilization. In: Datta, A.K., Herman, T. (eds.) WSS 2001. LNCS, vol. 2194, pp. 114\u2013123. Springer, Heidelberg (2001)","DOI":"10.1007\/3-540-45438-1_8"},{"key":"2_CR14","doi-asserted-by":"crossref","unstructured":"Lamport, L., Lynch, N. : Handbook of Theoretical Computer Science: Chapter 18, Distributed Computing: Models and Methods. Elsevier Science Publishers B. V. (1990)","DOI":"10.1016\/B978-0-444-88074-1.50023-8"},{"issue":"5","key":"2_CR15","doi-asserted-by":"crossref","first-page":"766","DOI":"10.1006\/jpdc.2001.1828","volume":"62","author":"M. Nesterenko","year":"2002","unstructured":"Nesterenko, M., Arora, A.: Stabilization-preserving atomicity refinement. Journal of Parallel and Distributed Computing 62(5), 766\u2013791 (2002)","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"2_CR16","unstructured":"Demirbas, M., Arora, A.: Convergence refinement. In: Proceedings of the 22nd International Conference on Distributed Computing Systems, pp. 589\u2013597. IEEE Computer Society, Washington, DC (2002)"},{"key":"2_CR17","unstructured":"Dijkstra, E.W.: A Discipline of Programming. Prentice-Hall (1990)"},{"issue":"6","key":"2_CR18","doi-asserted-by":"crossref","first-page":"435","DOI":"10.1109\/32.689401","volume":"24","author":"A. Arora","year":"1998","unstructured":"Arora, A., Kulkarni, S.S.: Designing masking fault-tolerance via nonmasking fault-tolerance. IEEE Transactions on Software Engineering 24(6), 435\u2013450 (1998)","journal-title":"IEEE Transactions on Software Engineering"},{"key":"2_CR19","unstructured":"Varghese, G.: Self-stabilization by local checking and correction. PhD thesis, MIT\/LCS\/TR-583 (1993)"},{"key":"2_CR20","unstructured":"Ebnenasir, A.: Automatic Synthesis of Fault-Tolerance. PhD thesis, Michigan State University (May 2005)"},{"key":"2_CR21","unstructured":"Jhumka, A.: Automated design of efficient fail-safe fault tolerance. PhD thesis, Darmstadt University of Technology (2004)"},{"issue":"1\/2","key":"2_CR22","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1504\/IJSN.2006.010824","volume":"1","author":"A. Jhumka","year":"2006","unstructured":"Jhumka, A., Freiling, F.C., Fetzer, C., Suri, N.: An approach to synthesise safe systems. International Journal of Security and Networks 1(1\/2), 62\u201374 (2006)","journal-title":"International Journal of Security and Networks"},{"key":"2_CR23","doi-asserted-by":"crossref","unstructured":"Bonakdarpour, B., Kulkarni, S.S.: Exploiting symbolic techniques in automated synthesis of distributed programs with large state space. In: Proceedings of the 27th International Conference on Distributed Computing Systems, pp. 3\u201310. IEEE Computer Society, Washington, DC (2007)","DOI":"10.1109\/ICDCS.2007.109"},{"issue":"33","key":"2_CR24","doi-asserted-by":"crossref","first-page":"4228","DOI":"10.1016\/j.tcs.2011.02.008","volume":"412","author":"F. Abujarad","year":"2011","unstructured":"Abujarad, F., Kulkarni, S.S.: Automated constraint-based addition of nonmasking and stabilizing fault-tolerance. Theoretical Computer Science 412(33), 4228\u20134246 (2011)","journal-title":"Theoretical Computer Science"},{"issue":"4","key":"2_CR25","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/2382570.2382574","volume":"7","author":"A. Farahat","year":"2012","unstructured":"Farahat, A., Ebnenasir, A.: A lightweight method for automated design of convergence in network protocols. ACM Transactions on Autonomous and Adaptive Systems (TAAS) 7(4), 38:1\u201338:36 (2012)","journal-title":"ACM Transactions on Autonomous and Adaptive Systems (TAAS)"},{"key":"2_CR26","doi-asserted-by":"crossref","unstructured":"Ebnenasir, A., Farahat, A.: Swarm synthesis of convergence for symmetric protocols. In: Proceedings of the Ninth European Dependable Computing Conference, pp. 13\u201324 (2012)","DOI":"10.1109\/EDCC.2012.22"},{"key":"2_CR27","doi-asserted-by":"crossref","unstructured":"Bonakdarpour, B., Kulkarni, S.S.: Revising distributed UNITY programs is NP-complete. In: Baker, T.P., Bui, A., Tixeuil, S. (eds.) OPODIS 2008. LNCS, vol. 5401, pp. 408\u2013427. Springer, Heidelberg (2008)","DOI":"10.1007\/978-3-540-92221-6_26"}],"container-title":["Lecture Notes in Computer Science","Fundamentals of Software Engineering"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40213-5_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,2]],"date-time":"2020-08-02T19:51:52Z","timestamp":1596397912000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40213-5_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642402128","9783642402135"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40213-5_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}