{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,21]],"date-time":"2025-05-21T06:55:59Z","timestamp":1747810559090,"version":"3.37.3"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642152399"},{"type":"electronic","value":"9783642152405"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-15240-5_3","type":"book-chapter","created":{"date-parts":[[2010,8,4]],"date-time":"2010-08-04T11:30:15Z","timestamp":1280921415000},"page":"32-52","source":"Crossref","is-referenced-by-count":9,"title":["The Coarsest Precongruences Respecting Safety and Liveness Properties"],"prefix":"10.1007","author":[{"given":"Robert Jan","family":"van Glabbeek","sequence":"first","affiliation":[]}],"member":"297","reference":[{"volume-title":"Process Algebra for Parallel and Distributed Processing","year":"2008","key":"3_CR1","unstructured":"Alexander, M., Gardner, W. (eds.): Process Algebra for Parallel and Distributed Processing. Chapman & Hall, Boca Raton (2008)"},{"issue":"3","key":"3_CR2","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/0890-5401(88)90027-2","volume":"78","author":"J.C.M. Baeten","year":"1988","unstructured":"Baeten, J.C.M., Bergstra, J.A.: Global renaming operators in concrete process algebra. Information and Computation\u00a078(3), 205\u2013245 (1988)","journal-title":"Information and Computation"},{"issue":"1","key":"3_CR3","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/0304-3975(85)90088-X","volume":"37","author":"J.A. Bergstra","year":"1985","unstructured":"Bergstra, J.A., Klop, J.W.: Algebra of communicating processes with abstraction. Theoretical Computer Science\u00a037(1), 77\u2013121 (1985)","journal-title":"Theoretical Computer Science"},{"issue":"3","key":"3_CR4","doi-asserted-by":"publisher","first-page":"560","DOI":"10.1145\/828.833","volume":"31","author":"S.D. Brookes","year":"1984","unstructured":"Brookes, S.D., Hoare, C.A.R., Roscoe, A.W.: A theory of communicating sequential processes. Journal of the ACM\u00a031(3), 560\u2013599 (1984)","journal-title":"Journal of the ACM"},{"key":"3_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":"De Nicola, R., Hennessy, M.: Testing equivalences for processes. Theoretical Computer Science\u00a034, 83\u2013133 (1984)","journal-title":"Theoretical Computer Science"},{"key":"3_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1007\/11817949_9","volume-title":"CONCUR 2006 \u2013 Concurrency Theory","author":"R.J. Glabbeek van","year":"2006","unstructured":"van Glabbeek, R.J., Voorhoeve, M.: Liveness, Fairness and Impossible Futures. In: Baier, C., Hermanns, H. (eds.) CONCUR 2006. LNCS, vol.\u00a04137, pp. 126\u2013141. Springer, Heidelberg (2006)"},{"key":"3_CR7","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/B978-044482830-9\/50019-9","volume-title":"Handbook of Process Algebra, ch.1","author":"R.J. Glabbeek van","year":"2001","unstructured":"van Glabbeek, R.J.: The Linear Time \u2013 Branching Time Spectrum I; The Semantics of Concrete, Sequential Processes. In: Bergstra, J.A., Ponse, A., Smolka, S.A. (eds.) Handbook of Process Algebra, ch.1, pp. 3\u201399. Elsevier, Amsterdam (2001)"},{"key":"3_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/BFb0084793","volume-title":"CONCUR \u201992","author":"R. Kaivola","year":"1992","unstructured":"Kaivola, R., Valmari, A.: The Weakest Compositional Semantic Equivalence Preserving Nexttime-less Linear Temporal Logic. In: Cleaveland, W.R. (ed.) CONCUR 1992. LNCS, vol.\u00a0630, pp. 207\u2013221. Springer, Heidelberg (1992), \n                  \n                    http:\/\/dx.doi.org\/10.1007\/BFb0084793"},{"issue":"2","key":"3_CR9","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1109\/TSE.1977.229904","volume":"3","author":"L. Lamport","year":"1977","unstructured":"Lamport, L.: Proving the correctness of multiprocess programs. IEEE Transactions on Software Engineering\u00a03(2), 125\u2013143 (1977)","journal-title":"IEEE Transactions on Software Engineering"},{"issue":"1-2","key":"3_CR10","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1016\/S0304-3975(98)00129-7","volume":"206","author":"L. Lamport","year":"1998","unstructured":"Lamport, L.: Proving Possibility Properties. Theoretical Computer Science\u00a0206(1-2), 341\u2013352 (1998), \n                  \n                    http:\/\/research.microsoft.com\/en-us\/um\/people\/lamport\/pubs\/pubs.html#lamport-possibility","journal-title":"Theoretical Computer Science"},{"issue":"2-3","key":"3_CR11","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1016\/j.apal.2007.10.007","volume":"151","author":"P.B. Levy","year":"2008","unstructured":"Levy, P.B.: Infinite trace equivalence. Annals of Pure and Applied Logic\u00a0151(2-3), 170\u2013198 (2008), \n                  \n                    http:\/\/dx.doi.org\/10.1016\/j.apal.2007.10.007","journal-title":"Annals of Pure and Applied Logic"},{"key":"#cr-split#-3_CR12.1","doi-asserted-by":"crossref","unstructured":"Milner, R.: Operational and algebraic semantics of concurrent processes. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science, ch.\u200b19, pp. 1201\u20131242. Elsevier Science Publishers B.V, North-Holland (1990);","DOI":"10.1016\/B978-0-444-88074-1.50024-X"},{"key":"#cr-split#-3_CR12.2","unstructured":"Alternatively see Communication and Concurrency. Prentice-Hall, Englewood Cliffs, (1989), an earlier version appeared as A Calculus of Communicating systems. LNCS, vol. 92. Springer, Heidelberg (1980)"},{"key":"3_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"400","DOI":"10.1007\/3-540-45500-0_20","volume-title":"Theoretical Aspects of Computer Software","author":"A. Puhakka","year":"2001","unstructured":"Puhakka, A.: Weakest Congruence Results Concerning \u201cAny-Lock\u201d. In: Kobayashi, N., Pierce, B.C. (eds.) TACS 2001. LNCS, vol.\u00a02215, pp. 400\u2013419. Springer, Heidelberg (2001)"},{"key":"3_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1007\/11423348_2","volume-title":"Communicating Sequential Processes. The First 25 Years","author":"A.W. Roscoe","year":"2005","unstructured":"Roscoe, A.W.: Seeing Beyond Divergence. In: Abdallah, A.E., Jones, C.B., Sanders, J.W. (eds.) Communicating Sequential Processes. LNCS, vol.\u00a03525, pp. 15\u201335. Springer, Heidelberg (2005)"},{"key":"3_CR15","volume-title":"The Theory and Practice of Concurrency","author":"A.W. Roscoe","year":"1997","unstructured":"Roscoe, A.W.: The Theory and Practice of Concurrency. Prentice-Hall, Englewood Cliffs (1997), \n                  \n                    http:\/\/www.comlab.ox.ac.uk\/bill.roscoe\/publications\/68b.pdf"}],"container-title":["IFIP Advances in Information and Communication Technology","Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15240-5_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,17]],"date-time":"2019-03-17T17:37:07Z","timestamp":1552844227000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15240-5_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642152399","9783642152405"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15240-5_3","relation":{},"ISSN":["1868-4238","1861-2288"],"issn-type":[{"type":"print","value":"1868-4238"},{"type":"electronic","value":"1861-2288"}],"subject":[],"published":{"date-parts":[[2010]]}}}