{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,4]],"date-time":"2025-05-04T10:40:07Z","timestamp":1746355207253,"version":"3.40.4"},"reference-count":48,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2014,8,26]],"date-time":"2014-08-26T00:00:00Z","timestamp":1409011200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Distrib. Comput."],"published-print":{"date-parts":[[2015,6]]},"DOI":"10.1007\/s00446-014-0227-2","type":"journal-article","created":{"date-parts":[[2014,8,25]],"date-time":"2014-08-25T07:50:39Z","timestamp":1408953039000},"page":"201-219","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["The complexity of automated addition of fault-tolerance without explicit legitimate states"],"prefix":"10.1007","volume":"28","author":[{"given":"Fuad","family":"Abujarad","sequence":"first","affiliation":[]},{"given":"Yiyan","family":"Lin","sequence":"additional","affiliation":[]},{"given":"Borzoo","family":"Bonakdarpour","sequence":"additional","affiliation":[]},{"given":"Sandeep S.","family":"Kulkarni","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,8,26]]},"reference":[{"key":"227_CR1","unstructured":"Abujarad, F., Kulkarni, S.: Weakest invariant generation for automated addition of fault-tolerance. Electron. Notes Theor. Comput. Sci. 258(2), 3\u201315 (2009). Available as Technical Report MSU-CSE-09-29 http:\/\/www.cse.msu.edu\/cgi-user\/web\/tech\/reports?Year=2009"},{"key":"227_CR2","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. Inf. Process. Lett. 21, 181\u2013185 (1985)","journal-title":"Inf. Process. Lett."},{"issue":"5","key":"227_CR3","doi-asserted-by":"crossref","first-page":"672","DOI":"10.1145\/585265.585270","volume":"49","author":"R Alur","year":"2002","unstructured":"Alur, R., Henzinger, T.A., Kupferman, O.: Alternating-time temporal logic. J. ACM 49(5), 672\u2013713 (2002)","journal-title":"J. ACM"},{"issue":"11","key":"227_CR4","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 Trans. Softw. Eng. 19(11), 1015\u20131027 (1993)","journal-title":"IEEE Trans. Softw. Eng."},{"key":"227_CR5","doi-asserted-by":"crossref","unstructured":"Arora, A., Kulkarni, S.S.: Detectors and correctors: a theory of fault-tolerance components. In: International Conference on Distributed Computing Systems (ICDCS), pp. 436\u2013443 (1998)","DOI":"10.1109\/ICDCS.1998.679772"},{"key":"227_CR6","doi-asserted-by":"crossref","unstructured":"Arora, A., Kulkarni, S.S.: Detectors and correctors: a theory of fault-tolerance components. In: International Conference on Distributed Computing Systems (ICDCS), pp. 436\u2013443 (1998)","DOI":"10.1109\/ICDCS.1998.679772"},{"key":"227_CR7","unstructured":"Asarin, E., Maler, O., Pnueli, A., Sifakis, J.: Controller synthesis for timed automata. In: IFAC Symposium on System Structure and Control, pp. 469\u2013474 (1998)"},{"key":"227_CR8","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1109\/TDSC.2004.2","volume":"1","author":"A Avi\u017eienis","year":"2004","unstructured":"Avi\u017eienis, A., Laprie, J., Randell, B., Landwehr, C.: Basic concepts and taxonomy of dependable and secure computing. IEEE Trans. Dependable Secure Comput. 1, 11\u201333 (2004)","journal-title":"IEEE Trans. Dependable Secure Comput."},{"key":"227_CR9","doi-asserted-by":"crossref","unstructured":"Bang-Jensen, J., Gutin, G.: Digraphs: Theory, Algorithms and Applications, chapter 9, pp. 477\u2013478. Springer, London (2002)","DOI":"10.1007\/978-1-4471-3886-0"},{"issue":"1","key":"227_CR10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1462187.1462192","volume":"4","author":"B Bonakdarpour","year":"2009","unstructured":"Bonakdarpour, B., Ebnenasir, A., Kulkarni, S.S.: Complexity results in revising UNITY programs. ACM Trans. Auton. Adapt. Syst. (TAAS) 4(1), 1\u201328 (2009)","journal-title":"ACM Trans. Auton. Adapt. Syst. (TAAS)"},{"key":"227_CR11","doi-asserted-by":"crossref","unstructured":"Bonakdarpour, B., Kulkarni, S.S.: Incremental synthesis of fault-tolerant real-time programs. In: International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), LNCS, vol. 4280, pp. 122\u2013136 (2006)","DOI":"10.1007\/978-3-540-49823-0_9"},{"key":"227_CR12","doi-asserted-by":"crossref","unstructured":"Bonakdarpour, B., Kulkarni, S.S.: Exploiting symbolic techniques in automated synthesis of distributed programs with large state space. In: IEEE International Conference on Distributed Computing Systems (ICDCS), pp. 3\u201310 (2007)","DOI":"10.1109\/ICDCS.2007.109"},{"key":"227_CR13","doi-asserted-by":"crossref","unstructured":"Bonakdarpour, B., Kulkarni, S.S.: Masking faults while providing bounded time phased recovery. In: International Symposium on Formal Methods (FM) (2008)","DOI":"10.1007\/978-3-540-68237-0_26"},{"key":"227_CR14","doi-asserted-by":"crossref","unstructured":"Bonakdarpour, B., Kulkarni, S.S.: Revising distributed UNITY programs is NP-complete. In: Principles of Distributed Systems (OPODIS), pp. 408\u2013427 (2008)","DOI":"10.1007\/978-3-540-92221-6_26"},{"key":"227_CR15","doi-asserted-by":"crossref","unstructured":"Bonakdarpour, B., Kulkarni, S.S.: Sycraft: a tool for synthesizing distributed fault-tolerant programs. In: CONCUR \u201908: Proceedings of the 19th International Conference on Concurrency Theory, pp. 167\u2013171. Springer, Berlin, Heidelberg (2008)","DOI":"10.1007\/978-3-540-85361-9_16"},{"issue":"1","key":"227_CR16","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1007\/s00446-011-0139-3","volume":"25","author":"B Bonakdarpour","year":"2012","unstructured":"Bonakdarpour, B., Kulkarni, S.S., Abujarad, F.: Symbolic synthesis of masking fault-tolerant programs. J. Distrib. Comput. (DC) 25(1), 83\u2013108 (2012)","journal-title":"J. Distrib. Comput. (DC)"},{"key":"227_CR17","unstructured":"Bournai, P., Borgne, M.L., Guernic, P.L.: Synthesis of discrete-event controllers based on the signal environment. In: Discrete Event Dynamic System: Theory and Applications, pp. 325\u2013346 (2000)"},{"key":"227_CR18","doi-asserted-by":"crossref","unstructured":"Bouyer, P., Chevalier, F., D\u2019Souza, D.: Fault diagnosis using timed automata. In: Foundations of Software Science and Computation Structure, pp. 219\u2013233 (2005)","DOI":"10.1007\/978-3-540-31982-5_14"},{"key":"227_CR19","doi-asserted-by":"crossref","unstructured":"Bouyer, P., D\u2019Souza, D., Madhusudan, P., Petit, A.: Timed control with partial observability. In: Computer Aided Verification (CAV), pp. 180\u2013192 (2003)","DOI":"10.1007\/978-3-540-45069-6_18"},{"issue":"2","key":"227_CR20","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1016\/0890-5401(92)90017-A","volume":"98","author":"JR Burch","year":"1992","unstructured":"Burch, J.R., Clarke, E.M., McMillan, K.L., Dill, D.L., Hwang, L.J.: Symbolic model checking: 10 $$^{20}$$ 20 states and beyond. Inf. Comput. 98(2), 142\u2013170 (1992)","journal-title":"Inf. Comput."},{"issue":"2","key":"227_CR21","doi-asserted-by":"crossref","first-page":"348","DOI":"10.1109\/70.681255","volume":"14","author":"KH Cho","year":"1998","unstructured":"Cho, K.H., Lim, J.T.: Synthesis of fault-tolerant supervisor for automated manufacturing systems: a case study on photolithography process. IEEE Trans. Robot. Autom. 14(2), 348\u2013351 (1998)","journal-title":"IEEE Trans. Robot. Autom."},{"key":"227_CR22","doi-asserted-by":"crossref","unstructured":"D\u2019Souza, D., Madhusudan, P.: Timed control synthesis for external specifications. In: Symposium on Theoretical Aspects of Computer Science (STACS), pp. 571\u2013582 (2002)","DOI":"10.1007\/3-540-45841-7_47"},{"key":"227_CR23","doi-asserted-by":"crossref","unstructured":"Ebnenasir, A.: DiConic addition of failsafe fault-tolerance. In: Automated Software Engineering (ASE), pp. 44\u201353 (2007)","DOI":"10.1145\/1321631.1321641"},{"issue":"1","key":"227_CR24","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/311531.311532","volume":"31","author":"F Gartner","year":"1999","unstructured":"Gartner, F.: Fundamentals of fault-tolerant distributed computing in asynchronous environments. ACM Comput. Surv. (CSUR) 31(1), 1\u201326 (1999)","journal-title":"ACM Comput. Surv. (CSUR)"},{"key":"227_CR25","doi-asserted-by":"crossref","unstructured":"G\u00e4rtner, F.C., Jhumka, A.: Automating the addition of fail-safe fault-tolerance: beyond fusion-closed specifications. In: FORMATS\/FTRTFT, pp. 183\u2013198 (2004)","DOI":"10.1007\/978-3-540-30206-3_14"},{"issue":"2","key":"227_CR26","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1007\/s10703-009-0084-y","volume":"35","author":"A Girault","year":"2009","unstructured":"Girault, A., Rutten, \u00c9.: Automating the addition of fault tolerance with discrete controller synthesis. Form. Methods Syst. Des. (FMSD) 35(2), 190\u2013225 (2009)","journal-title":"Form. Methods Syst. Des. (FMSD)"},{"issue":"5","key":"227_CR27","doi-asserted-by":"crossref","first-page":"643","DOI":"10.1109\/3477.875441","volume":"30","author":"P Gohari","year":"2000","unstructured":"Gohari, P., Wonham, W.M.: On the complexity of supervisory control design in the RW framework. IEEE Trans. Syst. Man Cybern. 30(5), 643\u2013652 (2000)","journal-title":"IEEE Trans. Syst. Man Cybern."},{"issue":"2","key":"227_CR28","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1006\/inco.1994.1045","volume":"111","author":"TA Henzinger","year":"1994","unstructured":"Henzinger, T.A., Nicollin, X., Sifakis, J., Yovine, S.: Symbolic model checking for real-time systems. Inf. Comput. 111(2), 193\u2013244 (1994)","journal-title":"Inf. Comput."},{"key":"227_CR29","doi-asserted-by":"crossref","unstructured":"Jobstmann, B., Griesmayer, A., Bloem, R.: Program repair as a game. In: Computer Aided Verification (CAV), pp. 226\u2013238 (2005)","DOI":"10.1007\/11513988_23"},{"key":"227_CR30","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 (FTRTFT), pp. 82\u201393 (2000)","DOI":"10.1007\/3-540-45352-0_9"},{"key":"227_CR31","doi-asserted-by":"crossref","unstructured":"Kulkarni, S.S., Ebnenasir, A.: Automated synthesis of multitolerance. In: International Conference on Dependable Systems and Networks (DSN), pp. 209\u2013219 (2004)","DOI":"10.1109\/DSN.2004.1311891"},{"issue":"2","key":"227_CR32","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1137\/S0363012992235183","volume":"33","author":"R Kumar","year":"1995","unstructured":"Kumar, R., Garg, V.K.: Optimal supervisory control of discrete event dynamicalsystems. SIAM J. Control Optim. 33(2), 419\u2013439 (1995)","journal-title":"SIAM J. Control Optim."},{"issue":"12","key":"227_CR33","doi-asserted-by":"crossref","first-page":"1330","DOI":"10.1109\/9.61009","volume":"35","author":"F Lin","year":"1990","unstructured":"Lin, F., Wonham, W.M.: Decentralized control and coordination of discrete-event systems with partial observation. IEEE Trans. Autom. Control 35(12), 1330\u20131337 (1990)","journal-title":"IEEE Trans. Autom. Control"},{"key":"227_CR34","doi-asserted-by":"crossref","unstructured":"Liu, X., Smolka, S.A.: Simple linear-time algorithms for minimal fixed points (extended abstract). In: Proceedings of the 25th International Colloquium on Automata, Languages and Programming (ICALP), pp. 53\u201366 (1998)","DOI":"10.1007\/BFb0055040"},{"key":"227_CR35","doi-asserted-by":"crossref","unstructured":"Maler, O., Pnueli, A., Sifakis, J.: On the synthesis of discrete controllers for timed systems. In: 12th Annual Symposium on Theoretical Aspects of Computer Science (STACS), pp. 229\u2013242 (1995)","DOI":"10.1007\/3-540-59042-0_76"},{"key":"227_CR36","unstructured":"Mantel, H., C.G\u00e4rtner, F.: A case study in the mechanical verification of fault-tolerance. Technical Report TUD-BS-1999-08, Department of Computer Science, University of Technology, Darmstadt (1999)"},{"key":"227_CR37","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-3190-6","volume-title":"Symbolic Model Checking","author":"KL McMillan","year":"1993","unstructured":"McMillan, K.L.: Symbolic Model Checking. Kluwer Academic Publishers, Berlin (1993)"},{"key":"227_CR38","doi-asserted-by":"crossref","unstructured":"Pnueli, A., Rosner, R.: On the synthesis of a reactive module. In: Principles of Programming Languages (POPL), pp. 179\u2013190 (1989)","DOI":"10.1145\/75277.75293"},{"key":"227_CR39","doi-asserted-by":"crossref","unstructured":"Pnueli, A., Rosner, R.: On the synthesis of an asynchronous reactive module. In: International Colloqium on Automata, Languages, and Programming, Lecture Notes in Computer Science, vol. 372, pp. 652\u2013671. Springer, Berlin (1989)","DOI":"10.1007\/BFb0035790"},{"issue":"1","key":"227_CR40","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1109\/5.21072","volume":"77","author":"PJ Ramadge","year":"1989","unstructured":"Ramadge, P.J., Wonham, W.M.: The control of discrete event systems. Proc. IEEE 77(1), 81\u201398 (1989)","journal-title":"Proc. IEEE"},{"key":"227_CR41","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1145\/58564.59295","volume":"7","author":"K Raymond","year":"1989","unstructured":"Raymond, K.: A tree based algorithm for mutual exclusion. ACM Trans. Comput. Syst. 7, 61\u201377 (1989)","journal-title":"ACM Trans. Comput. Syst."},{"issue":"11","key":"227_CR42","doi-asserted-by":"crossref","first-page":"1692","DOI":"10.1109\/9.173140","volume":"37","author":"K Rudie","year":"1992","unstructured":"Rudie, K., Wonham, W.M.: Think globally, act locally: decentralized supervisory control. IEEE Trans. Autom. Control 37(11), 1692\u20131708 (1992)","journal-title":"IEEE Trans. Autom. Control"},{"key":"227_CR43","unstructured":"Somenzi, F.: CUDD: Colorado university decision diagram package. http:\/\/vlsi.colorado.edu\/~fabio\/CUDD\/cuddIntro.html"},{"key":"227_CR44","doi-asserted-by":"crossref","unstructured":"Thomas, W.: Handbook of Theoretical Computer Science: Chapter 4, Automata on Infinite Objects. Elsevier Science Publishers B. V., Amsterdam (1990)","DOI":"10.1016\/B978-0-444-88074-1.50009-3"},{"key":"227_CR45","doi-asserted-by":"crossref","unstructured":"Thomas, W.: On the synthesis of strategies in infinite games. In: Theoretical Aspects of Computer Science (STACS), pp. 1\u201313 (1995)","DOI":"10.1007\/3-540-59042-0_57"},{"key":"227_CR46","doi-asserted-by":"crossref","unstructured":"Tripakis, S.: Fault diagnosis for timed automata. In: Formal Techniques in Real-Time and Fault-Tolerant Systems (FTRTFT), pp. 205\u2013224 (2002)","DOI":"10.1007\/3-540-45739-9_14"},{"key":"227_CR47","doi-asserted-by":"crossref","unstructured":"Tripakis, S., Altisen, K.: On-the-fly controller synthesis for discrete and dense time systems. In: Formal Methods 1999 (FM), pp. 233\u2013252 (1999)","DOI":"10.1007\/3-540-48119-2_15"},{"key":"227_CR48","doi-asserted-by":"crossref","unstructured":"Wallmeier, N., H\u00fctten, P., Thomas, W.: Symbolic synthesis of finite-state controllers for request-response specifications. In: Implementation and Application of Automata (CIAA), pp. 11\u201322 (2003)","DOI":"10.1007\/3-540-45089-0_3"}],"container-title":["Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-014-0227-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00446-014-0227-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-014-0227-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,4]],"date-time":"2025-05-04T09:58:07Z","timestamp":1746352687000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00446-014-0227-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,8,26]]},"references-count":48,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2015,6]]}},"alternative-id":["227"],"URL":"https:\/\/doi.org\/10.1007\/s00446-014-0227-2","relation":{},"ISSN":["0178-2770","1432-0452"],"issn-type":[{"type":"print","value":"0178-2770"},{"type":"electronic","value":"1432-0452"}],"subject":[],"published":{"date-parts":[[2014,8,26]]}}}