{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:18:40Z","timestamp":1725664720795},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540602491"},{"type":"electronic","value":"9783540447702"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-60249-6_46","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T17:58:24Z","timestamp":1330279104000},"page":"136-145","source":"Crossref","is-referenced-by-count":0,"title":["Processes with multiple entries and exits"],"prefix":"10.1007","author":[{"given":"J. A.","family":"Bergstra","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gh.","family":"\u015etefaonescu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,30]]},"reference":[{"key":"9_CR1","doi-asserted-by":"crossref","unstructured":"J.C.M. Baeten and J.A. Bergstra. Graph isomorphism models for noninterleaving process algebra. In: Proceedings of ACP94 (Eds. A. Ponse, C. Verhoef and S.F.M. van Vlijmen), 299\u2013318. Workshops in Computing, Springer-Verlag, 1995.","DOI":"10.1007\/978-1-4471-2120-6_13"},{"key":"9_CR2","unstructured":"J.C.M. Baeten, J.A. Bergstra and Gh. Stefanescu. Process algebra with feedback. In: Proceedings of the workshop: Three Days of Bisimulation (Eds. A. Ponse, M. de Rijke and Y. Venema). To appear as: CSLI volume, Stanford, 1995."},{"key":"9_CR3","doi-asserted-by":"crossref","unstructured":"J. Baeten and W. Weijland. Process algebra. Cambridge University Press, 1990.","DOI":"10.1017\/CBO9780511624193"},{"key":"9_CR4","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1093\/comjnl\/37.4.243","volume":"37","author":"J.A. Bergstra","year":"1994","unstructured":"J.A. Bergstra, I. Bethke and A. Ponse. Process algebra with iteration and nesting. The Computer Journal, 37:243\u2013258, 1994.","journal-title":"The Computer Journal"},{"key":"9_CR5","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/S0019-9958(84)80025-X","volume":"60","author":"J.A. Bergstra","year":"1984","unstructured":"J.A. Bergstra and J.W. Klop. Proces algebra for synchronous communication. Information and Control, 60:109\u2013137, 1984.","journal-title":"Information and Control"},{"key":"9_CR6","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1016\/0020-0190(94)00165-0","volume":"52","author":"J.A. Bergstra","year":"1994","unstructured":"J.A. Bergstra and Gh. Stefanescu. Bisimulation is two-way simulation. Information Processing Letters, 52:285\u2013287, 1994.","journal-title":"Information Processing Letters"},{"key":"9_CR7","doi-asserted-by":"crossref","unstructured":"S.L. Bloom and Z. Esik. Iteration theories: the equational logic of iterative processes. EATCS Monographs in Theoretical Compputer Science, Springer Verlag, 1993.","DOI":"10.1007\/978-3-642-78034-9"},{"key":"9_CR8","doi-asserted-by":"crossref","first-page":"171","DOI":"10.3233\/FI-1990-13204","volume":"13","author":"V.E. Cazanescu","year":"1990","unstructured":"V.E. Cazanescu and Gh. Stefanescu. Towards a new algebraic foundation of flowchart scheme theory. Fundamenta Informaticae, 13:171\u2013210, 1990.","journal-title":"Fundamenta Informaticae"},{"key":"9_CR9","doi-asserted-by":"crossref","unstructured":"C.C. Elgot. Manadic computation and iterative algebraic theories. In Proceedings Logic Colloquium'73, pages 175\u2013230, North-Holland, 1975. Studies in Logic and the Foundations of Mathematics, Volume 80.","DOI":"10.1016\/S0049-237X(08)71949-9"},{"key":"9_CR10","doi-asserted-by":"crossref","unstructured":"S.C. Kleene. Representation of events in nerve nets and finite automata. In Automata Studies, pages 3\u201341. Princeton University Press, 1956.","DOI":"10.1515\/9781400882618-002"},{"key":"9_CR11","doi-asserted-by":"crossref","first-page":"794","DOI":"10.1145\/322154.322167","volume":"26","author":"R. Milner","year":"1979","unstructured":"R. Milner. Flowgraphs and flow algebra. Journal of the Association for Computing Machinery, 26:794\u2013818, 1979.","journal-title":"Journal of the Association for Computing Machinery"},{"key":"9_CR12","doi-asserted-by":"crossref","unstructured":"R. Milner. A calculus of communicating systems. LNCS 92, Springer, 1980.","DOI":"10.1007\/3-540-10235-3"},{"key":"9_CR13","doi-asserted-by":"crossref","unstructured":"D. Park. Concurrency and automata on infinite sequences. In Proceedings 5th GI Conference, 167\u2013183. LNCS 104, Springer Verlag, 1981.","DOI":"10.1007\/BFb0017309"},{"key":"9_CR14","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1006\/inco.1993.1061","volume":"107","author":"J. Parrow","year":"1993","unstructured":"J. Parrow. Structural and behavioural equivalence of networks. Information and Computation, 107:58\u201390, 1993.","journal-title":"Information and Computation"},{"key":"9_CR15","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/0022-0000(87)90011-0","volume":"35","author":"G. Stefanescu","year":"1987","unstructured":"Gh. Stefanescu. On flowchart theories. Part I: The deterministic case. Journal of Computer and System Sciences, 35:163\u2013191, 1987.","journal-title":"Journal of Computer and System Sciences"},{"key":"9_CR16","unstructured":"Gh. Stefanescu. Feedback theories (a calculus for isomorphism classes of flowchart schemes). INCREST Preprint No. 24, Bucharest, April 1986. Also in: Revue Roumaine de Mathematiques Pures et Applique, 35:73\u201379, 1990."},{"key":"9_CR17","unstructured":"Gh. Stefanescu. Algebra of Flownomials. Part 1: Binary flownomials; Basic Theory. Report TUM-I9437, Technical University Munich, 1994."}],"container-title":["Lecture Notes in Computer Science","Fundamentals of Computation Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-60249-6_46.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,31]],"date-time":"2021-12-31T09:34:37Z","timestamp":1640943277000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-60249-6_46"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540602491","9783540447702"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-60249-6_46","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}