{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T12:46:34Z","timestamp":1725453994258},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540638889"},{"type":"electronic","value":"9783540696612"}],"license":[{"start":{"date-parts":[[1997,1,1]],"date-time":"1997-01-01T00:00:00Z","timestamp":852076800000},"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":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/bfb0000478","type":"book-chapter","created":{"date-parts":[[2005,10,5]],"date-time":"2005-10-05T06:30:36Z","timestamp":1128493836000},"page":"292-306","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["On bisimulation, fault-monotonicity and provable fault-tolerance"],"prefix":"10.1007","author":[{"given":"Tomasz","family":"Janowski","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,9,7]]},"reference":[{"key":"20_CR1","first-page":"1","volume":"372","author":"M. Abadi","year":"1989","unstructured":"M. Abadi, L. Lamport, and P. Wolper. Realizable and unrealizable specifications of reactive systems. LNCS, 372:1\u201317, 1989.","journal-title":"LNCS"},{"issue":"3","key":"20_CR2","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1007\/BF01384499","volume":"6","author":"A. Borjesson","year":"1995","unstructured":"A. Borjesson, K.G. Larsen, and A. Skou. Generality in design and compositional verification using TAV. Formal Methods in System Design, 6(3):239\u2013258, 1995.","journal-title":"Formal Methods in System Design"},{"key":"20_CR3","unstructured":"G. Bruns. Applying process refinement to a safety-relevant system. Technical report, Lab. for Foundations of Computer Science, University of Edinburgh, 1994."},{"key":"20_CR4","doi-asserted-by":"crossref","unstructured":"K.M. Chandy and J. Misra. Parallel Program Design. Addison-Wesley, 1988.","DOI":"10.1007\/978-1-4613-9668-0_6"},{"issue":"1","key":"20_CR5","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1109\/TSE.1985.231534","volume":"11","author":"F. Cristian","year":"1985","unstructured":"F. Cristian. A rigorous approach to fault-tolerant programming. IEEE Transactions on Software Engineering, 11(1):23\u201331, 1985.","journal-title":"IEEE Transactions on Software Engineering"},{"issue":"1","key":"20_CR6","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1145\/2455.2460","volume":"32","author":"M. Hennessy","year":"1985","unstructured":"M. Hennessy and R. Milner. Algebraic laws for nondeterminism and concurrency. Journal of the ACM, 32(1):137\u2013161, 1985.","journal-title":"Journal of the ACM"},{"key":"20_CR7","doi-asserted-by":"crossref","unstructured":"T. Janowski. Stepwise transformations for fault-tolerant design of CCS processes. In Proc. 7th Int. Conference on Formal Description Techniques, pages 505\u2013520. Chapman and Hall, 1994.","DOI":"10.1007\/978-0-387-34878-0_42"},{"key":"20_CR8","unstructured":"T. Janowski. Bisimulation and Fault-Tolerance. PhD thesis, Department of Computer Science, University of Warwick, 1995."},{"key":"20_CR9","doi-asserted-by":"crossref","unstructured":"T. Janowski and M. Joseph. Dynamic scheduling in the presence of faults: Specification and verification. In Proc. 4rd Int. Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems, volume 1135 of LNCS, pages 279\u2013297, 1996.","DOI":"10.1007\/3-540-61648-9_46"},{"key":"20_CR10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01786251","volume":"2","author":"H. Jifeng","year":"1987","unstructured":"He Jifeng and C.A.R. Hoare. Algebraic specification and proof of a distributed recovery algorithm. Distributed Computing, 2:1\u201312, 1987.","journal-title":"Distributed Computing"},{"key":"20_CR11","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1016\/0890-5401(92)90025-B","volume":"99","author":"K.G. Larsen","year":"1992","unstructured":"K.G. Larsen and R. Milner. A compositional protocol verification using relativized bisimulation. Information and Computation, 99:80\u2013108, 1992.","journal-title":"Information and Computation"},{"key":"20_CR12","unstructured":"Z. Liu. Fault-Tolerant Programming by Transformations. PhD thesis, University of Warwick, 1991."},{"key":"20_CR13","doi-asserted-by":"crossref","first-page":"442","DOI":"10.1007\/BF01211393","volume":"4","author":"Z. Liu","year":"1992","unstructured":"Z. Liu and M. Joseph. Transformations of programs for fault-tolerance. Formal Aspects of Computing, 4:442\u2013469, 1992.","journal-title":"Formal Aspects of Computing"},{"key":"20_CR14","unstructured":"R. Milner. Communication and Concurrency. Prentice-Hall International, 1989."},{"key":"20_CR15","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1007\/BF02259750","volume":"5","author":"K. Paliwoda","year":"1991","unstructured":"K. Paliwoda and J.W. Sanders. An incremental specification of the sliding-window protocol. Distributed Computing, 5:83\u201394, 1991.","journal-title":"Distributed Computing"},{"key":"20_CR16","unstructured":"D. Park. Concurrency and automata on infinite sequences. LNCS, 104, 81."},{"key":"20_CR17","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1007\/BF02259751","volume":"5","author":"J. Peleska","year":"1991","unstructured":"J. Peleska. Design and verification of fault tolerant systems with CSP. Distributed Computing, 5:95\u2013106, 1991.","journal-title":"Distributed Computing"},{"key":"20_CR18","unstructured":"K.V.S. Prasad. Combinators and Bisimulation Proofs for Restartable Systems. PhD thesis, Department of Computer Science, University of Edinburgh, 1987."},{"key":"20_CR19","unstructured":"H. Schepers. Fault Tolerance and Timing of Distributed Systems. PhD thesis, Eindhoven University of Technology, 1994."}],"container-title":["Lecture Notes in Computer Science","Algebraic Methodology and Software Technology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0000478","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T08:56:26Z","timestamp":1558256186000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0000478"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540638889","9783540696612"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/bfb0000478","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]},"assertion":[{"value":"7 September 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}