{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T21:10:08Z","timestamp":1742591408541,"version":"3.40.2"},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540176602"},{"type":"electronic","value":"9783540477464"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1987]]},"DOI":"10.1007\/3-540-17660-8_54","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T19:16:57Z","timestamp":1330197417000},"page":"153-168","source":"Crossref","is-referenced-by-count":5,"title":["A fully observational model for infinite behaviours of communicating systems"],"prefix":"10.1007","author":[{"given":"Ph.","family":"Darondeau","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"B.","family":"Gamatie","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,3]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"Abramsky S. Experiments, Power domains, and Fully Abstract Models for Applicative Multiprogramming FCT 83, Borgholm Springer-Verlag, LNCS 158 (83) pp. 1\u201313","key":"12_CR1","DOI":"10.1007\/3-540-12689-9_89"},{"unstructured":"Arnold A., Dicky A. An Algebraic Characterization of Transition System Equivalence, Report I-8603, Universit\u00e9 de Bordeaux (86)","key":"12_CR2"},{"unstructured":"Beki\u0107 H. Definable Operations in General Algebras, and the Theory of Automata and Flowcharts, IBM Laboratory Vienna (69) also in: Programming Languages and their Definition, selected papers of H. Beki\u0107, Springer-Verlag LNCS 177(84)","key":"12_CR3"},{"unstructured":"Bergstra J.A., Klop J.W., Olderog E.R. Readies and Failures in the Algebra of Communicating Processes, Report CS-R8523, CWI, Amsterdam (85)","key":"12_CR4"},{"doi-asserted-by":"crossref","unstructured":"Boasson L., Nivat M. Adherences of Languages, JCSS 20 (80) pp. 285\u2013309","key":"12_CR5","DOI":"10.1016\/0022-0000(80)90010-0"},{"doi-asserted-by":"crossref","unstructured":"Boudol G. Notes on Algebraic Calculi of Processes, Logics and Models of Concurrent Systems, K. Apt. ed, NATO-ASI-Series, Springer-Verlag (85) pp. 261\u2013304","key":"12_CR6","DOI":"10.1007\/978-3-642-82453-1_9"},{"doi-asserted-by":"crossref","unstructured":"Brookes S, Roscoe A. W. An Improved Failures Model for Communicating Processes Seminar on Concurrency, Brookes Roscoe Winskel eds. Springer-Verlag, LNCS 197(85) pp. 281\u2013305","key":"12_CR7","DOI":"10.1007\/3-540-15670-4_14"},{"doi-asserted-by":"crossref","unstructured":"Darondeau Ph. Kott L. On the Observational Semantics of Fair Parallelism, ICALP 83, Barcelona, Springer-Verlag LNCS 154 (83) pp. 147\u2013159","key":"12_CR8","DOI":"10.1007\/BFb0036905"},{"doi-asserted-by":"crossref","unstructured":"Darondeau Ph. About Fair Asynchrony, TCS 37 (85) pp. 305\u2013336","key":"12_CR9","DOI":"10.1016\/0304-3975(85)90095-7"},{"unstructured":"\" Separating and Testing, STACS 86, Orsay, Springer-Verlag LNCS 210 (86) pp. 203\u2013212","key":"12_CR10"},{"doi-asserted-by":"crossref","unstructured":"de Bakker J.W., Meyer J.J.Ch., Olderog E.R. Infinite Streams and Finite Observations in the Semantics of Uniform Concurrency, ICALP 85, Naflion, Springer-Verlag LNCS 194 (85) pp. 149\u2013157","key":"12_CR11","DOI":"10.1007\/BFb0015740"},{"doi-asserted-by":"crossref","unstructured":"de Bakker J.W., Meyer J.J.Ch., Olderog E.R., Zucker J.I. Transition Systems, Infinitary Languages and the Semantics of Uniform Concurrency 17th ACM STOC, Providence (85) pp. 252,262","key":"12_CR12","DOI":"10.1145\/22145.22174"},{"doi-asserted-by":"crossref","unstructured":"de Nicola R., Hennessy M. Testing Equivalences for Processes TCS 34 (84) pp. 83\u2013133","key":"12_CR13","DOI":"10.1016\/0304-3975(84)90113-0"},{"unstructured":"de Nicola R. Testing Equivalences and Fully Abstract Models for Communicating Processes. Ph. D Thesis, University of Edinburgh (85)","key":"12_CR14"},{"unstructured":"Gamatie B. Observational Congruences of Non Deterministic and Communicating Finite Processes RR-254-IRISA Rennes (85)","key":"12_CR15"},{"unstructured":"\" Safe Implementation Equivalence for Asynchronous Non Deterministic Processes, MFCS 86, Bratislava, Springer-Verlag LNCS 233 (86)","key":"12_CR16"},{"unstructured":"\" Towards Specification and Proof of Asynchronous Systems, STACS 86, Orsay, Springer-Verlag LNCS 210 (86) pp. 203\u2013212","key":"12_CR17"},{"doi-asserted-by":"crossref","unstructured":"Golson W., Rounds W. C. Connections Between two Theories of Concurrency: Metric Spaces and Synchronization Trees Information and Control 57 (83) pp.102\u2013124","key":"12_CR18","DOI":"10.1016\/S0019-9958(83)80039-4"},{"doi-asserted-by":"crossref","unstructured":"Hennessy M., Plotkin G. A Term Model for CCS Springer-Verlag LNCS 88 (80) pp.261\u2013274","key":"12_CR19","DOI":"10.1007\/BFb0022510"},{"doi-asserted-by":"crossref","unstructured":"Hennessy M. Acceptance Trees, JACM 32 (85) pp. 896\u2013928","key":"12_CR20","DOI":"10.1145\/4221.4249"},{"doi-asserted-by":"crossref","unstructured":"Jorrand Ph Specification of Communicating Processes and Process Implementation Correctness, 5th Int. Symposium on Programming, Turin Springer Verlag LNCS 137(82) pp.242\u2013256","key":"12_CR21","DOI":"10.1007\/3-540-11494-7_17"},{"doi-asserted-by":"crossref","unstructured":"Milner R. Fully Abstract Models of Typed lambda-calculi, TCS 4 (77) pp. 1\u201323","key":"12_CR22","DOI":"10.1016\/0304-3975(77)90053-6"},{"unstructured":"\" A Calculus of Communicating Systems, Springer \u2014 Verlag LNCS 92 (80)","key":"12_CR23"},{"doi-asserted-by":"crossref","unstructured":"Olderog E. R., Hoare C.A.R. Specification Oriented Semantics for Communicating Processes, Acta Informatica 23,1 (86) pp. 9\u201386","key":"12_CR24","DOI":"10.1007\/BF00268075"},{"unstructured":"Plotkin G. A Structural Approach to Operational Semantics, Rept. DAIMI-FN-19, Univ. of Aarhus, Computer Science Department (81)","key":"12_CR25"},{"doi-asserted-by":"crossref","unstructured":"Pnueli A. Linear and Branching Structures in the Semantics and Logics of Reactive Systems, ICALP 85, Nafplion, Springer \u2014 Verlag LNCS 194 (85) pp. 15\u201332","key":"12_CR26","DOI":"10.1007\/BFb0015727"},{"doi-asserted-by":"crossref","unstructured":"Rounds W. C. On the Relationships Between Scott Domains, Synchronization Trees and Metric Spaces, Information and Control 66 (85) pp. 6\u201328","key":"12_CR27","DOI":"10.1016\/S0019-9958(85)80009-7"},{"doi-asserted-by":"crossref","unstructured":"Tarski A. A Lattice Theoretic Fixpoint Theorem and its Applications, Pacific Journal of Mathematics 5 (55) pp. 285\u2013309.","key":"12_CR28","DOI":"10.2140\/pjm.1955.5.285"}],"container-title":["Lecture Notes in Computer Science","TAPSOFT '87"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-17660-8_54.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T20:34:38Z","timestamp":1742589278000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-17660-8_54"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987]]},"ISBN":["9783540176602","9783540477464"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/3-540-17660-8_54","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1987]]}}}