{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:08:23Z","timestamp":1725664103018},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540600435"},{"type":"electronic","value":"9783540494102"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-60043-4_55","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T17:32:46Z","timestamp":1330277566000},"page":"214-229","source":"Crossref","is-referenced-by-count":0,"title":["Context-free event domains are recognizable"],"prefix":"10.1007","author":[{"given":"Eric","family":"Badouel","sequence":"first","affiliation":[]},{"given":"Philippe","family":"Darondeau","sequence":"additional","affiliation":[]},{"given":"Jean -Claude","family":"Raoult","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,7,25]]},"reference":[{"key":"13_CR1","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/0304-3975(87)90052-1","volume":"51","author":"J.C.M. Baeten","year":"1987","unstructured":"Baeten, J.C.M., Bergstra, J.A., and Klop, J.W., On the consistency of Koomen's fair abstraction rule, Theoretical Computer Science, 51 (1987) 129\u2013176.","journal-title":"Theoretical Computer Science"},{"key":"13_CR2","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1007\/3-540-17945-3_5","volume":"259","author":"J.C.M. Baeten","year":"1987","unstructured":"Baeten, J.C.M., Bergstra, J.A., and Klop, J.W., Decidability of bisimulation equivalence for processes generating context-free languages, Parle 87, Lecture Notes in Computer Science 259 (1987) 94\u2013111.","journal-title":"Parle 87, Lecture Notes in Computer Science"},{"key":"13_CR3","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/3-540-56596-5_27","volume":"666","author":"E. Badouel","year":"1993","unstructured":"Badouel, E., and Darondeau, Ph., Trace Nets. REX Workshop \u201cSemantics: Foundations and Applications\u201d, Lecture Notes in Computer Science 666 (1993) 21\u201350.","journal-title":"Lecture Notes in Computer Science"},{"key":"13_CR4","volume-title":"Graphs and Hypergraphs","author":"C. Berge","year":"1973","unstructured":"Berge, C.Graphs and Hypergraphs. North-Holland, Amsterdam (1973)."},{"key":"13_CR5","unstructured":"B\u00fcchi, J.R., On a decision method in restricted second order arithmetic, in: E. Nagel et al., eds., proceedings of the International Congress on Logic, Methodology and Philosophy of Science, Stanford University Press (1960) 1\u201311."},{"key":"13_CR6","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/0304-3975(92)90278-N","volume":"106","author":"D. Caucal","year":"1992","unstructured":"Caucal, D., On the Regular Structure of Prefix Rewriting, Theoretical Computer Science 106 (1992) 61\u201386.","journal-title":"Theoretical Computer Science"},{"key":"13_CR7","first-page":"193","volume-title":"Handbook of Theoretical Computer Science, vol. B","author":"B. Courcelle","year":"1990","unstructured":"Courcelle, B., Graph rewriting: An algebraic and logic approach, in: Handbook of Theoretical Computer Science, vol. B (J.v. Leeuwen, ed.), Elsevier, Amsterdam (1990) 193\u2013242."},{"key":"13_CR8","unstructured":"Curien, P.L., Categorical combinators, Sequential algorithms and functional programming, Research notes in Theoretical Computer Science (1986)."},{"key":"13_CR9","unstructured":"de Simone, R., Calculabilit\u00e9 et expressivit\u00e9 dans l'alg\u00e8bre de processus MEIJE, Th\u00e8se de 3\u00e8me Cycle, Paris VII (1984)."},{"key":"13_CR10","first-page":"39","volume":"XIV","author":"U. Goltz","year":"1991","unstructured":"Goltz, U., and Loogen, R., Modelling nondeterministic concurrent processes with event structures, Fundamenta Informaticae XIV (1991) 39\u201374.","journal-title":"Fundamenta Informaticae"},{"key":"13_CR11","unstructured":"Habel, A., Hyperedge replacement: Grammars and languages. Thesis, Bremen (1989)."},{"key":"13_CR12","doi-asserted-by":"crossref","unstructured":"Herwig, B., Extending Partial Isomorphisms on Finite Structures, to appear in Combinatorica (1994).","DOI":"10.1007\/BF01299742"},{"key":"13_CR13","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1007\/BF01305233","volume":"12","author":"E. Hrushovski","year":"1992","unstructured":"Hrushovski, E., Extending Partial Isomorphisms of Graphs, Combinatorica 12 (1992), 411\u2013416.","journal-title":"Combinatorica"},{"key":"13_CR14","unstructured":"Lascar, D., A note on a theorem of Hrushovski, Unpublished note, may be asked to the author: lascar@logique.jussieu.fr (1994)."},{"key":"13_CR15","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/0304-3975(85)90087-8","volume":"37","author":"D. Muller","year":"1985","unstructured":"Muller, D., and Schupp, P., The Theory of Ends, Pushdown Automata, and Second Order Logic, Theoretical Computer Science 37 (1985) 51\u201375.","journal-title":"Theoretical Computer Science"},{"key":"13_CR16","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/0304-3975(92)90181-E","volume":"96","author":"M. Mukund","year":"1992","unstructured":"Mukund, M., and Thiagarajan, P.S., A logical characterization of well branching event structures, Theoretical Computer Science 96 (1992) 35\u201372.","journal-title":"Theoretical Computer Science"},{"key":"13_CR17","unstructured":"Nielsen, M., and Winskel, G., Categories of Models for Concurrency, Handbook of Logic in Computer Science, Oxford (1993)."},{"key":"13_CR18","doi-asserted-by":"crossref","unstructured":"Penczek, W., A Temporal Logic for Event Structures, Fundamenta Informaticae XI (1988).","DOI":"10.3233\/FI-1988-11307"},{"key":"13_CR19","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1016\/0304-3975(77)90045-7","volume":"5","author":"M.B. Smyth","year":"1977","unstructured":"Smyth, M.B., Effectively given domains, Theoretical Computer Science 5 (1977) 257\u2013274.","journal-title":"Theoretical Computer Science"},{"key":"13_CR20","doi-asserted-by":"crossref","unstructured":"Stark, E. W., Connections between a Concrete and an Abstract Model of Concurrent Systems, 5th Mathematical Foundations of Programming Semantics (1989) 53\u201379.","DOI":"10.1007\/BFb0040254"},{"key":"13_CR21","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1007\/BFb0018344","volume":"389","author":"E.W. Stark","year":"1989","unstructured":"Stark, E.W., Compositional Relational Semantics for Indeterminate Dataflow Networks. Summer Conference on Category Theory and Computer Science, Springer-Verlag Lecture Notes in Computer Science 389 (1989) 52\u201374.","journal-title":"Springer-Verlag Lecture Notes in Computer Science"},{"key":"13_CR22","doi-asserted-by":"crossref","first-page":"609","DOI":"10.1007\/3-540-56596-5_49","volume":"666","author":"F.W. Vaandrager","year":"1993","unstructured":"Vaandrager, F.W., Expressiveness Results for Process Algebras, REX Workshop \u201cSemantics: Foundations and Applications\u201d, Lecture Notes in Computer Science 666 (1993) 609\u2013638.","journal-title":"Lecture Notes in Computer Science"},{"key":"13_CR23","unstructured":"Winskel, G., Events in Computations. Ph.D thesis, University of Edinburgh (1980)."},{"key":"13_CR24","doi-asserted-by":"crossref","first-page":"364","DOI":"10.1007\/BFb0013026","volume":"354","author":"G. Winskel","year":"1988","unstructured":"Winskel, G., An Introduction to Event Structures. in REX school \u201cLinear Time, Branching Time and Partial Order in Logics and Models for Concurrency\u201d, Noordwijkerhout, Lecture Notes in Computer Science 354 (1988) 364\u2013397.","journal-title":"Noordwijkerhout, Lecture Notes in Computer Science"}],"container-title":["Lecture Notes in Computer Science","Algebraic Methodology and Software Technology"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-60043-4_55.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,31]],"date-time":"2021-12-31T09:20:22Z","timestamp":1640942422000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-60043-4_55"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540600435","9783540494102"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/3-540-60043-4_55","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}