{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:49:27Z","timestamp":1725486567048},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540429128"},{"type":"electronic","value":"9783540456278"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45627-9_29","type":"book-chapter","created":{"date-parts":[[2007,6,12]],"date-time":"2007-06-12T11:57:04Z","timestamp":1181649424000},"page":"326-335","source":"Crossref","is-referenced-by-count":9,"title":["P-Hardness of Equivalence Testing on Finite-State Processes"],"prefix":"10.1007","author":[{"given":"Zden\u011bk","family":"Sawa","sequence":"first","affiliation":[]},{"given":"Petr","family":"Jan\u010dar","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,10,24]]},"reference":[{"issue":"6A","key":"29_CR1","doi-asserted-by":"publisher","first-page":"638","DOI":"10.1007\/BF03180566","volume":"4","author":"J. Balc\u00e1zar","year":"1992","unstructured":"J. Balc\u00e1zar, J. Gabarr\u00f3, and M. S\u00e1ntha. Deciding bisimilarity is P-complete. Formal Aspects of Computing, 4(6A):638\u2013648, 1992.","journal-title":"Formal Aspects of Computing"},{"key":"29_CR2","unstructured":"A. Gibbons and W. Rytter. Efficient Parallel Algorithms. Cambridge University Press, 1988."},{"key":"29_CR3","doi-asserted-by":"crossref","unstructured":"H. H\u00fcttel and S. Shukla. On the complexity of deciding behavioural equivalences and preorders. Technical Report SUNYA-CS-96-03, State University of New York at Albany, Dec. 28, 1996. Also available at http:\/\/www.cs.auc.dk\/~hans\/Publications\/pubs.html .","DOI":"10.7146\/brics.v3i39.20021"},{"key":"29_CR4","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/0890-5401(90)90025-D","volume":"86","author":"P. Kanellakis","year":"1990","unstructured":"P. Kanellakis and S. Smolka. CCS expressions, finite state processes and three problems of equivalence. Information and Computation, 86:43\u201368, 1990.","journal-title":"Information and Computation"},{"key":"29_CR5","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"192","DOI":"10.1007\/3-540-46432-8_13","volume-title":"The state explosion problem from trace to bisimulation equivalence","author":"F. Laroussinie","year":"2000","unstructured":"F. Laroussinie and P. Schnoebelen. The state explosion problem from trace to bisimulation equivalence. In Proc. FoSSaCS 2000, volume 1784 of Lecture Notes in Computer Science, pages 192\u2013207. Springer Verlag, 2000."},{"key":"29_CR6","unstructured":"R. Milner. Communication and Concurrency. Prentice-Hall, 1989."},{"key":"29_CR7","doi-asserted-by":"publisher","first-page":"937","DOI":"10.1137\/0216062","volume":"16","author":"R. Paige","year":"1987","unstructured":"R. Paige and R. Tarjan. Three partition refinement algorithms. SIAM Journal on Computing, 16:937\u2013989, 1987.","journal-title":"SIAM Journal on Computing"},{"issue":"2","key":"29_CR8","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1006\/inco.1997.2661","volume":"139","author":"A. Rabinovich","year":"1997","unstructured":"A. Rabinovich. Complexity of equivalence problems for concurrent systems of finite agents. Information and Computation, 139(2):111\u2013129, 1997.","journal-title":"Information and Computation"},{"key":"29_CR9","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1007\/BFb0039066","volume-title":"The linear time \u2014 branching time spectrum","author":"R. Glabbeek","year":"1990","unstructured":"R. van Glabbeek. The linear time \u2014 branching time spectrum. In Proceedings CONCUR\u201990, volume 458 of Lecture Notes in Computer Science, pages 278\u2013297, Amsterdam, 1990. Springer-Verlag."}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2001: Theory and Practice of Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45627-9_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T22:01:48Z","timestamp":1556488908000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45627-9_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540429128","9783540456278"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/3-540-45627-9_29","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}