{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T14:12:38Z","timestamp":1742393558862},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540609735"},{"type":"electronic","value":"9783540497493"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-60973-3_96","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T21:08:32Z","timestamp":1330290512000},"page":"347-366","source":"Crossref","is-referenced-by-count":4,"title":["Using a logical and categorical approach for the validation of fault-tolerant systems"],"prefix":"10.1007","author":[{"given":"C.","family":"Seguin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"V.","family":"Wiels","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"20_CR1","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1007\/BF00249016","volume":"7","author":"A. Bundy","year":"1991","unstructured":"A. Bundy, F. van Harmelen, J. Hesketh, and A. Smaill. Experiments with proof plans for induction. Journal of Automated Reasoning, 7:303\u2013324, 1991.","journal-title":"Journal of Automated Reasoning"},{"key":"20_CR2","doi-asserted-by":"crossref","unstructured":"K.M. Chandy and J. Misra. Parallel Program Design. A Foundation. Addison-Wesley, 1988.","DOI":"10.1007\/978-1-4613-9668-0_6"},{"key":"20_CR3","first-page":"24","volume":"407","author":"R. Cleaveland","year":"1989","unstructured":"R. Cleaveland, J. Parrow, and B. Steffen. The concurrency workbench. In proceedings of the workshop on automatic verification methods for finite-state systems, LNCS 407, pages 24\u201337, 1989.","journal-title":"LNCS"},{"key":"20_CR4","doi-asserted-by":"crossref","unstructured":"V. David, Ch. Fraboul, J.Y. Rousselot, and P. Siron. Partitioning and mapping communication graphs on a modular reconfigurable parallel architecture. In CON-PAR'92, Sept 1992.","DOI":"10.1007\/3-540-55895-0_396"},{"key":"20_CR5","doi-asserted-by":"crossref","unstructured":"E. Allen Emerson. Temporal and modal logic. In Handbook of theoretical computer science, pages 996\u20131071. Elsevier Science, 1990.","DOI":"10.1016\/B978-0-444-88074-1.50021-4"},{"key":"20_CR6","doi-asserted-by":"crossref","unstructured":"J. Fiadeiro and T. Maibaum. Temporal theories as modularisation units for concurrent system specification. Formal Aspects of Computing, 1992.","DOI":"10.1007\/BF01212304"},{"key":"20_CR7","first-page":"497","volume":"2","author":"D. Harel","year":"1984","unstructured":"D. Harel. Handbook of philosophical logic, volume 2, chapter 10, Dynamic Logic, pages 497\u2013604. 1984.","journal-title":"Dynamic Logic"},{"key":"20_CR8","doi-asserted-by":"crossref","unstructured":"C.A.R. Hoare. Communicating Sequential Processes. Prentice Hall, 1985.","DOI":"10.1007\/978-3-642-82921-5_4"},{"key":"20_CR9","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. Theoritical Computer Science, 27:333\u2013354, 1983.","journal-title":"Theoritical Computer Science"},{"key":"20_CR10","unstructured":"L. Lamport. The temporal logic of actions. Technical Report 79, SRC, 1992."},{"key":"20_CR11","doi-asserted-by":"crossref","unstructured":"Zohar Manna and Amir Pnueli. The temporal logic of reactive and concurrent systems. Springer-Verlag, 1992.","DOI":"10.1007\/978-1-4612-0931-7"},{"key":"20_CR12","doi-asserted-by":"crossref","unstructured":"Robin Milner. Handbook of theoretical computer science, chapter 19, Operational and algebraic semantics of concurrent processes, pages 1203\u20131242. Elsevier Science, 1990.","DOI":"10.1016\/B978-0-444-88074-1.50024-X"},{"key":"20_CR13","unstructured":"F. Pagani, C. Seguin, P. Siron, and V. Wiels. Verification experiments on a large fault-tolerant distributed system. In Workshop AMAST \u201cModel and Proof\u201d, Bordeaux, France, juin 1995."},{"key":"20_CR14","series-title":"number 571 in LNC-S","volume-title":"Formal Techniques in Real-Time and Fault-Tolerant Systems","author":"J. Rushby","year":"1992","unstructured":"John Rushby. Formal specification and verification of a fault-masking and transient-recovery model for digital flight-control systems. In J. Vytopil, editor, Formal Techniques in Real-Time and Fault-Tolerant Systems, number 571 in LNC-S, Nijmegen, The Netherlands, January 1992. Springer Verlag."},{"key":"20_CR15","unstructured":"D.E. Rydeheard and R.M. Burstall. Computational Category Theory. Prentice Hall, 1988."},{"key":"20_CR16","unstructured":"J. Sauloy. Interconnexion de modules. Technical report, CERT-ONERA, DERI, 1992."},{"key":"20_CR17","unstructured":"V. Wiels. Specification et verification de programmes paralleles tolerants aux fautes. Master's thesis, E.N.S.E.E.I.H.T, 1994."}],"container-title":["Lecture Notes in Computer Science","FME'96: Industrial Benefit and Advances in Formal Methods"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-60973-3_96.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,31]],"date-time":"2021-12-31T10:13:21Z","timestamp":1640945601000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-60973-3_96"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540609735","9783540497493"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-60973-3_96","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}