{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T12:46:29Z","timestamp":1725453989230},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540638889"},{"type":"electronic","value":"9783540696612"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/bfb0000462","type":"book-chapter","created":{"date-parts":[[2005,10,5]],"date-time":"2005-10-05T06:30:36Z","timestamp":1128493836000},"page":"45-59","source":"Crossref","is-referenced-by-count":13,"title":["Model checking and fault tolerance"],"prefix":"10.1007","author":[{"given":"Glenn","family":"Bruns","sequence":"first","affiliation":[]},{"given":"Ian","family":"Sutherland","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,9,7]]},"reference":[{"key":"4_CR1","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1007\/BF01782772","volume":"2","author":"B. Alpern","year":"1987","unstructured":"Bowen Alpern and Fred B. Schneider. Recognizing safety and liveness. Distributed Computing, 2:117\u2013126, 1987.","journal-title":"Distributed Computing"},{"issue":"2","key":"4_CR2","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1145\/152610.152612","volume":"25","author":"M. Barborak","year":"1993","unstructured":"Michael Barborak, Miroslaw Malek, and Anton Dahbura. The consensus problem in fault-tolerant computing. ACM Computing Surveys, 25(2):171\u2013220, June 1993.","journal-title":"ACM Computing Surveys"},{"key":"4_CR3","first-page":"260","volume":"663","author":"S. Bensalem","year":"1992","unstructured":"S. Bensalem, A. Bouajjani, C. Loiseaux, and J. Sifakis. Property preserving simulations. In Proceedings of CAV '92, LNCS 663, pages 260\u2013273, 1992.","journal-title":"LNCS"},{"key":"4_CR4","unstructured":"Bard Bloom. Structured operational semantics as a specification language. In Proceedings of LICS '94. IEEE Computer Society Press, 1994."},{"issue":"1","key":"4_CR5","doi-asserted-by":"crossref","first-page":"232","DOI":"10.1145\/200836.200876","volume":"42","author":"B. Bloom","year":"1995","unstructured":"Bard Bloom, Sorin Istrail, and Albert R. Meyer. Bisimulation can't be traced. Journal of the ACM, 42(1):232\u2013268, 1995.","journal-title":"Journal of the ACM"},{"key":"4_CR6","doi-asserted-by":"crossref","unstructured":"Glenn Bruns. A case study in safety-critical design. In G.v. Bochmann and D.K. Probst, editors, Proceedings of CAV '91, LNCS 575, pages 220\u2013233, 1991.","DOI":"10.1007\/3-540-56496-9_18"},{"key":"4_CR7","unstructured":"Glenn Bruns. Process Abstraction in the Verification of Temporal Properties. PhD thesis, University of Edinburgh, 1997."},{"key":"4_CR8","first-page":"153","volume":"1019","author":"R. Cleaveland","year":"1995","unstructured":"R. Cleaveland, E. Madelaine, and S. Sims. Generating front ends for verification tools. In Proceedings of TACAS '95, LNCS 1019, pages 153\u2013173, 1995.","journal-title":"LNCS"},{"key":"4_CR9","doi-asserted-by":"crossref","unstructured":"R. Cleaveland and S. Sims. The NCSU concurrency workbench. In R. Alur and T. Henzinger, editors, Proceedings of CAV '96, 1996.","DOI":"10.1007\/3-540-61474-5_87"},{"key":"4_CR10","first-page":"50","volume":"15","author":"R. Cleaveland","year":"1996","unstructured":"Rance Cleaveland, Gerard L\u00fcttgen, V. Natarajan, and Steve Sims. Modeling and verifying distributed systems using priorities: A case study. Software Concepts and Tools, 15:50\u201362, 1996.","journal-title":"Software Concepts and Tools"},{"key":"4_CR11","doi-asserted-by":"crossref","unstructured":"A.H. Cribbens. Solid-state interlocking (SSI): an integrated electronic signalling system for mainline railways. IEE Proceedings, 134(B3), 1987.","DOI":"10.1049\/ip-b.1987.0024"},{"issue":"2","key":"4_CR12","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1016\/0890-5401(92)90013-6","volume":"100","author":"J. F. Groote","year":"1992","unstructured":"J. F. Groote and F. W. Vaandrager. Structured operational semantics and bisimulation as a congruence. Information and Computation, 100(2):202\u2013260, 1992.","journal-title":"Information and Computation"},{"key":"4_CR13","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1016\/0304-3975(82)90125-6","volume":"27","author":"D. Kozen","year":"1983","unstructured":"D. Kozen. Results on the propositional mu-calculus. Theoretical Computer Science, 27:333\u2013354, 1983.","journal-title":"Theoretical Computer Science"},{"key":"4_CR14","unstructured":"Parag K. Lala. Fault Tolerant and Fault Testable Hardware Design. Prentice Hall, 1985."},{"key":"4_CR15","doi-asserted-by":"crossref","unstructured":"Patrick Lincoln and John Rushby. The formal verification of an algorithm for interactive consistency under a hybrid fault model. In Proceedings of CAV '93, 1993.","DOI":"10.1007\/3-540-56922-7_24"},{"key":"4_CR16","doi-asserted-by":"crossref","unstructured":"Nancy A. Lynch. Multivalued possibilities mapping. In J.W. de Bakker, W.-P. de Roever, and G. Rozenberg, editors, Stepwise Refinement of Distributed Systems, pages 519\u2013543, 1989. LNCS 430.","DOI":"10.1007\/3-540-52559-9_77"},{"issue":"4","key":"4_CR17","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1145\/98163.98167","volume":"22","author":"F. B. Schneider","year":"1990","unstructured":"Fred B. Schneider. Implementing fault-tolerant services using the state machine approach: A tutorial. ACM Computing Surveys, 22(4):299\u2013320, 1990.","journal-title":"ACM Computing Surveys"},{"key":"4_CR18","doi-asserted-by":"crossref","first-page":"285","DOI":"10.2140\/pjm.1955.5.285","volume":"5","author":"A. Tarski","year":"1955","unstructured":"A. Tarski. A lattice-theoretical fixpoint theorem and its applications. Pacific J. of Maths, 5:285\u2013309, 1955.","journal-title":"Pacific J. of Maths"},{"key":"4_CR19","first-page":"43","volume":"34","author":"J. Neumann von","year":"1956","unstructured":"J. von Neumann. Probabilistic logics and synthesis of reliable organisms from unreliable components. Annals of Mathematical Studies, 34:43\u201398, 1956.","journal-title":"Annals of Mathematical Studies"}],"container-title":["Lecture Notes in Computer Science","Algebraic Methodology and Software Technology"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0000462","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,9]],"date-time":"2020-04-09T22:21:21Z","timestamp":1586470881000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0000462"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540638889","9783540696612"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/bfb0000462","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}