{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:52:56Z","timestamp":1725663176869},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540514862"},{"type":"electronic","value":"9783540481768"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1989]]},"DOI":"10.1007\/3-540-51486-4_55","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T20:58:18Z","timestamp":1330203498000},"page":"35-48","source":"Crossref","is-referenced-by-count":5,"title":["A thesis for bounded concurrency"],"prefix":"10.1007","author":[{"given":"David","family":"Harel","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,25]]},"reference":[{"key":"3_CR1","series-title":"Technical Report","volume-title":"Decidability and Expressiveness of Logics of Processes","author":"K. Abrahamson","year":"1980","unstructured":"Abrahamson, K., \u201cDecidability and Expressiveness of Logics of Processes\u201d, Ph.D. Thesis, Technical Report 80-08-01, Dept. of Computer Science, Univ. of Washington, Seattle, 1980."},{"key":"3_CR2","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1145\/322234.322243","volume":"28","author":"A. K. Chandra","year":"1981","unstructured":"Chandra, A.K., D. Kozen, and L. J. Stockmeyer, \u201cAlternation\u201d, J. Assoc. Comput. Mach. 28 (1981), 114\u2013133.","journal-title":"J. Assoc. Comput. Mach."},{"key":"3_CR3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/5001.5390","volume":"8","author":"K. L. Clark","year":"1986","unstructured":"Clark, K.L., and Gregory, S., \u201cPARLOG: Parallel Programming in Logic\u201d, ACM Trans. on Prog. Lang. Syst. 8 (1986), 1\u201349.","journal-title":"ACM Trans. on Prog. Lang. Syst."},{"key":"3_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1007\/3-540-50403-6_34","volume-title":"Proc. Concurrency '88","author":"D. Drusinsky","year":"1988","unstructured":"Drusinsky, D. and D. Harel, \u201cOn the Power of Bounded Concurrency I: The Finite Automata Level\u201d, submitted, 1989 (Preliminary version appeared as \u201cOn the Power of Cooperative Concurrency\u201d, in Proc. Concurrency '88, Lecture Notes in Computer Science 335, Springer-Verlag, Hamburg, FRG, pp. 74\u2013103, 1988.)"},{"key":"3_CR5","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1016\/S0022-0000(76)80034-7","volume":"12","author":"A. Ehrenfeucht","year":"1976","unstructured":"Ehrenfeucht, A. and P. Zeiger, \u201cComplexity Measures for Regular Expressions\u201d, J. Comput. Syst. Sci. 12 (1976), 134\u2013146.","journal-title":"J. Comput. Syst. Sci."},{"key":"3_CR6","doi-asserted-by":"crossref","first-page":"194","DOI":"10.1016\/0022-0000(79)90046-1","volume":"18","author":"M. J. Fischer","year":"1979","unstructured":"Fischer, M. J. and R. E. Ladner, \u201cPropositional Dynamic Logic of Regular Programs\u201d, J. Comput. Syst. Sci. 18 (1979), 194\u2013211.","journal-title":"J. Comput. Syst. Sci."},{"key":"3_CR7","doi-asserted-by":"crossref","unstructured":"Harel, D., \u201cDynamic Logic\u201d, In Handbook of Philosophical Logic Vol. II (D. Gabbay and F. Guenthner, eds.), Reidel Publishing Co., pp. 497\u2013604, 1984.","DOI":"10.1007\/978-94-009-6259-0_10"},{"key":"3_CR8","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/0167-6423(87)90035-9","volume":"8","author":"D. Harel","year":"1987","unstructured":"Harel, D., \u201cStatecharts: A Visual Formalism for Complex Systems\u201d, Science of Comput. Prog. 8, (1987), 231\u2013274. (Also, CS84-05, The Weizmann Institute of Science, Rehovot, Israel, February 1984, and in revised form, CS86-02, March 1986.)","journal-title":"Science of Comput. Prog."},{"key":"3_CR9","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/S0019-9958(85)80047-4","volume":"64","author":"D. Harel","year":"1985","unstructured":"Harel, D. and R. Sherman, \u201cPropositional Dynamic Logic of Flowcharts\u201d, Inf. and Cont. 64 (1985), 119\u2013135.","journal-title":"Inf. and Cont."},{"key":"3_CR10","doi-asserted-by":"crossref","unstructured":"Hirst, T. and D. Harel, \u201cOn the Power of Bounded Concurrency II: The Pushdown Automata Level\u201d, submitted, 1989.","DOI":"10.1007\/3-540-52590-4_37"},{"key":"3_CR11","volume-title":"Succinctness Results for Statecharts","author":"T. Hirst","year":"1989","unstructured":"Hirst, T., \u201cSuccinctness Results for Statecharts\u201d, M.Sc. Thesis, Bar-Ilan University, Ramat Gan, Israel, 1989 (in Hebrew)."},{"key":"3_CR12","first-page":"666","volume":"21","author":"C. A. R. R. Hoare","year":"1978","unstructured":"Hoare C.A.R., \u201cCommunicating Sequential Processes\u201d, Comm. Assoc. Comput. Mach. 21, (1978), 666\u2013677.","journal-title":"Comm. Assoc. Comput. Mach."},{"key":"3_CR13","volume-title":"Handbook of Theoretical Computer Science","author":"D. Kozen","year":"1989","unstructured":"Kozen, D. and J. Tiuryn, \u201cLogics of Programs\u201d, In Handbook of Theoretical Computer Science (J. van Leeuwen, ed.), North Holand, Amsterdam, 1989, to appear."},{"key":"3_CR14","doi-asserted-by":"crossref","unstructured":"Meyer, A. R. and M. J. Fischer, \u201cEconomy of Description by Automata, Grammars, and Formal Systems\u201d, Proc. 12th IEEE Symp. on Switching and Automata Theory, 1971, pp. 188\u2013191.","DOI":"10.1109\/SWAT.1971.11"},{"key":"3_CR15","series-title":"Lect. Notes in Comput. Sci.","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-10235-3","volume-title":"A Calculus of Communicating Systems","author":"R. Milner","year":"1980","unstructured":"Milner, R., A Calculus of Communicating Systems, Lect. Notes in Comput. Sci., Vol. 94, Springer-Verlag, New York, 1980."},{"key":"3_CR16","series-title":"Lect. Notes in Comput. Sci.","first-page":"387","volume-title":"Workshop on Logics of Programs","author":"V. R. Pratt","year":"1981","unstructured":"Pratt, V. R., \u201cUsing Graphs to Understand PDL\u201d, Workshop on Logics of Programs (D. Kozen, ed.), Lect. Notes in Comput. Sci., Vol 131, Springer-Verlag, New York, 1981, pp. 387\u2013396."},{"key":"3_CR17","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-69968-9","volume-title":"Petri Nets: An Introduction","author":"W. Reisig","year":"1985","unstructured":"Reisig W., Petri Nets: An Introduction, Springer-Verlag, Berlin, 1985."},{"key":"3_CR18","doi-asserted-by":"crossref","unstructured":"Safra, S., \u201cOn the Complexity of \u03b8-automata\u201d, Proc. 29th IEEE Symp. on Found. of Comput. Sci., 1988, pp. 319\u2013327.","DOI":"10.1109\/SFCS.1988.21948"},{"issue":"8","key":"3_CR19","doi-asserted-by":"crossref","first-page":"44","DOI":"10.1109\/MC.1986.1663307","volume":"19","author":"E. Shapiro","year":"1986","unstructured":"Shapiro, E., \u201cConcurrent Prolog: A Progress Report\u201d, IEEE Computer 19:8 (1986), 44\u201358.","journal-title":"IEEE Computer"},{"key":"3_CR20","doi-asserted-by":"crossref","unstructured":"Vardi, M. and L. Stockmeyer, \u201cImproved Upper and Lower Bounds for Modal Logics of Programs\u201d, Proc. 17th ACM Symp. Theory of Comput., 1985, pp. 240\u2013251.","DOI":"10.1145\/22145.22173"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1989"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-51486-4_55.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:21:19Z","timestamp":1605648079000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-51486-4_55"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989]]},"ISBN":["9783540514862","9783540481768"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/3-540-51486-4_55","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1989]]}}}