{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:12:02Z","timestamp":1725664322394},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540585206"},{"type":"electronic","value":"9783540490302"}],"license":[{"start":{"date-parts":[[1994,1,1]],"date-time":"1994-01-01T00:00:00Z","timestamp":757382400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-58520-6_78","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T16:35:08Z","timestamp":1330274108000},"page":"379-394","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Synthesis algorithm for recursive processes by \u03bc-calculus"],"prefix":"10.1007","author":[{"given":"Shigetomo","family":"Kimura","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Atsushi","family":"Togashi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Norio","family":"Shiratori","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,3]]},"reference":[{"key":"33_CR1","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/0890-5401(87)90052-6","volume":"75","author":"D. Angluin","year":"1987","unstructured":"Angluin, D.: \u201cLearning Regular Sets from Queries and Counterexamples\u201d, Inf. and Comput, 75, pp. 87\u2013106 (1987).","journal-title":"Inf. and Comput"},{"issue":"3","key":"33_CR2","doi-asserted-by":"crossref","first-page":"560","DOI":"10.1145\/828.833","volume":"31","author":"S.D. Brookes","year":"1984","unstructured":"Brookes, S.D., C.A.R Hoare and A.W. Roscoe: \u201cA Theory of Communicating Sequential Processes\u201d, J. ACM., 31, 3, pp. 560\u2013599 (1984).","journal-title":"J. ACM."},{"key":"33_CR3","unstructured":"Clocksin, W.F. and C.S. Mellish: \u201cProgramming in Prolog\u201d, Springer-Verlag(1981)."},{"key":"33_CR4","unstructured":"Fantechi, A., S. Gnesi S. and G. Ristori: \u201cCompositional Logic Semantics and LOTOS\u201d, Protocol Specification, Testing and Verification, XL., IFIP, pp. 365\u2013378"},{"key":"33_CR5","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1016\/S0019-9958(86)80038-9","volume":"68","author":"S. Graf","year":"1986","unstructured":"Graf, S. and J. Sifakis: \u201cA Logic for the Description of Non-deterministic Programs and Their Properties\u201d, Inf. and contr., 68, pp. 254\u2013270 (1986)","journal-title":"Inf. and contr."},{"issue":"1","key":"33_CR6","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1145\/2455.2460","volume":"32","author":"M. Hennessy","year":"1985","unstructured":"Hennessy, M. and R. Milner: \u201cAlgebraic Laws for Nondeterminism and Concurrency\u201d, J. ACM., 32, 1, pp. 137\u2013161 (1985).","journal-title":"J. ACM."},{"key":"33_CR7","unstructured":"Hennessy, M.: \u201cAlgebraic Theory of Processes\u201d, The MIT Press(1988)."},{"key":"33_CR8","unstructured":"Hindley, J.R. and J.P. Seldin: \u201cIntroduction to Combinators and \u03bb-Calculus\u201d, London Mathematical Society Student Texts 1, Cambridge Univ. Press(1986)."},{"key":"33_CR9","doi-asserted-by":"crossref","unstructured":"Hoare, C.A.R.: \u201cCommunicating Sequential Process\u201d, Prentice Hall(1985).","DOI":"10.1007\/978-3-642-82921-5_4"},{"key":"33_CR10","unstructured":"Kimura, S., A. Togashi and S. Noguchi: \u201cA Synthesis Algorithm of Basic Processes by Modal Formulas\u201d (in Japanese), Trans. IEICE, J75-D-I, pp. 1048\u20131061 (1992)."},{"key":"33_CR11","unstructured":"Kimura, S., A. Togashi and N. Shiratori: \u201cSynthesis Algorithm for Recursive Processes by \u03bc-calculus\u201d, preprint."},{"key":"33_CR12","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1016\/0304-3975(82)90125-6","volume":"27","author":"D. Kozen","year":"1983","unstructured":"Kozen, D.: \u201cResults on the Propositional \u03bc-calculus\u201d, Theoret. Comput. Sci., 27, pp. 333\u2013354 (1983).","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"33_CR13","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1145\/357233.357237","volume":"6","author":"Z. Manna","year":"1984","unstructured":"Manna, Z. and P. Wolper: \u201cSynthesis of Communicating Processes from Temporal Logic Specifications\u201d, ACM Trans. on Programming Languages and Systems, 6, 1, pp. 68\u201393 (1984).","journal-title":"ACM Trans. on Programming Languages and Systems"},{"key":"33_CR14","unstructured":"Milner, R.: \u201cCommunication and Concurrency\u201d, Prentice-Hall(1989)."},{"key":"33_CR15","unstructured":"Park, D.: \u201cConcurrency and automata on infinite sequences\u201d, Lecture Notes in Comput. Sci. 104, pp. 167\u2013183, Springer-Verlag(1981)."},{"key":"33_CR16","first-page":"295","volume":"XL","author":"R. Gotzhein","year":"1990","unstructured":"Gotzhein, R.: \u201cSpecifying Communication Services With Temporal Logic\u201d, Protocol Specification, Testing and Verification, XL, pp. 295\u2013309 (1990).","journal-title":"Protocol Specification, Testing and Verification"},{"key":"33_CR17","unstructured":"van Glabbeek, R.J.: \u201cThe Linear Time \u2014 Branching Time Spectrum\u201d, Lecture Notes in Comput. Sci. 458, Springer-Verlag(1990)."},{"key":"33_CR18","unstructured":"Shapiro, E.Y.: \u201cInductive Inference of Theories From Facts\u201d, Technical Report 192, Yale Univ(1981)."},{"key":"33_CR19","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/0304-3975(85)90129-X","volume":"39","author":"C. Stirling","year":"1985","unstructured":"Stirling, C.: \u201cA Proof-Theoretic Characterization of Observational Equivalence\u201d, Theoretical Computer Science, 39, pp. 27\u201345 (1985).","journal-title":"Theoretical Computer Science"},{"key":"33_CR20","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1016\/0304-3975(87)90012-0","volume":"49","author":"C. Stirling","year":"1987","unstructured":"Stirling, C.: \u201cModal Logics For Communicating Systems\u201d, Theoretical Computer Science, 49, pp. 311\u2013347 (1987).","journal-title":"Theoretical Computer Science"},{"key":"33_CR21","unstructured":"Stirling, C.: \u201cAn Introduction to Modal and Temporal Logics for CCS\u201d, Lecture Notes in Comput. Sci. 491, Springer-Verlag, pp. 2\u201320 (1991)."},{"key":"33_CR22","unstructured":"Streett, R.S. and E.A. Emerson: \u201cAn Automata Theoretic Decision Procedure for the Propositional Mu-Calculus\u201d, Info. and Comput. 81, Academic Press, pp. 249\u2013264 (1989)."}],"container-title":["Lecture Notes in Computer Science","Algorithmic Learning Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-58520-6_78","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,31]],"date-time":"2021-12-31T08:03:06Z","timestamp":1640937786000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-58520-6_78"}},"subtitle":["Extended abstract"],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540585206","9783540490302"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/3-540-58520-6_78","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]},"assertion":[{"value":"3 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}