{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:23:10Z","timestamp":1725664990579},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540631651"},{"type":"electronic","value":"9783540691945"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/3-540-63165-8_204","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T23:11:38Z","timestamp":1330297898000},"page":"482-492","source":"Crossref","is-referenced-by-count":1,"title":["Basic observables for processes"],"prefix":"10.1007","author":[{"given":"Michele","family":"Boreale","sequence":"first","affiliation":[]},{"given":"Rocco","family":"Nicola","sequence":"additional","affiliation":[]},{"given":"Rosario","family":"Pugliese","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,8]]},"reference":[{"key":"46_CR1","unstructured":"S. Abramsky. The lazy lambda calculus. Research Topics in Functional Programming, David Turner, ed., Addison-Wesley, 1990."},{"issue":"1","key":"46_CR2","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1145\/200836.200876","volume":"42","author":"B. Bloom","year":"1995","unstructured":"B. Bloom, S. Istrail, A.R. Meyer. Bisimulation can't be traced. Journal of the ACM, 42(1):232\u2013268, 1995.","journal-title":"Journal of the ACM"},{"key":"46_CR3","doi-asserted-by":"crossref","unstructured":"E. Brinksma, A. Rensink, W. Vogler. Fair Testing. Proceedings of CONCUR'95, LNCS 962, pages 313\u2013327, Springer, 1995.","DOI":"10.1007\/3-540-60218-6_23"},{"key":"46_CR4","doi-asserted-by":"crossref","unstructured":"E. Brinksma, A. Rensink, W. Vogler. Applications of Fair Testing. In R. Gotzhein and J. Bredereke, ed., Formal Description Techniques IX, Chapman & Hall, 1996.","DOI":"10.1007\/978-0-387-35079-0_9"},{"issue":"3","key":"46_CR5","doi-asserted-by":"publisher","first-page":"560","DOI":"10.1145\/828.833","volume":"31","author":"S.D. Brookes","year":"1984","unstructured":"S.D. Brookes, C.A.R. Hoare, A.W. Roscoe. A theory of communicating sequential processes. Journal of the ACM, 31(3):560\u2013599, 1984.","journal-title":"Journal of the ACM"},{"key":"46_CR6","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/0304-3975(84)90113-0","volume":"34","author":"R. Nicola de","year":"1984","unstructured":"R. de Nicola, M.C.B. Hennessy. Testing Equivalence for Processes. Theoretical Computers Science, 34:83\u2013133, 1984.","journal-title":"Theoretical Computers Science"},{"key":"46_CR7","doi-asserted-by":"crossref","unstructured":"R. De Nicola, M.C.B. Hennessy. CCS without \u03c4's. Proceedings of TAPSOFT'87, LNCS 249, pages 138\u2013152, Springer, 1987.","DOI":"10.1007\/3-540-17660-8_53"},{"key":"46_CR8","unstructured":"W. Ferreira. Semantic Theories for Concurrent ML. Ph.D. Thesis, University of Sussex, 1996."},{"key":"46_CR9","doi-asserted-by":"crossref","unstructured":"C. Fournet, G. Gonthier, J.-L. L\u00e9vy, L. Maranget, D. R\u00e9my. A Calculus of Mobile Agents. Proceedings of CONCUR'96, LNCS 1119, 1996.","DOI":"10.1007\/3-540-61604-7_67"},{"key":"46_CR10","unstructured":"M.C.B. Hennessy. Algebraic Theory of Processes. MIT Press, 1988."},{"key":"46_CR11","doi-asserted-by":"crossref","unstructured":"M.C.B. Hennessy. Observing Processes. In Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, LNCS 354, Springer, 1989.","DOI":"10.1007\/BFb0013023"},{"key":"46_CR12","series-title":"Technical Report UBLCS96-4","volume-title":"May and Must Testing in the Join-Calculus","author":"C. Laneve","year":"1996","unstructured":"C. Laneve. May and Must Testing in the Join-Calculus. Technical Report UBLCS96-4, Universit\u00e0 di Bologna, Dept. of Computer Science, Bologna, 1996."},{"issue":"5","key":"46_CR13","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1007\/BF01407903","volume":"16","author":"M.G. Main","year":"1987","unstructured":"M.G. Main. Trace, Failure and Testing Equivalences for Communicating Processes. Int. Journal of Parallel Programming, 16(5):383\u2013400, 1987.","journal-title":"Int. Journal of Parallel Programming"},{"key":"46_CR14","unstructured":"R. Milner. Communication and Concurrency. Prentice Hall International, 1989."},{"key":"46_CR15","doi-asserted-by":"crossref","unstructured":"R. Milner, D. Sangiorgi. Barbed Bisimulation. Proceedings of ICALP'92, LNCS 623, Springer, 1992.","DOI":"10.1007\/3-540-55719-9_114"},{"key":"46_CR16","unstructured":"J.-H. Morris. Lambda Calculus Models of Programming Languages. Ph.D. Thesis, MIT, 1968."},{"key":"46_CR17","doi-asserted-by":"crossref","unstructured":"V. Natarajan, R. Cleaveland. Divergence and Fair Testing. Proceedings of ICALP'95, LNCS 944, pages 648\u2013659, Springer, 1995.","DOI":"10.1007\/3-540-60084-1_112"},{"key":"46_CR18","unstructured":"C.-H.L. Ong. Correspondence between operational and denotational semantics: the full abstraction problem for PCF. Handbook of Logic in Computer Science, vol.4, S. Abramsky, D.M. Gabbay and T.S.E. Maibaum, ed., Oxford Science Publ., 1995."},{"key":"46_CR19","series-title":"Technical Report DAIMI FN-19","volume-title":"A Structural Approach to Operational Semantics","author":"G.D. Plotkin","year":"1981","unstructured":"G.D. Plotkin. A Structural Approach to Operational Semantics. Technical Report DAIMI FN-19, Aarhus University, Dept. of Computer Science, Aarhus, 1981."},{"key":"46_CR20","doi-asserted-by":"crossref","unstructured":"J.H. Reppy. Concurrent ML: Design, application and semantics. Proceedings of Functional Programming, Concurrency, Simulation and Automata Reasoning, LNCS 693, pages 165\u2013198, Springer, 1993.","DOI":"10.1007\/3-540-56883-2_10"},{"key":"46_CR21","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1007\/BF00276021","volume":"26","author":"W. Vogler","year":"1989","unstructured":"W. Vogler. Failures Semantics and Deadlocking of Modular Petri Nets. Acta Informatica, 26:333\u2013348, 1989.","journal-title":"Acta Informatica"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-63165-8_204.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,20]],"date-time":"2024-04-20T18:07:18Z","timestamp":1713636438000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-63165-8_204"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540631651","9783540691945"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/3-540-63165-8_204","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}