{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T10:19:55Z","timestamp":1742984395264,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642160226"},{"type":"electronic","value":"9783642160233"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-16023-3_18","type":"book-chapter","created":{"date-parts":[[2010,9,19]],"date-time":"2010-09-19T20:41:49Z","timestamp":1284928909000},"page":"206-220","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Complexity Issues in Automated Model Revision without Explicit Legitimate State"],"prefix":"10.1007","author":[{"given":"Fuad","family":"Abujarad","sequence":"first","affiliation":[]},{"given":"Sandeep S.","family":"Kulkarni","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,9,20]]},"reference":[{"key":"18_CR1","unstructured":"Abujarad, F., Kulkarni, S.S.: Complexity issues in automated model revision without explicit legitimate state. Technical Report MSU-CSE-10-19, Computer Science and Engineering, Michigan State University, East Lansing, Michigan (July 2010), Available as Technical Report MSU-CSE-10-19 at, http:\/\/www.cse.msu.edu\/cgi-user\/web\/tech\/reports?Year=2010"},{"issue":"2","key":"18_CR2","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.entcs.2009.12.010","volume":"258","author":"F. Abujarad","year":"2009","unstructured":"Abujarad, F., Kulkarni, S.S.: Weakest Invariant Generation for Automated Addition of Fault-Tolerance. Electronic Notes in Theoretical Computer Science\u00a0258(2), 3\u201315 (2009), Available as Technical Report MSU-CSE-09-29 at, http:\/\/www.cse.msu.edu\/cgi-user\/web\/tech\/reports?Year=2009","journal-title":"Electronic Notes in Theoretical Computer Science"},{"issue":"11","key":"18_CR3","doi-asserted-by":"publisher","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\u00a019(11), 1015\u20131027 (1993)","journal-title":"IEEE Transactions on Software Engineering"},{"key":"18_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/3-540-48983-5_6","volume-title":"Hybrid Systems: Computation and Control","author":"E. Asarin","year":"1999","unstructured":"Asarin, E., Maler, O.: As soon as possible: Time optimal control for timed automata. In: Vaandrager, F.W., van Schuppen, J.H. (eds.) HSCC 1999. LNCS, vol.\u00a01569, pp. 19\u201330. Springer, Heidelberg (1999)"},{"key":"18_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)"},{"key":"18_CR6","doi-asserted-by":"crossref","unstructured":"Avi\u017eienis, A., Laprie, J.C., Randell, B., Landwehr, C.: Basic concepts and taxonomy of dependable and secure computing. IEEE Transactions on Dependable and Secure Computing, 11\u201333 (2004)","DOI":"10.1109\/TDSC.2004.2"},{"key":"18_CR7","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":"18_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/978-3-540-85361-9_16","volume-title":"CONCUR 2008 - Concurrency Theory","author":"B. Bonakdarpour","year":"2008","unstructured":"Bonakdarpour, B., Kulkarni, S.S.: Sycraft: A tool for synthesizing distributed fault-tolerant programs. In: van Breugel, F., Chechik, M. (eds.) CONCUR 2008. LNCS, vol.\u00a05201, pp. 167\u2013171. Springer, Heidelberg (2008)"},{"key":"18_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1007\/978-3-540-45069-6_18","volume-title":"Computer Aided Verification","author":"P. Bouyer","year":"2003","unstructured":"Bouyer, P., D\u2019Souza, D., Madhusudan, P., Petit, A.: Timed control with partial observability. In: Hunt Jr., W.A., Somenzi, F. (eds.) CAV 2003. LNCS, vol.\u00a02725, pp. 180\u2013192. Springer, Heidelberg (2003)"},{"key":"18_CR10","doi-asserted-by":"crossref","unstructured":"Faella, M., LaTorre, S., Murano, A.: Dense real-time games. In: Logic in Computer Science (LICS), pp. 167\u2013176 (2002)","DOI":"10.1109\/LICS.2002.1029826"},{"key":"18_CR11","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":"1","key":"18_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/311531.311532","volume":"31","author":"F.C. Gartner","year":"1999","unstructured":"Gartner, F.C.: Fundamentals of fault-tolerant distributed computing in asynchronous environments. ACM Computing Surveys (CSUR)\u00a031(1), 1\u201326 (1999)","journal-title":"ACM Computing Surveys (CSUR)"},{"key":"18_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1007\/3-540-45352-0_9","volume-title":"Formal Techniques in Real-Time and Fault-Tolerant Systems","author":"S.S. Kulkarni","year":"2000","unstructured":"Kulkarni, S.S., Arora, A.: Automating the addition of fault-tolerance. In: Joseph, M. (ed.) FTRTFT 2000. LNCS, vol.\u00a01926, pp. 82\u201393. Springer, Heidelberg (2000)"},{"issue":"3","key":"18_CR14","doi-asserted-by":"publisher","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 Transactions on Programming Languages and Systems\u00a04(3), 382\u2013401 (1982)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"18_CR15","unstructured":"Mantel, H., G\u00e4rtner, F.C.: A case study in the mechanical verification of fault-tolerance. Technical Report TUD-BS-1999-08, Department of Computer Science, Darmstadt University of Technology (1999)"},{"key":"18_CR16","unstructured":"Somenzi, F.: CUDD: Colorado University Decision Diagram Package, http:\/\/vlsi.colorado.edu\/~fabio\/CUDD\/cuddIntro.html"}],"container-title":["Lecture Notes in Computer Science","Stabilization, Safety, and Security of Distributed Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-16023-3_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,25]],"date-time":"2025-02-25T22:46:00Z","timestamp":1740523560000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-16023-3_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642160226","9783642160233"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-16023-3_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]},"assertion":[{"value":"20 September 2010","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}