{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,8]],"date-time":"2025-01-08T05:31:40Z","timestamp":1736314300600,"version":"3.32.0"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540619949"},{"type":"electronic","value":"9783540495888"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/bfb0037420","type":"book-chapter","created":{"date-parts":[[2006,1,25]],"date-time":"2006-01-25T15:15:55Z","timestamp":1138202155000},"page":"377-384","source":"Crossref","is-referenced-by-count":4,"title":["Regularity is decidable for normed BPA and normed BPP processes in polynomial time"],"prefix":"10.1007","author":[{"given":"Anton\u00edn","family":"Ku\u010dera","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,26]]},"reference":[{"key":"28_CR1","doi-asserted-by":"crossref","unstructured":"J. C. M. Baeten, J. A. Bergstra, and J. W. Klop. Decidability of bisimulation equivalence for processes generating context-free languages. In Proceedings of PARLE 87, volume 259 of LNCS, pages 93\u2013114. Springer-Verlag, 1987.","DOI":"10.1007\/3-540-17945-3_5"},{"key":"28_CR2","doi-asserted-by":"crossref","unstructured":"J. C. M. Baeten and W. P. Weijland. Process Algebra. Number 18 in Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, 1990.","DOI":"10.1017\/CBO9780511624193"},{"key":"28_CR3","unstructured":"D. Caucal. Graphes canoniques de graphes algebriques. Rapport de Recherche 872, INRIA, 1988."},{"key":"28_CR4","unstructured":"S. Christensen. Decidability and Decomposition in Process Algebras. PhD thesis, The University of Edinburgh, 1993."},{"key":"28_CR5","doi-asserted-by":"crossref","unstructured":"S. Christensen, Y. Hirsfeld, and F. Moller. Bisimulation is decidable for all basic parallel processes. In Proceedings of CONCUR 93, volume 715 of LNCS, pages 143\u2013157. Springer-Verlag, 1993.","DOI":"10.1007\/3-540-57208-2_11"},{"key":"28_CR6","doi-asserted-by":"crossref","unstructured":"S. Christensen, H. H\u00fcttel, and C. Stirling. Bisimulation equivalence is decidable for all context-free processes. In Proceedings of CONCUR 92, volume 630 of LNCS, pages 138\u2013147. Springer-Verlag, 1992.","DOI":"10.1007\/BFb0084788"},{"key":"28_CR7","doi-asserted-by":"crossref","unstructured":"J. Esparza and P. Jan\u010dar. Deciding finiteness of Petri nets up to bisimilarity. In Proceedings of ICALP 96, volume 1099 of LNCS, pages 478\u2013489. Springer-Verlag, 1996.","DOI":"10.1007\/3-540-61440-0_152"},{"key":"28_CR8","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1016\/0020-0190(92)90142-I","volume":"42","author":"J. F. Groote","year":"1991","unstructured":"J. F. Groote. A short proof of the decidability of bisimulation for normed BPA processes. Information Processing Letters, 42:167\u2013171, 1991.","journal-title":"Information Processing Letters"},{"key":"28_CR9","unstructured":"Y. Hirsfeld. Deciding equivalences in simple process algebras. Technical report ECS-LFCS-94-294, Department of Computer Science, University of Edinburgh, 1994."},{"key":"28_CR10","doi-asserted-by":"crossref","unstructured":"H. H\u00fcttel and C. Stirling. Actions speak louder than words: Proving bisimilarity for context-free processes. In Proceedings of LICS 91, pages 376\u2013386. IEEE Computer Society Press, 1991.","DOI":"10.1109\/LICS.1991.151661"},{"key":"28_CR11","doi-asserted-by":"crossref","unstructured":"P. Jan\u010dar. Decidability questions for bisimilarity of Petri nets and some related problems. In Proceedings of STACS 94, volume 775 of LNCS, pages 581\u2013592. Springer-Verlag, 1994.","DOI":"10.1007\/3-540-57785-8_173"},{"key":"28_CR12","doi-asserted-by":"crossref","unstructured":"P. Jan\u010dar and F. Moller. Checking regular properties of Petri nets. In Proceedings of CONCUR 95, volume 962 of LNCS, pages 348\u2013362. Springer-Verlag, 1995.","DOI":"10.1007\/3-540-60218-6_26"},{"key":"28_CR13","doi-asserted-by":"crossref","unstructured":"A. Ku\u010dera. Deciding regularity in process algebras. BRICS Report Series RS-95-52, Department of Computer Science, University of Aarhus, October 1995.","DOI":"10.7146\/brics.v2i52.19953"},{"key":"28_CR14","doi-asserted-by":"crossref","unstructured":"S. Mauw and H. Mulder. Regularity of BPA-systems is decidable. In Proceedings of CONCUR 94, volume 836 of LNCS, pages 34\u201347. Springer-Verlag, 1994.","DOI":"10.1007\/978-3-540-48654-1_4"},{"key":"28_CR15","unstructured":"R. Milner. Communication and Concurrency. Prentice-Hall International, 1989."},{"key":"28_CR16","doi-asserted-by":"crossref","unstructured":"D.M.R. Park. Concurrency and automata on infinite sequences. In Proceedings 5th GI Conference, volume 104 of LNCS, pages 167\u2013183. Springer-Verlag, 1981.","DOI":"10.1007\/BFb0017309"},{"key":"28_CR17","doi-asserted-by":"crossref","unstructured":"D. Taubner. Finite Representations of CCS and TCSP Programs by Automata and Petri Nets. Number 369 in LNCS. Springer-Verlag, 1989.","DOI":"10.1007\/3-540-51525-9"}],"container-title":["Lecture Notes in Computer Science","SOFSEM'96: Theory and Practice of Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0037420","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,7]],"date-time":"2025-01-07T11:47:56Z","timestamp":1736250476000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0037420"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540619949","9783540495888"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/bfb0037420","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}