{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T04:57:36Z","timestamp":1725771456311},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319049205"},{"type":"electronic","value":"9783319049212"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-04921-2_36","type":"book-chapter","created":{"date-parts":[[2014,2,5]],"date-time":"2014-02-05T13:52:25Z","timestamp":1391608345000},"page":"441-452","source":"Crossref","is-referenced-by-count":1,"title":["Interval Temporal Logic Semantics of Box Algebra"],"prefix":"10.1007","author":[{"given":"Hanna","family":"Klaudel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maciej","family":"Koutny","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhenhua","family":"Duan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"36_CR1","doi-asserted-by":"crossref","unstructured":"Ben-Ari, M., Manna, Z., Pnueli, A.: The temporal logic of branching time. In: White, J., Lipton, R.J., Goldberg, P.C. (eds.), pp. 164\u2013176. ACM Press (1981)","DOI":"10.1145\/567532.567551"},{"key":"36_CR2","doi-asserted-by":"crossref","unstructured":"Best, E., Devillers, R., Koutny, M.: Petri Net Algebra. Springer (2001)","DOI":"10.1007\/978-3-662-04457-5"},{"key":"36_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/3-540-63010-4_6","volume-title":"Transformation-Based Reactive Systems Development","author":"A. Cau","year":"1997","unstructured":"Cau, A., Zedan, H.: Refining interval temporal logic specifications. In: Rus, T., Bertr\u00e1n, M. (eds.) AMAST-ARTS 1997, ARTS 1997, and AMAST-WS 1997. LNCS, vol.\u00a01231, pp. 79\u201394. Springer, Heidelberg (1997)"},{"key":"36_CR4","doi-asserted-by":"crossref","unstructured":"Desel, J., Juh\u00e1s, G.: What is a petri net? In: Ehrig, H., Juh\u00e1s, G., Padberg, J., Rozenberg, G. (eds.) Unifying Petri Nets. LNCS, vol.\u00a02128, pp. 1\u201325. Springer, Heidelberg (2001)","DOI":"10.1007\/3-540-45541-8_1"},{"issue":"2","key":"36_CR5","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/j.jlap.2012.12.001","volume":"82","author":"Z. Duan","year":"2013","unstructured":"Duan, Z., Klaudel, H., Koutny, M.: ITL semantics of composite Petri nets. J. Log. Algebr. Program\u00a082(2), 95\u2013110 (2013)","journal-title":"J. Log. Algebr. Program"},{"issue":"2-3","key":"36_CR6","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1016\/0167-6423(94)00019-0","volume":"23","author":"J. Esparza","year":"1994","unstructured":"Esparza, J.: Model checking using net unfoldings. Sci. Comput. Program.\u00a023(2-3), 151\u2013195 (1994)","journal-title":"Sci. Comput. Program."},{"key":"36_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0304-3975(87)90045-4","volume":"50","author":"J.Y. Girard","year":"1987","unstructured":"Girard, J.Y.: Linear logic. Theor. Comput. Sci.\u00a050, 1\u2013102 (1987)","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"36_CR8","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1093\/comjnl\/bxs102","volume":"56","author":"H. Janicke","year":"2013","unstructured":"Janicke, H., Cau, A., Siewe, F., Zedan, H.: Dynamic access control policies: Specification and verification. Comput. J.\u00a056(4), 440\u2013463 (2013)","journal-title":"Comput. J."},{"key":"36_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"366","DOI":"10.1007\/3-540-44685-0_25","volume-title":"CONCUR 2001 - Concurrency Theory","author":"V. Khomenko","year":"2001","unstructured":"Khomenko, V., Koutny, M.: Towards an efficient algorithm for unfolding petri nets. In: Larsen, K.G., Nielsen, M. (eds.) CONCUR 2001. LNCS, vol.\u00a02154, pp. 366\u2013380. Springer, Heidelberg (2001)"},{"key":"36_CR10","doi-asserted-by":"crossref","unstructured":"Moszkowski, B.C.: Executing Temporal Logic Programs. Cambridge University Press (1986)","DOI":"10.1007\/3-540-15670-4_6"},{"key":"36_CR11","doi-asserted-by":"crossref","unstructured":"Moszkowski, B.C.: A complete axiom system for propositional interval temporal logic with infinite time. Logical Methods in Computer Science 8(3) (2012)","DOI":"10.2168\/LMCS-8(3:10)2012"},{"key":"36_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1007\/3-540-12896-4_374","volume-title":"Logics of Programs","author":"B.C. Moszkowski","year":"1984","unstructured":"Moszkowski, B.C., Manna, Z.: Reasoning in interval temporal logic. In: Clarke, E., Kozen, D. (eds.) Logic of Programs 1983. LNCS, vol.\u00a0164, pp. 371\u2013382. Springer, Heidelberg (1984)"},{"key":"36_CR13","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/0304-3975(85)90136-7","volume":"39","author":"M. Parigot","year":"1985","unstructured":"Parigot, M., Pelz, E.: A logical approach of Petri net languages. Theor. Comput. Sci.\u00a039, 155\u2013169 (1985)","journal-title":"Theor. Comput. Sci."},{"key":"36_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1007\/3-540-65306-6_19","volume-title":"Lectures on Petri Nets I: Basic Models","author":"M. Silva","year":"1998","unstructured":"Silva, M., Teruel, E., Colom, J.M.: Linear algebraic and linear programming techniques for the analysis of place\/transition net systems. In: Reisig, W., Rozenberg, G. (eds.) APN 1998. LNCS, vol.\u00a01491, pp. 309\u2013373. Springer, Heidelberg (1998)"},{"issue":"3-4","key":"36_CR15","doi-asserted-by":"crossref","first-page":"377","DOI":"10.3233\/FI-2011-613","volume":"113","author":"A. Valmari","year":"2011","unstructured":"Valmari, A., Hansen, H.: Can stubborn sets be optimal? Fundam. Inform.\u00a0113(3-4), 377\u2013397 (2011)","journal-title":"Fundam. Inform."}],"container-title":["Lecture Notes in Computer Science","Language and Automata Theory and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-04921-2_36","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,15]],"date-time":"2020-08-15T02:45:59Z","timestamp":1597459559000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-04921-2_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319049205","9783319049212"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-04921-2_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}