{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,11]],"date-time":"2025-11-11T21:45:57Z","timestamp":1762897557446},"reference-count":34,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2001,3,1]],"date-time":"2001-03-01T00:00:00Z","timestamp":983404800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4521,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2001,3]]},"DOI":"10.1016\/s0304-3975(99)00123-1","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T16:01:16Z","timestamp":1027612876000},"page":"95-149","source":"Crossref","is-referenced-by-count":37,"title":["Quantales, finite observations and strong bisimulation"],"prefix":"10.1016","volume":"254","author":[{"given":"Pedro","family":"Resende","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(99)00123-1_BIB1","series-title":"Domain theory and the logic of observable properties, Ph.D. Thesis","author":"Abramsky","year":"1987"},{"key":"10.1016\/S0304-3975(99)00123-1_BIB2","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/0304-3975(87)90065-X","article-title":"Observation equivalence as a testing equivalence","volume":"53","author":"Abramsky","year":"1987","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(99)00123-1_BIB3","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1006\/inco.1991.9999","article-title":"A domain equation for bisimulation","volume":"92","author":"Abramsky","year":"1991","journal-title":"Inform. Comput."},{"key":"10.1016\/S0304-3975(99)00123-1_BIB4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0168-0072(91)90065-T","article-title":"Domain theory in logical form","volume":"51","author":"Abramsky","year":"1991","journal-title":"Ann. Pure Appl. Logic"},{"key":"10.1016\/S0304-3975(99)00123-1_BIB5","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1017\/S0960129500000189","article-title":"Quantales, observational logic and process semantics","volume":"3","author":"Abramsky","year":"1993","journal-title":"Math. Struct. Comput. Sci."},{"key":"10.1016\/S0304-3975(99)00123-1_BIB6","series-title":"Proc. TAPSOFT\u201993, Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1007\/3-540-56610-4_60","article-title":"Verification and comparison of transition systems","author":"Arnold","year":"1993"},{"key":"10.1016\/S0304-3975(99)00123-1_BIB7","doi-asserted-by":"crossref","unstructured":"B. Bloom, S. Istrail, A.R. Meyer, Bisimulation can't be traced (preliminary report), in: Conf. Record of the 15th ACM Symp. on Principles of Programming Languages, 1988, pp. 229\u2013239.","DOI":"10.1145\/73560.73580"},{"key":"10.1016\/S0304-3975(99)00123-1_BIB8","doi-asserted-by":"crossref","first-page":"232","DOI":"10.1145\/200836.200876","article-title":"Bisimulation can't be traced","volume":"42","author":"Bloom","year":"1995","journal-title":"J. ACM"},{"key":"10.1016\/S0304-3975(99)00123-1_BIB9","series-title":"Introduction to Lattices and Order","author":"Davey","year":"1990"},{"key":"10.1016\/S0304-3975(99)00123-1_BIB10","first-page":"278","article-title":"The linear time \u2014 branching time spectrum","volume":"Vol. 458","author":"van Glabbeek","year":"1990"},{"key":"10.1016\/S0304-3975(99)00123-1_BIB11","first-page":"66","article-title":"The linear time-branching time spectrum II; the semantics of sequential systems with silent moves, Tech. Report, Stanford University, 1993. Extended abstract","volume":"Vol. 715","author":"van Glabbeek","year":"1993"},{"key":"10.1016\/S0304-3975(99)00123-1_BIB12","first-page":"224","article-title":"Petri net models for algebraic theories of concurrency","volume":"Vol. 259","author":"van Glabbeek","year":"1987"},{"key":"10.1016\/S0304-3975(99)00123-1_BIB13","doi-asserted-by":"crossref","first-page":"555","DOI":"10.1145\/233551.233556","article-title":"Branching time and abstraction in bisimulation semantics","volume":"43","author":"van Glabbeek","year":"1996","journal-title":"J. ACM"},{"key":"10.1016\/S0304-3975(99)00123-1_BIB14","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1016\/0304-3975(93)90111-6","article-title":"Transition system specifications with negative premises","volume":"118","author":"Groote","year":"1993","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(99)00123-1_BIB15","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1016\/0890-5401(92)90013-6","article-title":"Structured operational semantics and bisimulation as a congruence","volume":"100","author":"Groote","year":"1992","journal-title":"Inform. Comput."},{"key":"10.1016\/S0304-3975(99)00123-1_BIB16","series-title":"Algebraic Theory of Processes","author":"Hennessy","year":"1988"},{"key":"10.1016\/S0304-3975(99)00123-1_BIB17","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1145\/2455.2460","article-title":"Algebraic laws for nondeterminism and concurrency","volume":"32","author":"Hennessy","year":"1985","journal-title":"J. ACM"},{"key":"10.1016\/S0304-3975(99)00123-1_BIB18","series-title":"Communicating Sequential Processes","author":"Hoare","year":"1985"},{"key":"10.1016\/S0304-3975(99)00123-1_BIB19","series-title":"Stone Spaces","author":"Johnstone","year":"1982"},{"key":"10.1016\/S0304-3975(99)00123-1_BIB20","doi-asserted-by":"crossref","unstructured":"A. Joyal, M. Tierney, An Extension of the Galois Theory of Grothendieck, Memoirs of the AMS, Vol. 309, American Mathematical Society, Providence, RI, 1984.","DOI":"10.1090\/memo\/0309"},{"key":"10.1016\/S0304-3975(99)00123-1_BIB21","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0890-5401(91)90030-6","article-title":"Bisimulation through probabilistic testing","volume":"94","author":"Larsen","year":"1991","journal-title":"Inform. Comput."},{"key":"10.1016\/S0304-3975(99)00123-1_BIB22","series-title":"Categories for the Working Mathematician","author":"Mac Lane","year":"1971"},{"key":"10.1016\/S0304-3975(99)00123-1_BIB23","first-page":"25","article-title":"A modal characterisation of observable machine behaviour","volume":"Vol. 112","author":"Milner","year":"1981"},{"key":"10.1016\/S0304-3975(99)00123-1_BIB24","series-title":"Communication and Concurrency","author":"Milner","year":"1989"},{"key":"10.1016\/S0304-3975(99)00123-1_BIB25","unstructured":"C. Mulvey, & Rend. Circ. Mat. Palermo (2) Suppl. 12 (1986) 99\u2013104."},{"key":"10.1016\/S0304-3975(99)00123-1_BIB26","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/0304-3975(84)90113-0","article-title":"Testing equivalences for processes","volume":"34","author":"de Nicola","year":"1984","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(99)00123-1_BIB27","first-page":"167","article-title":"Concurrency and automata on infinite sequences","volume":"Vol. 104","author":"Park","year":"1981"},{"key":"10.1016\/S0304-3975(99)00123-1_BIB28","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1016\/0304-3975(87)90117-4","article-title":"Refusal testing","volume":"50","author":"Phillips","year":"1987","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(99)00123-1_BIB29","doi-asserted-by":"crossref","unstructured":"P. Resende, Observational system specification, in: R. Wieringa, R. Feenstra (Eds.), Selected Papers of ISCORE\u201994, World Scientific, Singapore, 1995, pp. 135\u2013151. Revised version available by ftp at cs.math.ist.utl.pt\/pub\/ResendeP\/94-R-iscore.ps.","DOI":"10.1142\/9789814532853"},{"key":"10.1016\/S0304-3975(99)00123-1_BIB30","unstructured":"P. Resende, Tropological systems and observational logic in concurrency and specification, Ph.D. Thesis, Universidade T\u00e9cnica de Lisboa, 1997."},{"key":"10.1016\/S0304-3975(99)00123-1_BIB31","first-page":"307","article-title":"Modular specification of concurrent systems with observational logic","volume":"Vol. 1589","author":"Resende","year":"1999"},{"key":"10.1016\/S0304-3975(99)00123-1_BIB32","series-title":"Quantales and their Applications","author":"Rosenthal","year":"1990"},{"key":"10.1016\/S0304-3975(99)00123-1_BIB33","series-title":"Topology Via Logic","author":"Vickers","year":"1989"},{"key":"10.1016\/S0304-3975(99)00123-1_BIB34","doi-asserted-by":"crossref","unstructured":"G. Winskel, M. Nielsen, Models for concurrency, in: Handbook of Logic in Computer Science, Vol. 4, Oxford University Press, Oxford, 1995. A draft appeared as BRICS Report RS-94-12, 1994.","DOI":"10.7146\/brics.v1i12.21658"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397599001231?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397599001231?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,15]],"date-time":"2020-01-15T17:22:06Z","timestamp":1579108926000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397599001231"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,3]]},"references-count":34,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2001,3]]}},"alternative-id":["S0304397599001231"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(99)00123-1","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2001,3]]}}}