{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:06:06Z","timestamp":1725663966136},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540572084"},{"type":"electronic","value":"9783540479680"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/3-540-57208-2_25","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T12:18:24Z","timestamp":1330258704000},"page":"353-367","source":"Crossref","is-referenced-by-count":3,"title":["Transformations preserving properties and properties preserved by transformations in fair transition systems (extended abstract)"],"prefix":"10.1007","author":[{"given":"Shengzong","family":"Zhou","sequence":"first","affiliation":[]},{"given":"Rob","family":"Gerth","sequence":"additional","affiliation":[]},{"given":"Ruurd","family":"Kuiper","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,27]]},"reference":[{"key":"25_CR1","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1016\/0304-3975(91)90224-P","volume":"82","author":"M. Abadi","year":"1991","unstructured":"M. Abadi and L. Lamport: The Existence of Refinement Mappings; Theoretical Computer Science 82, pages 253\u2013284; 1991","journal-title":"Theoretical Computer Science"},{"key":"25_CR2","first-page":"67","volume":"430","author":"R. J. R. R. Back","year":"1990","unstructured":"R.J.R. Back: Refinement Calculus, Part II; In REX Workshop on 'stepwise Refinement of Distributed Systems'; LNCS 430; pages 67\u201393; 1990","journal-title":"LNCS"},{"key":"25_CR3","first-page":"199","volume":"366","author":"R. J. R. R. Back","year":"1989","unstructured":"R.J.R. Back: A Method for Refining Atomicity in Parallel Algorithms; In PARLE '89, Parallel Architectures and Languages Europe; LNCS 366; pages 199\u2013216; 1989","journal-title":"LNCS"},{"key":"25_CR4","unstructured":"K. M. Chandy and J. Misra: Parallel Program Design: a foundation, Addison-Wesley Publishing Company, Inc.; 1988"},{"key":"25_CR5","doi-asserted-by":"crossref","unstructured":"R.T. Gallager, P.A. Humblet and P.M. Spira: A distributed algorithm for minimum-weight spanning trees; ACM TOPLAS 5\u20131; 1983","DOI":"10.1145\/357195.357200"},{"key":"25_CR6","unstructured":"L. Lamport: The Temporal Logic of Actions; Technical Report 79, Digital Equipment Corporation, Systems Research Center; 1991"},{"key":"25_CR7","doi-asserted-by":"crossref","unstructured":"N.A. Lynch: Multivalued Possibilities Mappings; In REX Workshop on 'stepwise Refinement of Distributed Systems'; LNCS 430, pages 519\u2013544, Springer Verlag; 1990","DOI":"10.1007\/3-540-52559-9_77"},{"key":"25_CR8","doi-asserted-by":"crossref","unstructured":"Z. Manna and A. Pnueli: The Temporal Logic of Reactive and Concurrent Systems; Springer-Verlag; 1991","DOI":"10.1007\/978-1-4612-0931-7"},{"key":"25_CR9","doi-asserted-by":"crossref","unstructured":"A. Pnueli: The Temporal Logic of Programs; In Proceedings of the 18th IEEE FOCS, pages 46\u201357; 1977","DOI":"10.1109\/SFCS.1977.32"},{"key":"25_CR10","first-page":"128","volume":"506","author":"A. K. Singh","year":"1991","unstructured":"A. K. Singh: Program Refinement in Fair Transition Systems; In PARLE '91, Parallel Architectures and Languages Europe; LNCS 506; pages 128\u2013147; 1991","journal-title":"LNCS"},{"key":"25_CR11","unstructured":"C.S. Tang: Towards a Unified Logic Basis for Programming; Information Processing 83; pp. 425\u2013429; IFIP; 1983"},{"key":"25_CR12","unstructured":"S. Zhou: Compositional Temporal Logic Specification; Report No. SFB 124-07\/1991; University of Saarland; 1991"},{"key":"25_CR13","doi-asserted-by":"crossref","unstructured":"S. Zhou, R. Gerth and R. Kuiper: Transformations Preserving Properties and Properties Preserved by Transformations in Fair Transition Systems; Report No. SFB 124-09\/1993; University of Saarland; 1993","DOI":"10.1007\/3-540-57208-2_25"}],"container-title":["Lecture Notes in Computer Science","CONCUR'93"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-57208-2_25.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:09:17Z","timestamp":1605647357000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-57208-2_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540572084","9783540479680"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-57208-2_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1993]]}}}