{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:09:34Z","timestamp":1760202574467,"version":"3.35.0"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2008,11,11]],"date-time":"2008-11-11T00:00:00Z","timestamp":1226361600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Acta Informatica"],"published-print":{"date-parts":[[2009,2]]},"DOI":"10.1007\/s00236-008-0082-3","type":"journal-article","created":{"date-parts":[[2008,11,10]],"date-time":"2008-11-10T06:29:07Z","timestamp":1226298547000},"page":"1-28","source":"Crossref","is-referenced-by-count":9,"title":["On decidability of LTL model checking for process rewrite systems"],"prefix":"10.1007","volume":"46","author":[{"given":"Laura","family":"Bozzelli","sequence":"first","affiliation":[]},{"given":"Mojm\u00edr","family":"K\u0159et\u00ednsk\u00fd","sequence":"additional","affiliation":[]},{"given":"Vojt\u011bch","family":"\u0158eh\u00e1k","sequence":"additional","affiliation":[]},{"given":"Jan","family":"Strej\u010dek","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2008,11,11]]},"reference":[{"key":"82_CR1","doi-asserted-by":"crossref","unstructured":"Bouajjani, A., Esparza, J., Maler, O.: Reachability analysis of pushdown automata: application to model-checking. In: Proceedings of CONCUR\u201997, Lecture Notes in Computer Science, vol. 1243, pp. 135\u2013150 (1997)","DOI":"10.1007\/3-540-63141-0_10"},{"key":"82_CR2","doi-asserted-by":"crossref","unstructured":"Bouajjani, A., Habermehl, P.: Constrained properties, semilinear systems, and petri nets. In: Proceedings of CONCUR\u201996, Lecture Notes in Computer Science, vol. 1119, pp. 481\u2013497. Springer, Heidelberg (1996)","DOI":"10.1007\/3-540-61604-7_71"},{"key":"82_CR3","doi-asserted-by":"crossref","unstructured":"Bozzelli, L.: Model checking for process rewrite systems and a class of action-based regular properties. In: Proceedings of VMCAI\u201905, Lecture Notes in Computer Science, vol. 3385, pp. 282\u2013297. Springer, Heidelberg (2005)","DOI":"10.1007\/978-3-540-30579-8_19"},{"key":"82_CR4","doi-asserted-by":"crossref","unstructured":"Bozzelli, L., K\u0159et\u00ednsk\u00fd, M., \u0158eh\u00e1k, V., Strej\u010dek, J.: On decidability of LTL model checking for process rewrite systems. In: FSTTCS 2006, Lecture Notes in Computer Science, vol. 4337, pp. 248\u2013259. Springer, Heidelberg (2006)","DOI":"10.1007\/11944836_24"},{"key":"82_CR5","doi-asserted-by":"crossref","unstructured":"Esparza, J.: On the decidability of model checking for several mu-calculi and petri nets. In: CAAP, Lecture Notes in Computer Science, vol. 787, pp. 115\u2013129. Springer, Heidelberg (1994)","DOI":"10.1007\/BFb0017477"},{"issue":"2","key":"82_CR6","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1006\/inco.2001.2953","volume":"179","author":"K. Etessami","year":"2002","unstructured":"Etessami K., Vardi M.Y., Wilke T.: First-order logic with two variables and unary temporal logic. Inf. Comput. 179(2), 279\u2013295 (2002)","journal-title":"Inf. Comput."},{"key":"82_CR7","doi-asserted-by":"crossref","unstructured":"Gabbay, D.: The declarative past and imperative future: executable temporal logic for interactive systems. In: Temporal Logic in Specification, Lecture Notes in Computer Science, vol. 398, pp. 409\u2013448 (1987)","DOI":"10.1007\/3-540-51803-7_36"},{"key":"82_CR8","doi-asserted-by":"crossref","unstructured":"Habermehl, P.: On the complexity of the linear-time\u00a0\u03bc-calculus for petri nets. In: Proceedings of ICATPN\u201997, Lecture Notes in Computer Science, vol. 1248, pp. 102\u2013116. Springer, Heidelberg (1997)","DOI":"10.1007\/3-540-63139-9_32"},{"key":"82_CR9","doi-asserted-by":"crossref","unstructured":"K\u0159et\u00ednsk\u00fd, M., \u0158eh\u00e1k, V., Strej\u010dek, J.: Extended process rewrite systems: expressiveness and reachability. In: Proceedings of CONCUR\u201904, Lecture Notes in Computer Science, vol. 3170, pp. 355\u2013370. Springer, Heidelberg (2004)","DOI":"10.1007\/978-3-540-28644-8_23"},{"key":"82_CR10","doi-asserted-by":"crossref","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\u201903, Electr. Notes Theor. Comput. Sci., vol. 98, pp. 75\u201388. Elsevier, Amsterdam (2004)","DOI":"10.1016\/j.entcs.2003.10.008"},{"key":"82_CR11","doi-asserted-by":"crossref","unstructured":"K\u0159et\u00ednsk\u00fd, M., \u0158eh\u00e1k, V., Strej\u010dek, J.: Reachability of Hennessy\u2013Milner properties for weakly extended PRS. In: Proceedings of FSTTCS 2005, Lecture Notes in Computer Science, vol. 3821, pp. 213\u2013224. Springer, Heidelberg (2005)","DOI":"10.1007\/11590156_17"},{"key":"82_CR12","unstructured":"K\u0159et\u00ednsk\u00fd, M., \u0158eh\u00e1k, V., Strej\u010dek, J.: On Decidability of LTL+Past Model Checking for Process Rewrite Systems. In: Proceedings of INFINITY\u201907, Electr. Notes Theor. Comput. Sci. Elsevier, Amsterdam (2007) (to appear)"},{"key":"82_CR13","unstructured":"Lipton, R.: The reachability problem is exponential-space hard. Tech. Rep. 62, Department of Computer Science, Yale University (1976)"},{"key":"82_CR14","doi-asserted-by":"crossref","unstructured":"Maidl, M.: The common fragment of CTL and LTL. In: Proceedings of 41th Annual Symposium on Foundations of Computer Science, pp. 643\u2013652 (2000)","DOI":"10.1109\/SFCS.2000.892332"},{"issue":"3","key":"82_CR15","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1137\/0213029","volume":"13","author":"E.W. Mayr","year":"1984","unstructured":"Mayr E.W.: An algorithm for the general Petri net reachability problem. SIAM J. Comput. 13(3), 441\u2013460 (1984)","journal-title":"SIAM J. Comput."},{"key":"82_CR16","unstructured":"Mayr, R.: Decidability and complexity of model checking problems for infinite-state systems. PhD thesis, Technische Universit\u00e4t M\u00fcnchen (1998)"},{"issue":"1","key":"82_CR17","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1006\/inco.1999.2826","volume":"156","author":"R. Mayr","year":"2000","unstructured":"Mayr R.: Process rewrite systems. Inf. Comput. 156(1), 264\u2013286 (2000)","journal-title":"Inf. Comput."},{"key":"82_CR18","volume-title":"Communication and Concurrency","author":"R. Milner","year":"1989","unstructured":"Milner R.: Communication and Concurrency. Prentice-Hall, Englewood Cliffs (1989)"},{"key":"82_CR19","volume-title":"Computation: Finite and Infinite Machines","author":"M.L. Minsky","year":"1967","unstructured":"Minsky M.L.: Computation: Finite and Infinite Machines. Prentice-Hall, Englewood Cliffs (1967)"},{"key":"82_CR20","doi-asserted-by":"crossref","unstructured":"Pnueli, A.: The temporal logic of programs. In: Proceedings of 18th IEEE Symposium on the Foundations of Computer Science, pp. 46\u201357 (1977)","DOI":"10.1109\/SFCS.1977.32"},{"key":"82_CR21","unstructured":"\u0158eh\u00e1k, V.: On Extensions of Process Rewrite Systems. PhD thesis, Faculty of Informatics, Masaryk University, Brno (2007)"},{"key":"82_CR22","unstructured":"Strej\u010dek, J.: Linear temporal logic: Expressiveness and model checking. PhD thesis, Faculty of Informatics, Masaryk University, Brno (2004)"}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-008-0082-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00236-008-0082-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-008-0082-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,2]],"date-time":"2025-02-02T16:08:54Z","timestamp":1738512534000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00236-008-0082-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,11,11]]},"references-count":22,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2009,2]]}},"alternative-id":["82"],"URL":"https:\/\/doi.org\/10.1007\/s00236-008-0082-3","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"type":"print","value":"0001-5903"},{"type":"electronic","value":"1432-0525"}],"subject":[],"published":{"date-parts":[[2008,11,11]]}}}