{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:21:02Z","timestamp":1725456062458},"publisher-location":"Berlin\/Heidelberg","reference-count":8,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"354055789X"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0023774","type":"book-chapter","created":{"date-parts":[[2005,11,19]],"date-time":"2005-11-19T10:11:10Z","timestamp":1132395070000},"page":"278-292","source":"Crossref","is-referenced-by-count":0,"title":["A fragment of first order logic adequate for observation equivalence"],"prefix":"10.1007","author":[{"given":"Halit","family":"O\u00afguzt\u00fcz\u00fcn","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"21_CR1","first-page":"97","volume-title":"Lecture Notes in Computer Science 154 (Proc. ICALP)","author":"S.D. Brookes","year":"1983","unstructured":"S.D. Brookes, W.C. Rounds: Behavioral equivalence relations induced by programming logics. Lecture Notes in Computer Science 154 (Proc. ICALP), Berlin: Springer-Verlag, 1983, pp. 97\u2013108"},{"key":"21_CR2","doi-asserted-by":"crossref","first-page":"129","DOI":"10.4064\/fm-49-2-129-141","volume":"XLIX","author":"A. Ehrenfeucht","year":"1961","unstructured":"A. Ehrenfeucht: An application of games to the completeness problem for formalized theories. Fundamenta Mathematicae XLIX, 1961, pp. 129\u2013141","journal-title":"Fundamenta Mathematicae"},{"issue":"no.1","key":"21_CR3","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1145\/2455.2460","volume":"32","author":"M. Hennessy","year":"1985","unstructured":"M. Hennessy, R. Milner: Algebraic laws for nondeterminism and concurrency. Journal of the ACM 32, no. 1, January 1985, pp. 137\u2013161","journal-title":"Journal of the ACM"},{"key":"21_CR4","volume-title":"Lecture Notes in Computer Science 154","author":"R. Milner","year":"1980","unstructured":"R. Milner: A calculus of communicating systems. Lecture Notes in Computer Science 154, Berlin: Springer-Verlag, 1980"},{"key":"21_CR5","unstructured":"G.C. Nelson, H. O\u00afguzt\u00fcz\u00fcn: Characterization of finitely axiomatizable labelled transition trees. Submitted for publication"},{"key":"21_CR6","unstructured":"H. O\u00afguzt\u00fcz\u00fcn: A game characterization of the observational equivalence of processes (extended abstract). First Int. Conf. on Algebraic Methodology and Software Technology (AMAST), Iowa City, Iowa, May 22\u201324, 1989, pp. 195\u2013196"},{"key":"21_CR7","volume-title":"PhD Thesis","author":"H. O\u00afguzt\u00fcz\u00fcn","year":"1991","unstructured":"H. O\u00afguzt\u00fcz\u00fcn: A logical characterization of the observation equivalence of processes. PhD Thesis, University of Iowa, Iowa City, Iowa, August 1991"},{"key":"21_CR8","volume-title":"Linear Orderings","author":"J.G. Rosenstein","year":"1982","unstructured":"J.G. Rosenstein: Linear Orderings. New York: Academic Press, 1982"}],"container-title":["Lecture Notes in Computer Science","Computer Science Logic"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0023774.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T21:50:34Z","timestamp":1607550634000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0023774"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["354055789X"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/bfb0023774","relation":{},"subject":[]}}