{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,30]],"date-time":"2025-12-30T23:48:45Z","timestamp":1767138525679,"version":"build-2238731810"},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783662232064","type":"print"},{"value":"9783662252093","type":"electronic"}],"license":[{"start":{"date-parts":[[1991,1,1]],"date-time":"1991-01-01T00:00:00Z","timestamp":662688000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1991]]},"DOI":"10.1007\/978-3-662-25209-3_20","type":"book-chapter","created":{"date-parts":[[2013,8,21]],"date-time":"2013-08-21T05:33:51Z","timestamp":1377063231000},"page":"288-303","source":"Crossref","is-referenced-by-count":9,"title":["Parallel complexity in the design and analysis of concurrent systems"],"prefix":"10.1007","author":[{"given":"Carme","family":"\u00c0lvarez","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jos\u00e9 L.","family":"Balc\u00e1zar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joaquim","family":"Gabarr\u00f3","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mikl\u00f3s","family":"S\u00e1ntha","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"20_CR1","volume-title":"Addison-Wesley","author":"A Aho","year":"1975","unstructured":"Aho, A., Hoperoft, J., Ullman, J.: The Design and Analysis of Computer Algorithms. Addison-Wesley (1975)."},{"key":"20_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0168-0072(83)90038-6","volume":"24","author":"M Ajtai","year":"1983","unstructured":"Ajtai, M.: El-formulae on finite structures. Ann. Pure Appl. Logic 24, 1 - 48 (1983).","journal-title":"Ann. Pure Appl. Logic"},{"key":"20_CR3","unstructured":"Alvarez, C., Gabarr\u00f3, J.: The parallel complexity of two problems on concurrency. To appear at IPL."},{"key":"20_CR4","doi-asserted-by":"crossref","unstructured":"Balcazar, J.L., Diaz, J., Gabarr\u00f3, J.: Structural Complexity I. Springer Verlag EATCS Monographs in Theoretical Computer Science, v. 11 (1988).","DOI":"10.1007\/978-3-642-97062-7"},{"key":"20_CR5","unstructured":"Balc\u00e2zar, J., Gabarr\u00f3, J., S\u00e2ntha, M.: Deciding bisimilarity is P-complete. Report LSI90-25, Universitat Polit\u00e8cnica de Catalunya. Submitted for publication."},{"key":"20_CR6","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1016\/0022-0000(90)90022-D","volume":"41","author":"DM Barrington","year":"1990","unstructured":"Barrington, D.M., Immerman, N., Straubing, H.: On uniformity within NC 1 . J. Comp. Syst. Sci. 41, 274 - 306 (1990).","journal-title":"J. Comp. Syst. Sci"},{"issue":"2","key":"20_CR7","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1137\/0213028","volume":"13","author":"AK Chandra","year":"1984","unstructured":"Chandra, A.K., Stockmeyer, L., Vishkin, U.: Constant depth reducibility. SIAM J. Comput. 13, 2, 423 - 439 (1984).","journal-title":"SIAM J. Comput."},{"key":"20_CR8","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1051\/ita\/1985190100211","volume":"19","author":"R Cori","year":"1985","unstructured":"Cori, R., Perrin, D.: Automates et commutations partielles. RAIRO Inf. Theor. 19, 21 - 31 (1985).","journal-title":"RAIRO Inf. Theor."},{"key":"20_CR9","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/BF01744431","volume":"17","author":"M Furst","year":"1984","unstructured":"Furst, M., Saxe, J.B., Sipser, M.: Parity, circuits and the polynomial time hierarchy. Math. Syst. Theory 17, 13 - 27 (1984).","journal-title":"Math. Syst. Theory"},{"key":"20_CR10","volume-title":"Cambridge University Press","author":"A Gibbons","year":"1988","unstructured":"Gibbons, A., Rytter, W.: Efficient Parallel Algorithms. Cambridge University Press (1988)."},{"key":"20_CR11","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/BF00289308","volume":"16","author":"Goldschlager","year":"1981","unstructured":"Goldschlager, L.: e-Productions in context-free grammars. Acta Informatica 16, 303 - 308 (1981).","journal-title":"Acta Informatica"},{"key":"20_CR12","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/BF01887207","volume":"1","author":"He Jifeng","year":"1989","unstructured":"He Jifeng: Process Simulation and Refinement. Formal Aspects of Computing 1, 229 - 241 (1989).","journal-title":"Formal Aspects of Computing"},{"key":"20_CR13","volume-title":"Manuscript","author":"HJ Hoover","year":"1984","unstructured":"Hoover, H.J., Ruzzo, W.L.: A Compendium of Problems Complete for P. Manuscript (1984)."},{"issue":"3","key":"20_CR14","doi-asserted-by":"publisher","first-page":"625","DOI":"10.1137\/0218043","volume":"18","author":"N Immerman","year":"1989","unstructured":"Immerman, N.: Expressibility and parallel complexity. SIAM T. Comput. 18, 3, 625 - 638 (1989).","journal-title":"SIAM T. Comput."},{"key":"20_CR15","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1016\/0890-5401(90)90025-D","volume":"86","author":"PC Kanellakis","year":"1990","unstructured":"Kanellakis, P.C., Smolka, S. A.: CCS expressions, finite state processes, and three problems of equivalence. Information and Computation 86, 202 - 241 (1990).","journal-title":"Information and Computation"},{"key":"20_CR16","volume-title":"Handbook of Theoretical Computer Science, (vol A), 869-941, editor Jan Van Leeuwen, Elsevier","author":"R Karp","year":"1990","unstructured":"Karp, R., Ramachandran, V.: Parallel Algorithms for Shared Memory Machines. In: Handbook of Theoretical Computer Science, (vol A), 869-941, editor Jan Van Leeuwen, Elsevier (1990)."},{"issue":"7","key":"20_CR17","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1145\/360248.360251","volume":"19","author":"RM Keller","year":"1976","unstructured":"Keller, R.M.: Formal Verification of Parallel Programs. Comm. ACM, 19, 7, 371 - 384 (1976).","journal-title":"Comm. ACM"},{"key":"20_CR18","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1007\/BFb0013025","volume":"354","author":"A Mazurkiewicz","year":"1989","unstructured":"Mazurkiewicz, A: Basic notions of trace theory. Springer Verlag Lecture Notes in Computer Science 354, 285 - 363 (1989).","journal-title":"Springer Verlag Lecture Notes in Computer Science"},{"key":"20_CR19","doi-asserted-by":"crossref","unstructured":"Milner, R.: A Calculus of Communicating Systems. Springer Verlag Lecture Notes in Computer Science 92 (1980).","DOI":"10.1007\/3-540-10235-3"},{"key":"20_CR20","volume-title":"Prentice Hall","author":"Milner","year":"1989","unstructured":"Milner, R.: Communication and Concurrency. Prentice Hall (1989)."},{"key":"20_CR21","unstructured":"Milner, R.: A Complete Axiomatization for Observation Congruence of Finite-State Behaviours. Information and Computation."},{"key":"20_CR22","unstructured":"Miyano, S., Shiraishi, S., Shoudai, T.: A list of P-complete problems. Technical Report RIFIS-TR-CS-17, Kyushu University 33, 1989."},{"key":"20_CR23","volume-title":"Formal techniques in artificial intelligence, R.B","author":"I Parberry","year":"1990","unstructured":"Parberry, I.: A primer on the complexity theory of neural networks. In: Formal techniques in artificial intelligence, R.B. Banerji (editor), North-Holland (1990)."},{"key":"20_CR24","first-page":"168","volume":"104","author":"D Park","year":"1981","unstructured":"Park, D.: Concurrency and Automata on Infinite Sequences. Springer Verlag Lecture Notes in Computer Science 104, 168 - 183 (1981).","journal-title":"Springer Verlag Lecture Notes in Computer Science"},{"key":"20_CR25","volume-title":"Prentice-Hall","author":"Peterson","year":"1981","unstructured":"Peterson, J.L.: Petri net theory and the modeling of systems. Prentice-Hall (1981)."},{"issue":"2","key":"20_CR26","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1137\/0213027","volume":"13","author":"L Stockmeyer","year":"1984","unstructured":"Stockmeyer, L., Vishkin, U.: Simulation of parallel random access machines by circuits. SIAM J. Comput. 13, 2, 409 - 422 (1984).","journal-title":"SIAM J. Comput."},{"key":"20_CR27","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/BF01887209","volume":"1","author":"DJ Walker","year":"1989","unstructured":"Walker, D.J.: Automated Analysis of Mutual Exclusion Algorithms using CCS. Formal Aspects of Computing, 1, 273 - 292 (1989).","journal-title":"Formal Aspects of Computing"}],"container-title":["Lecture Notes in Computer Science","Parle \u201991 Parallel Architectures and Languages Europe"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-25209-3_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,16]],"date-time":"2019-05-16T15:11:52Z","timestamp":1558019512000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-25209-3_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991]]},"ISBN":["9783662232064","9783662252093"],"references-count":27,"aliases":["10.1007\/bfb0035111"],"URL":"https:\/\/doi.org\/10.1007\/978-3-662-25209-3_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1991]]}}}