{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T21:19:54Z","timestamp":1725743994864},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642404641"},{"type":"electronic","value":"9783642404658"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40465-8_5","type":"book-chapter","created":{"date-parts":[[2013,8,4]],"date-time":"2013-08-04T20:58:46Z","timestamp":1375649926000},"page":"89-105","source":"Crossref","is-referenced-by-count":2,"title":["Using Integer Time Steps for Checking Branching Time Properties of Time Petri Nets"],"prefix":"10.1007","author":[{"given":"Agata","family":"Janowska","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wojciech","family":"Penczek","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Agata","family":"P\u00f3\u0142rola","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrzej","family":"Zbrzezny","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"5_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BFb0031985","volume-title":"Real-Time: Theory in Practice","author":"M. Abadi","year":"1992","unstructured":"Abadi, M., Lamport, L.: An old-fashioned recipe for real time. In: Huizing, C., de Bakker, J.W., Rozenberg, G., de Roever, W.-P. (eds.) REX 1991. LNCS, vol.\u00a0600, pp. 1\u201327. Springer, Heidelberg (1992)"},{"key":"5_CR2","unstructured":"Boyer, M., Diaz, M.: Multiple enabledness in Petri nets with time. In: Proc. of the 9th Int. Workshop on Petri Nets and Performance Models (PNPM 2001), pp. 219\u2013228 (2001)"},{"key":"5_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1007\/BFb0084794","volume-title":"CONCUR \u201992","author":"U. Goltz","year":"1992","unstructured":"Goltz, U., Kuiper, R., Penczek, W.: Propositional temporal logics and equivalences. In: Cleaveland, W.R. (ed.) CONCUR 1992. LNCS, vol.\u00a0630, pp. 222\u2013236. Springer, Heidelberg (1992)"},{"key":"5_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1007\/3-540-54430-5_93","volume-title":"CONCUR \u201991","author":"O. Grumberg","year":"1991","unstructured":"Grumberg, O., Long, D.E.: Model checking and modular verification. In: Groote, J.F., Baeten, J.C.M. (eds.) CONCUR 1991. LNCS, vol.\u00a0527, pp. 250\u2013265. Springer, Heidelberg (1991)"},{"key":"5_CR5","unstructured":"Janowska, A., Penczek, W., P\u00f3\u0142rola, A., Zbrzezny, A.: Towards discrete-time verification of time Petri nets with dense-time semantics. In: Proc. of the Int. Workshop on Concurrency, Specification and Programming (CS&P 2011), pp. 215\u2013228. Bialystok University of Technology (2011)"},{"key":"5_CR6","unstructured":"M\u0119ski, A., Penczek, W., P\u00f3\u0142rola, A., Wo\u017ana-Szcze\u015bniak, B., Zbrzezny, A.: Bounded model checking approaches for verificaton of distributed time Petri nets. In: Proc. of the Int. Workshop on Petri Nets and Software Engineering (PNSE 2011), pp. 72\u201391. University of Hamburg (2011)"},{"key":"5_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1007\/3-540-56922-7_34","volume-title":"Computer Aided Verification","author":"D. Peled","year":"1993","unstructured":"Peled, D.: All from one, one for all: On model checking using representatives. In: Courcoubetis, C. (ed.) CAV 1993. LNCS, vol.\u00a0697, pp. 409\u2013423. Springer, Heidelberg (1993)"},{"issue":"4","key":"5_CR8","first-page":"227","volume":"27","author":"L. Popova","year":"1991","unstructured":"Popova, L.: On time Petri nets. Elektronische Informationsverarbeitung und Kybernetik\u00a027(4), 227\u2013244 (1991)","journal-title":"Elektronische Informationsverarbeitung und Kybernetik"},{"key":"5_CR9","unstructured":"Popova-Zeugmann, L.: Essential states in time Petri nets. Informatik-Bericht 96, Humboldt University (1998)"},{"issue":"3","key":"5_CR10","first-page":"721","volume":"35","author":"L. Popova-Zeugmann","year":"2006","unstructured":"Popova-Zeugmann, L.: Time Petri nets state space reduction using dynamic programming. Journal of Control and Cybernetics\u00a035(3), 721\u2013748 (2006)","journal-title":"Journal of Control and Cybernetics"},{"issue":"3","key":"5_CR11","doi-asserted-by":"crossref","first-page":"311","DOI":"10.3233\/FI-1999-37307","volume":"37","author":"L. Popova-Zeugmann","year":"1999","unstructured":"Popova-Zeugmann, L., Schlatter, D.: Analyzing paths in time Petri nets. Fundamenta Informaticae\u00a037(3), 311\u2013327 (1999)","journal-title":"Fundamenta Informaticae"}],"container-title":["Lecture Notes in Computer Science","Transactions on Petri Nets and Other Models of Concurrency VIII"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40465-8_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,1]],"date-time":"2020-08-01T07:24:54Z","timestamp":1596266694000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40465-8_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642404641","9783642404658"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40465-8_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}