{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,10]],"date-time":"2026-11-10T19:03:32Z","timestamp":1794337412200,"version":"4.9.0"},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540304951","type":"print"},{"value":"9783540324195","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11590156_17","type":"book-chapter","created":{"date-parts":[[2005,12,5]],"date-time":"2005-12-05T10:43:16Z","timestamp":1133779396000},"page":"213-224","source":"Crossref","is-referenced-by-count":9,"title":["Reachability of Hennessy-Milner Properties for Weakly Extended PRS"],"prefix":"10.1007","author":[{"given":"Mojm\u00edr","family":"K\u0159et\u00ednsk\u00fd","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Vojt\u011bch","family":"\u0158eh\u00e1k","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jan","family":"Strej\u010dek","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"issue":"3","key":"17_CR1","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/BF01257083","volume":"20","author":"M. Ben-Ari","year":"1983","unstructured":"Ben-Ari, M., Pnueli, A., Manna, Z.: The temporal logic of branching time. Acta Informatica\u00a020(3), 207\u2013226 (1983)","journal-title":"Acta Informatica"},{"key":"17_CR2","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1016\/B978-044482830-9\/50027-8","volume-title":"Handbook of Process Algebra","author":"O. Burkart","year":"2001","unstructured":"Burkart, O., Caucal, D., Moller, F., Steffen, B.: Verification on infinite structures. In: Handbook of Process Algebra, pp. 545\u2013623. Elsevier, Amsterdam (2001)"},{"key":"17_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1007\/3-540-61604-7_59","volume-title":"CONCUR \u201996: Concurrency Theory","author":"O. Burkart","year":"1996","unstructured":"Burkart, O., Caucal, D., Steffen, B.: Bisimulation collapse and the process taxonomy. In: Sassone, V., Montanari, U. (eds.) CONCUR 1996. LNCS, vol.\u00a01119, pp. 247\u2013262. Springer, Heidelberg (1996)"},{"key":"17_CR4","volume-title":"Proc. of LICS 1995","author":"A. Bouajjani","year":"1995","unstructured":"Bouajjani, A., Echahed, R., Habermehl, P.: On the verification problem of nonregular properties for nonregular processes. In: Proc. of LICS 1995, IEEE, Los Alamitos (1995)"},{"key":"17_CR5","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/0304-3975(92)90278-N","volume":"106","author":"D. Caucal","year":"1992","unstructured":"Caucal, D.: On the regular structure of prefix rewriting. Theor. Comput. Sci.\u00a0106, 61\u201386 (1992)","journal-title":"Theor. Comput. Sci."},{"key":"17_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1007\/3-540-60045-0_62","volume-title":"Computer Aided Verification","author":"J. Esparza","year":"1995","unstructured":"Esparza, J., Kiehn, A.: On the model checking problem for branching time logics and basic parallel processes. In: Wolper, P. (ed.) CAV 1995. LNCS, vol.\u00a0939, pp. 353\u2013366. Springer, Heidelberg (1995)"},{"key":"17_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/BFb0017477","volume-title":"Trees in Algebra and Programming - CAAP \u201994","author":"J. Esparza","year":"1994","unstructured":"Esparza, J.: On the decidability of model checking for several mu-calculi and petri nets. In: Tison, S. (ed.) CAAP 1994. LNCS, vol.\u00a0787, pp. 115\u2013129. Springer, Heidelberg (1994)"},{"issue":"2","key":"17_CR8","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/s002360050074","volume":"34","author":"J. Esparza","year":"1997","unstructured":"Esparza, J.: Decidability of model checking for infinite-state concurrent systems. Acta Informatica\u00a034(2), 85\u2013107 (1997)","journal-title":"Acta Informatica"},{"key":"17_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/3-540-45711-9_16","volume-title":"Formal and Natural Computing","author":"J. Esparza","year":"2002","unstructured":"Esparza, J.: Grammars as processes. In: Brauer, W., Ehrig, H., Karhum\u00e4ki, J., Salomaa, A. (eds.) Formal and Natural Computing. LNCS, vol.\u00a02300, p. 277. Springer, Heidelberg (2002)"},{"issue":"1-2","key":"17_CR10","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0304-3975(00)00099-2","volume":"256","author":"Y. Hirshfeld","year":"2001","unstructured":"Hirshfeld, Y., Moller, F.: Pushdown automata, multiset automata, and petri nets. Theor. Comput. Sci.\u00a0256(1-2), 3\u201321 (2001)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"17_CR11","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1016\/0304-3975(95)00037-W","volume":"148","author":"P. Jan\u010dar","year":"1995","unstructured":"Jan\u010dar, P.: Undecidability of bisimilarity for Petri nets and some related problems. Theor. Comput. Sci.\u00a0148(2), 281\u2013301 (1995)","journal-title":"Theor. Comput. Sci."},{"key":"17_CR12","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1109\/LICS.2003.1210061","volume-title":"Proc. of 18th IEEE Symposium on Logic in Computer Science (LICS 2003)","author":"P. Jan\u010dar","year":"2003","unstructured":"Jan\u010dar, P.: Strong bisimilarity on basic parallel processes is PSPACE complete. In: Proc. of 18th IEEE Symposium on Logic in Computer Science (LICS 2003), pp. 218\u2013227. IEEE Computer Society Press, Los Alamitos (2003)"},{"key":"17_CR13","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1016\/S0304-3975(00)00027-X","volume":"258","author":"P. Jan\u010dar","year":"2001","unstructured":"Jan\u010dar, P., Ku\u010dera, A., Mayr, R.: Deciding bisimulation-like equivalences with finite-state processes. Theor. Comput. Sci.\u00a0258, 409\u2013433 (2001)","journal-title":"Theor. Comput. Sci."},{"key":"17_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"348","DOI":"10.1007\/3-540-60218-6_26","volume-title":"CONCUR \u201995 Concurrency Theory","author":"P. Jancar","year":"1995","unstructured":"Jancar, P., Moller, F.: Checking regular properties of petri nets. In: Lee, I., Smolka, S.A. (eds.) CONCUR 1995. LNCS, vol.\u00a0962, pp. 348\u2013362. Springer, Heidelberg (1995)"},{"key":"17_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/3-540-36137-5_3","volume-title":"SOFSEM 2002: Theory and Practice of Informatics","author":"A. Ku\u010dera","year":"2002","unstructured":"Ku\u010dera, A., Jan\u010dar, P.: Equivalence-checking with infinite-state systems: Techniques and results. In: Grosky, W.I., Pl\u00e1\u0161il, F. (eds.) SOFSEM 2002. LNCS, vol.\u00a02540, pp. 41\u201373. Springer, Heidelberg (2002)"},{"key":"17_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1007\/978-3-540-28644-8_23","volume-title":"CONCUR 2004 - Concurrency Theory","author":"M. K\u0159et\u00ednsk\u00fd","year":"2004","unstructured":"K\u0159et\u00ednsk\u00fd, M., \u0158eh\u00e1k, V., Strej\u010dek, J.: Extended process rewrite systems: Expressiveness and reachability. In: Gardner, P., Yoshida, N. (eds.) CONCUR 2004. LNCS, vol.\u00a03170, pp. 355\u2013370. Springer, Heidelberg (2004)"},{"key":"17_CR17","series-title":"ENTCS","first-page":"75","volume-title":"Proceedings of INFINITY 2003","author":"M. K\u0159et\u00ednsk\u00fd","year":"2004","unstructured":"K\u0159et\u00ednsk\u00fd, M., \u0158eh\u00e1k, V., Strej\u010dek, J.: On extensions of process rewrite systems: Rewrite systems with weak finite-state unit. In: Proceedings of INFINITY 2003. ENTCS, vol.\u00a098, pp. 75\u201388. Elsevier, Amsterdam (2004)"},{"key":"17_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1007\/978-3-540-28644-8_24","volume-title":"CONCUR 2004 - Concurrency Theory","author":"A. Ku\u010dera","year":"2004","unstructured":"Ku\u010dera, A., Schnoebelen, P.: A general approach to comparing infinite state systems with their finite-state specifications. In: Gardner, P., Yoshida, N. (eds.) CONCUR 2004. LNCS, vol.\u00a03170, pp. 371\u2013386. Springer, Heidelberg (2004)"},{"key":"17_CR19","unstructured":"Mayr, R.: Decidability and Complexity of Model Checking Problems for Infinite-State Systems. Ph.D thesis, Technische Universit\u00e4tM\u00fcnchen (1998)"},{"issue":"1","key":"17_CR20","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1006\/inco.1999.2826","volume":"156","author":"R. Mayr","year":"2000","unstructured":"Mayr, R.: Process rewrite systems. Information and Computation\u00a0156(1), 264\u2013286 (2000)","journal-title":"Information and Computation"},{"key":"17_CR21","volume-title":"Communication and Concurrency","author":"R. Milner","year":"1989","unstructured":"Milner, R.: Communication and Concurrency. Prentice-Hall, Englewood Cliffs (1989)"},{"key":"17_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1007\/3-540-61604-7_56","volume-title":"CONCUR \u201996: Concurrency Theory","author":"F. Moller","year":"1996","unstructured":"Moller, F.: Infinite results. In: Sassone, V., Montanari, U. (eds.) CONCUR 1996. LNCS, vol.\u00a01119, pp. 195\u2013216. Springer, Heidelberg (1996)"},{"key":"17_CR23","unstructured":"Mayr, R., Rusinowitch, M.: Reachability is decidable for ground AC rewrite systems. In: Proceedings of INFINITY 1998 workshop (1998)"},{"key":"17_CR24","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/0304-3975(85)90087-8","volume":"37","author":"D. Muller","year":"1985","unstructured":"Muller, D., Schupp, P.: The theory of ends, pushdown automata, and second-order logic. Theor. Comput. Sci.\u00a037, 51\u201375 (1985)","journal-title":"Theor. Comput. Sci."},{"issue":"1\u2013 2","key":"17_CR25","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1016\/0304-3975(92)90076-R","volume":"97","author":"D. Muller","year":"1992","unstructured":"Muller, D., Saoudi, A., Schupp, P.: Alternating automata, the weak monadic theory of trees and its complexity. Theor. Comput. Sci.\u00a097(1\u2013 2), 233\u2013244 (1992)","journal-title":"Theor. Comput. Sci."},{"key":"17_CR26","unstructured":"Srba, J.: Roadmap of infinite results. EATCS Bulletin\u00a0(78), 163\u2013175 (2002), \n                    \n                      http:\/\/www.brics.dk\/~srba\/roadmap\/"}],"container-title":["Lecture Notes in Computer Science","FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11590156_17.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T02:49:06Z","timestamp":1619491746000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11590156_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540304951","9783540324195"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/11590156_17","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/11590156","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005]]}}}