{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,12]],"date-time":"2025-03-12T11:10:02Z","timestamp":1741777802153,"version":"3.38.0"},"reference-count":56,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2011,10,4]],"date-time":"2011-10-04T00:00:00Z","timestamp":1317686400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Distrib. Comput."],"published-print":{"date-parts":[[2012,3]]},"DOI":"10.1007\/s00446-011-0139-3","type":"journal-article","created":{"date-parts":[[2011,10,3]],"date-time":"2011-10-03T07:01:34Z","timestamp":1317625294000},"page":"83-108","source":"Crossref","is-referenced-by-count":20,"title":["Symbolic synthesis of masking fault-tolerant distributed programs"],"prefix":"10.1007","volume":"25","author":[{"given":"Borzoo","family":"Bonakdarpour","sequence":"first","affiliation":[]},{"given":"Sandeep S.","family":"Kulkarni","sequence":"additional","affiliation":[]},{"given":"Fuad","family":"Abujarad","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,10,4]]},"reference":[{"key":"139_CR1","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":"11","key":"139_CR2","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."},{"issue":"1","key":"139_CR3","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1109\/32.663998","volume":"24","author":"A. Arora","year":"1998","unstructured":"Arora A., Kulkarni S.S.: Component based design of multitolerant systems. IEEE Trans. Softw. Eng. 24(1), 63\u201378 (1998)","journal-title":"IEEE Trans. Softw. Eng."},{"key":"139_CR4","doi-asserted-by":"crossref","unstructured":"Asarin, E., Maler, O.: As soon as possible: time optimal control for timed automata. In: Hybrid Systems: Computation and Control (HSCC), pp. 19\u201330 (1999)","DOI":"10.1007\/3-540-48983-5_6"},{"key":"139_CR5","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)"},{"issue":"1","key":"139_CR6","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1145\/271510.271519","volume":"20","author":"P. Attie","year":"1998","unstructured":"Attie P., Emerson E.A.: Synthesis of concurrent systems with many similar processes. ACM Trans. Program. Lang. Syst. (TOPLAS) 20(1), 51\u2013115 (1998)","journal-title":"ACM Trans. Program. Lang. Syst. (TOPLAS)"},{"key":"139_CR7","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 4280, pp. 122\u2013136 (2006)","DOI":"10.1007\/978-3-540-49823-0_9"},{"key":"139_CR8","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.21236\/ADA460390"},{"key":"139_CR9","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), pp. 374\u2013389 (2008a)","DOI":"10.1007\/978-3-540-68237-0_26"},{"key":"139_CR10","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 (2008b)","DOI":"10.1007\/978-3-540-92221-6_26"},{"key":"139_CR11","doi-asserted-by":"crossref","unstructured":"Bonakdarpour B., Kulkarni S.S.: SYCRAFT: a tool for synthesizing fault-tolerant distributed programs. In: van Breugel, F., Chechik, M. (eds) Concurrency Theory (CONCUR), pp. 167\u2013171. Spinger, Heidelberg (2008)","DOI":"10.1007\/978-3-540-85361-9_16"},{"key":"139_CR12","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":"139_CR13","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"},{"key":"139_CR14","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"},{"issue":"8","key":"139_CR15","doi-asserted-by":"crossref","first-page":"677","DOI":"10.1109\/TC.1986.1676819","volume":"35","author":"R.E. Bryant","year":"1986","unstructured":"Bryant R.E.: Graph-based algorithms for Boolean function manipulation. IEEE Trans. Comput. 35(8), 677\u2013691 (1986)","journal-title":"IEEE Trans. Comput."},{"key":"139_CR16","unstructured":"Burch, J., Clarke, E., Long, D.: Symbolic model checking with partitioned transition relations. In: International Conference on Very Large Scale Integration, pp. 49\u201358 (1991)"},{"issue":"2","key":"139_CR17","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1016\/0890-5401(92)90017-A","volume":"98","author":"J.R. Burch","year":"1992","unstructured":"Burch J.R., Clarke E.M., McMillan K.L., Dill D.L., Hwang L.J.: Symbolic model checking: 1020 states and beyond. Inf. Comput. 98(2), 142\u2013170 (1992)","journal-title":"Inf. Comput."},{"key":"139_CR18","doi-asserted-by":"crossref","unstructured":"Cassez, F., David, A., Fleury, E., Larsen, K., Lime, D.: Efficient on-the-fly algorithms for the analysis of timed games. In: Concurrency Theory (CONCUR), pp. 66\u201380 (2005)","DOI":"10.1007\/11539452_9"},{"issue":"2","key":"139_CR19","doi-asserted-by":"crossref","first-page":"348","DOI":"10.1109\/70.681255","volume":"14","author":"K.H. 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":"139_CR20","doi-asserted-by":"crossref","unstructured":"Ciardo, G., Yu, A.J.: Saturation-based symbolic reachability analysis using conjunctive and disjunctive partitioning. In: Correct Hardware Design and Verification Methods (CHARME), pp. 146\u2013161 (2005)","DOI":"10.1007\/11560548_13"},{"key":"139_CR21","doi-asserted-by":"crossref","unstructured":"Ciardo, G., L\u00fcttgen, G., Siminiceanu, R.: Saturation: an efficient iteration strategy for symbolic state-space generation. In: Tools and Algorithms for the Construction and Analysis of Systems (TACAS), pp. 328\u2013342 (2001)","DOI":"10.1007\/3-540-45319-9_23"},{"issue":"4","key":"139_CR22","doi-asserted-by":"crossref","first-page":"410","DOI":"10.1007\/s100090050046","volume":"2","author":"A. Cimatti","year":"2000","unstructured":"Cimatti A., Clarke E.M., Giunchiglia F., Roveri M.: NUSMV: a new symbolic model checker. Softw. Tools Tech. Transf. (STTT) 2(4), 410\u2013425 (2000)","journal-title":"Softw. Tools Tech. Transf. (STTT)"},{"key":"139_CR23","doi-asserted-by":"crossref","unstructured":"Clarke, E.M., Filkorn, T., Jha, S.: Exploiting symmetry in temporal logic model checking. In: Computer Aided Verification (CAV), pp. 450\u2013462 (1993)","DOI":"10.1007\/3-540-56922-7_37"},{"key":"139_CR24","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":"139_CR25","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":"5","key":"139_CR26","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1007\/s10009-008-0083-0","volume":"10","author":"A. Ebnenasir","year":"2008","unstructured":"Ebnenasir A., Kulkarni S.S., Arora A.: FTSyn: a framework for automatic synthesis of fault-tolerance. Int. J. Soft. Tools Tech. Transf. (STTT) 10(5), 455\u2013471 (2008)","journal-title":"Int. J. Soft. Tools Tech. Transf. (STTT)"},{"key":"139_CR27","unstructured":"Emerson, E.A., Lei, C.L.: Efficient model checking in fragments of the propositional model mu-calculus. In: Logic in Computer Science (LICS), pp. 267\u2013278 (1986)"},{"issue":"1\/2","key":"139_CR28","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1007\/BF00625970","volume":"9","author":"E.A. Emerson","year":"1996","unstructured":"Emerson E.A., Sistla A.P.: Symmetry and model checking. Formal Methods Syst. Des. Int. J. 9(1\/2), 105\u2013131 (1996)","journal-title":"Formal Methods Syst. Des. Int. J."},{"key":"139_CR29","doi-asserted-by":"crossref","unstructured":"Fisler, K., Fraer, R., Kamhi, G., Vardi, M.Y., Yang, Z.: Is there a best symbolic cycle-detection algorithm? In: In Tools and Algorithms for the Construction and Analysis of Systems (TACAS), pp. 420\u2013434 (2001)","DOI":"10.1007\/3-540-45319-9_29"},{"issue":"2","key":"139_CR30","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. Formal Methods Syst. Des. (FMSD) 35(2), 190\u2013225 (2009)","journal-title":"Formal Methods Syst. Des. (FMSD)"},{"issue":"5","key":"139_CR31","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":"139_CR32","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1006\/inco.1994.1045","volume":"111","author":"T.A. 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":"139_CR33","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"},{"issue":"1","key":"139_CR34","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1080\/15501320500330760","volume":"2","author":"S.S. Kulkarni","year":"2006","unstructured":"Kulkarni S.S., Arumugam M.: Infuse: a TDMA based data dissemination protocol for sensor networks. Int. J. Distrib. Sens. Netw. (IJDSN) 2(1), 55\u201378 (2006)","journal-title":"Int. J. Distrib. Sens. Netw. (IJDSN)"},{"key":"139_CR35","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"},{"key":"139_CR36","doi-asserted-by":"crossref","unstructured":"Kulkarni, S.S., Ebnenasir, A.: Adding fault-tolerance using pre-synthesized components. In: European Dependable Computing Conference (EDCC), pp. 72\u201390 (2005)","DOI":"10.1007\/11408901_6"},{"key":"139_CR37","doi-asserted-by":"crossref","unstructured":"Kulkarni, S.S., Arora, A., Chippada, A.: Polynomial time synthesis of Byzantine agreement. In: Symposium on Reliable Distributed Systems (SRDS), pp. 130\u2013140 (2001)","DOI":"10.1109\/RELDIS.2001.969767"},{"issue":"2","key":"139_CR38","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":"3","key":"139_CR39","doi-asserted-by":"crossref","first-page":"382","DOI":"10.1145\/357172.357176","volume":"4","author":"L. Lamport","year":"1982","unstructured":"Lamport L., Shostak R., Pease M.: The Byzantine generals problem. ACM Trans. Program. Lang. Syst. (TOPLAS) 4(3), 382\u2013401 (1982)","journal-title":"ACM Trans. Program. Lang. Syst. (TOPLAS)"},{"key":"139_CR40","unstructured":"Lee, E.A.: Cyber-physical systems\u2014are computing foundations adequate? In: Position Paper for NSF Workshop On Cyber-Physical Systems: Research Motivation, Techniques and Roadmap (2006)"},{"issue":"12","key":"139_CR41","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":"139_CR42","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":"139_CR43","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-3190-6","volume-title":"Symbolic Model Checking","author":"K.L. McMillan","year":"1993","unstructured":"McMillan K.L.: Symbolic Model Checking. Kluwer, Dordrecht (1993)"},{"key":"139_CR44","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 (1989a)","DOI":"10.1145\/75277.75293"},{"key":"139_CR45","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 (ICALP), pp. 652\u2013671 (1989b)","DOI":"10.1007\/BFb0035790"},{"issue":"1","key":"139_CR46","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1109\/5.21072","volume":"77","author":"P.J. 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":"139_CR47","unstructured":"Ranjan, R., Aziz, A., Brayton, R., Plessier, B., Pixley, C.: Efficient BDD algorithms for FSM synthesis and verification. In: IEEE\/ACM International Workshop on Logic Synthesis (1995)"},{"issue":"11","key":"139_CR48","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"},{"issue":"3","key":"139_CR49","doi-asserted-by":"crossref","first-page":"222","DOI":"10.1145\/357369.357371","volume":"1","author":"R.D. Schlichting","year":"1983","unstructured":"Schlichting R.D., Schneider F.B.: Fail-stop processors: an approach to designing fault-tolerant computing systems. ACM Trans. Comput. 1(3), 222\u2013238 (1983)","journal-title":"ACM Trans. Comput."},{"issue":"11","key":"139_CR50","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1109\/MC.2005.386","volume":"38","author":"J.A. Stankovic","year":"2005","unstructured":"Stankovic J.A., Lee I., Mok A.K., Rajkumar R.: Opportunities and obligations for physical computing systems. IEEE Comput. 38(11), 23\u201331 (2005)","journal-title":"IEEE Comput."},{"key":"139_CR51","doi-asserted-by":"crossref","unstructured":"Thomas, W.: chap 4: Automata on infinite objects. In: Handbook of Theoretical Computer Science, vol. B, pp. 133\u2013192. Elsevier Science Publishers B. V., Amsterdam (1990)","DOI":"10.1016\/B978-0-444-88074-1.50009-3"},{"key":"139_CR52","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":"139_CR53","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"},{"issue":"1","key":"139_CR54","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/j.ipl.2004.01.004","volume":"90","author":"S. Tripakis","year":"2004","unstructured":"Tripakis S.: Undecidable problems of decentralized observation and control on regular languages. Inf. Process. Lett. 90(1), 21\u201328 (2004)","journal-title":"Inf. Process. Lett."},{"key":"139_CR55","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":"139_CR56","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-011-0139-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00446-011-0139-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-011-0139-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,12]],"date-time":"2025-03-12T10:30:13Z","timestamp":1741775413000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00446-011-0139-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,10,4]]},"references-count":56,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2012,3]]}},"alternative-id":["139"],"URL":"https:\/\/doi.org\/10.1007\/s00446-011-0139-3","relation":{},"ISSN":["0178-2770","1432-0452"],"issn-type":[{"type":"print","value":"0178-2770"},{"type":"electronic","value":"1432-0452"}],"subject":[],"published":{"date-parts":[[2011,10,4]]}}}