{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:40:39Z","timestamp":1725496839363},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540665366"},{"type":"electronic","value":"9783540481683"}],"license":[{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-48168-0_35","type":"book-chapter","created":{"date-parts":[[2007,12,1]],"date-time":"2007-12-01T11:30:26Z","timestamp":1196508626000},"page":"499-514","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["A Logical Viewpoint on Process-Algebraic Quotients"],"prefix":"10.1007","author":[{"given":"Anton\u00edn","family":"Ku\u010dera","sequence":"first","affiliation":[]},{"given":"Javier","family":"Esparza","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2003,5,13]]},"reference":[{"key":"35_CR1","doi-asserted-by":"crossref","unstructured":"Proceedings of CONCUR\u201992, volume 630 of LNCS. Springer, 1992.","DOI":"10.1121\/1.404055"},{"issue":"2","key":"35_CR2","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/0304-3975(94)90010-8","volume":"126","author":"R. Alur","year":"1994","unstructured":"R. Alur and D. Dill. A theory of timed automata. Theoretical Computer Science, 126(2):183\u2013235, 25 April 1994. Fundamental Study.","journal-title":"Theoretical Computer Science"},{"key":"35_CR3","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1007\/3-540-61604-7_59","volume-title":"Proceedings of CONCUR\u201996","author":"O. Burkart","year":"1996","unstructured":"O. Burkart, D. Caucal, and B. Steffen. Bisimulation collapse and the process taxonomy. In Proceedings of CONCUR\u201996, volume 1119 of LNCS, pages 247\u2013262. Springer, 1996."},{"key":"35_CR4","doi-asserted-by":"crossref","unstructured":"B.F. Chellas. Modal Logic-An Introduction. Cambridge University Press, 1980.","DOI":"10.1017\/CBO9780511621192"},{"key":"35_CR5","unstructured":"J. Flum. First-order logic and its extensions. In Proceedings of the International Summer Institute and Logic Colloquium, volume 499 of Lecture Notes in Mathematics. Springer, 1975."},{"key":"35_CR6","doi-asserted-by":"crossref","unstructured":"U. Goltz, R. Kuiper, and W. Penczek. Propositional temporal logics and equivalences. In Proceedings of CONCUR\u201992 [1], pages 222\u2013236.","DOI":"10.1007\/BFb0084794"},{"issue":"1","key":"35_CR7","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1145\/2455.2460","volume":"32","author":"M. Hennessy","year":"1985","unstructured":"M. Hennessy and R. Milner. Algebraic laws for nondeterminism and concurrency. Journal of the ACM, 32(1):137\u2013161, January 1985.","journal-title":"Journal of the ACM"},{"key":"35_CR8","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"324","DOI":"10.1007\/3-540-60084-1_85","volume-title":"Proceedings of ICALP\u201995","author":"T. Henzinger","year":"1995","unstructured":"T. Henzinger. Hybrid automata with finite bisimulations. In Proceedings of ICALP\u201995, volume 944 of LNCS, pages 324\u2013335. Springer, 1995."},{"key":"35_CR9","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"478","DOI":"10.1007\/3-540-61440-0_152","volume-title":"Proceedings of ICALP\u201996","author":"P. Jancar","year":"1996","unstructured":"P. Jancar and J. Esparza. Deciding finiteness of Petri nets up to bisimilarity. In Proceedings of ICALP\u201996, volume 1099 of LNCS, pages 478\u2013489. Springer, 1996."},{"key":"35_CR10","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"348","DOI":"10.1007\/3-540-60218-6_26","volume-title":"Proceedings of CONCUR\u2019 95","author":"P. Jancar","year":"1995","unstructured":"P. Jancar and F. Moller. Checking regular properties of Petri nets. In Proceedings of CONCUR\u2019 95, volume 962 of LNCS, pages 348\u2013362. Springer, 1995."},{"key":"35_CR11","doi-asserted-by":"crossref","unstructured":"R. Kaivola and A. Valmari. The weakest compositional semantic equivalence preserving nexttime-less linear temporal logic. In Proceedings of CONCUR\u201992 [1], pages 207\u2013221.","DOI":"10.1007\/BFb0084793"},{"key":"35_CR12","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/3-540-62034-6_42","volume-title":"Proceedings of FST&TCS\u201996","author":"A. Ku\u010dera","year":"1996","unstructured":"A. Ku\u010dera. Regularity is decidable for normed PA processes in polynomial time. In Proceedings of FST&TCS\u201996, volume 1180 of LNCS, pages 111\u2013122. Springer, 1996."},{"issue":"1","key":"35_CR13","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/S0020-0190(99)00029-0","volume":"70","author":"A. Ku\u010dera","year":"1999","unstructured":"A. Ku\u010dera. On finite representations of infinite-state behaviours. Information Processing Letters, 70(1):23\u201330, 1999.","journal-title":"Information Processing Letters"},{"key":"35_CR14","series-title":"Lect Notes Comput Sci","volume-title":"Proceedings of ICALP\u201999","author":"A. Ku\u010dera","year":"1999","unstructured":"A. Ku\u010dera and R. Mayr. Simulation preorder on simple process algebras. In Proceedings of ICALP\u201999, LNCS. Springer, 1999. To appear."},{"key":"35_CR15","unstructured":"R. Milner. Communication and Concurrency. Prentice-Hall, 1989."},{"issue":"6","key":"35_CR16","doi-asserted-by":"publisher","first-page":"973","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(6):973\u2013989, December 1987.","journal-title":"SIAM Journal on Computing"},{"key":"35_CR17","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1007\/BFb0017309","volume-title":"Proceedings 5th GI Conference","author":"D.M.R. Park","year":"1981","unstructured":"D.M.R. Park. Concurrency and automata on infinite sequences. In Proceedings 5th GI Conference, volume 104 of LNCS, pages 167\u2013183. Springer, 1981."},{"key":"35_CR18","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1007\/BFb0039066","volume-title":"Proceedings of CONCUR\u2019 90","author":"R.J. Glabbeek van","year":"1990","unstructured":"R.J. van Glabbeek. The linear time-branching time spectrum. In Proceedings of CONCUR\u2019 90, volume 458 of LNCS, pages 278\u2013297. Springer, 1990."}],"container-title":["Lecture Notes in Computer Science","Computer Science Logic"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48168-0_35","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,19]],"date-time":"2024-02-19T23:12:53Z","timestamp":1708384373000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48168-0_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540665366","9783540481683"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/3-540-48168-0_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1999]]},"assertion":[{"value":"13 May 2003","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}