{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,15]],"date-time":"2024-09-15T15:10:00Z","timestamp":1726413000750},"reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540558224"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0084782","type":"book-chapter","created":{"date-parts":[[2006,11,24]],"date-time":"2006-11-24T08:12:14Z","timestamp":1164355934000},"page":"47-61","source":"Crossref","is-referenced-by-count":0,"title":["On the uniqueness of fixpoints modulo observation congruence"],"prefix":"10.1007","author":[{"given":"Ed","family":"Brinksma","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"5_CR1","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/0169-7552(87)90085-7","volume":"14","author":"T. Bolognesi","year":"1987","unstructured":"Tommaso Bolognesi and Ed Brinksma. Introduction to the ISO specification language LOTOS. Computer Networks and ISDN Systems, 14:25\u201359, 1987.","journal-title":"Computer Networks and ISDN Systems"},{"issue":"1","key":"5_CR2","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/0304-3975(85)90088-X","volume":"37","author":"J. A. Bergstra","year":"1985","unstructured":"J. A. Bergstra and J. W. Klop. Algebra of communicating processes with abstraction. Theoretical Computer Science, 37(1):77\u2013121, 1985.","journal-title":"Theoretical Computer Science"},{"key":"5_CR3","doi-asserted-by":"crossref","unstructured":"J. A. Bergstra and J. W. Klop. Process theory based on bisimulation semantics. In J. W. de Bakker, Willem-Paul de Roever, and Grzegorz Rozenberg, editors, Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, volume 354 of Lecture Notes in Computer Science, pages 50\u2013122. Springer-Verlag, 1989.","DOI":"10.1007\/BFb0013021"},{"key":"5_CR4","unstructured":"Ed Brinksma. On the uniqueness of fixpoints modulo observation congruence. Memoranda informatica, University of Twente, 1992. Forthcoming."},{"key":"5_CR5","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/0304-3975(84)90113-0","volume":"34","author":"R. Nicola De","year":"1984","unstructured":"Rocco De Nicola and Matthew Hennessy. Testing equivalences for processes. Theoretical Computer Science, 34:83\u2013133, 1984.","journal-title":"Theoretical Computer Science"},{"key":"5_CR6","doi-asserted-by":"crossref","unstructured":"Jan Friso Groote and Frits W. Vaandrager. Structured operational semantics and bisimulation as a congruence. In G. Ausiello, M. Dezani-Ciancaglini, and S. Ronchi Della Rocca, editors, Automata, Languages and Programming, volume 372 of Lecture Notes in Computer Science, pages 423\u2013438. Springer-Verlag, 1989.","DOI":"10.1007\/BFb0035774"},{"key":"5_CR7","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":"5_CR8","volume-title":"LOTOS \u2014 a formal description technique based on the temporal ordering of observational behaviour","author":"ISO","year":"1989","unstructured":"ISO. Information processing systems \u2014 open systems interconnection-LOTOS \u2014 a formal description technique based on the temporal ordering of observational behaviour. International Standard 8807, ISO, Geneva, February 1989. 1st Edition.","edition":"1st Edition"},{"key":"5_CR9","doi-asserted-by":"crossref","unstructured":"E. Kranakis. Fixed point equations with parameters in the projective model. Information and Control, 75(3), 1987.","DOI":"10.1016\/0890-5401(87)90003-4"},{"key":"5_CR10","doi-asserted-by":"crossref","unstructured":"Kim G. Larsen. Compositional theories based on an operational semantics of contexts. In J. W. de Bakker, W. P. de Roever, and Grzegorz Rozenberg, editors, Stepwise Refinement of Distributed Systems \u2014 Models, Formalisms, Correctness, volume 430 of Lecture Notes in Computer Science, pages 487\u2013518. Springer-Verlag, 1990.","DOI":"10.1007\/3-540-52559-9_76"},{"key":"5_CR11","doi-asserted-by":"crossref","unstructured":"R. Milner. A Calculus of Communicating Systems, volume 92 of Lecture Notes in Computer Science. Springer-Verlag, 1980.","DOI":"10.1007\/3-540-10235-3"},{"key":"5_CR12","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1016\/0304-3975(83)90114-7","volume":"25","author":"R. Milner","year":"1983","unstructured":"R. Milner. Calculi for synchrony and asynchrony. Theoretical Computer Science, 25:267\u2013310, 1983.","journal-title":"Theoretical Computer Science"},{"key":"5_CR13","unstructured":"R. Milner. Communication and Concurrency. Prentice-Hall, 1989."},{"key":"5_CR14","unstructured":"Michael Thomas Sanderson. Proof Techniques for CCS. PhD thesis, University of Edinburgh, November 1982."}],"container-title":["Lecture Notes in Computer Science","CONCUR '92"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0084782.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,9]],"date-time":"2023-05-09T16:29:46Z","timestamp":1683649786000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0084782"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540558224"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/bfb0084782","relation":{},"subject":[]}}