{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:18:29Z","timestamp":1725549509020},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540240587"},{"type":"electronic","value":"9783540305385"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30538-5_6","type":"book-chapter","created":{"date-parts":[[2010,3,12]],"date-time":"2010-03-12T08:40:30Z","timestamp":1268383230000},"page":"58-70","source":"Crossref","is-referenced-by-count":3,"title":["Decidability of Zenoness, Syntactic Boundedness and Token-Liveness for Dense-Timed Petri Nets"],"prefix":"10.1007","author":[{"given":"Parosh","family":"Abdulla","sequence":"first","affiliation":[]},{"given":"Pritha","family":"Mahata","sequence":"additional","affiliation":[]},{"given":"Richard","family":"Mayr","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"6_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1007\/BFb0032042","volume-title":"Automata, Languages and Programming","author":"R. Alur","year":"1990","unstructured":"Alur, R., Dill, D.: Automata for modelling real-time systems. In: Paterson, M. (ed.) ICALP 1990. LNCS, vol.\u00a0443, pp. 322\u2013335. Springer, Heidelberg (1990)"},{"key":"6_CR2","first-page":"345","volume-title":"Proc. LICS 2004","author":"P.A. Abdulla","year":"2004","unstructured":"Abdulla, P.A., Deneux, J., Mahata, P.: Multi-clock timed networks. In: Proc. LICS 2004, pp. 345\u2013354. IEEE Computer Society Press, Los Alamitos (2004)"},{"issue":"1","key":"6_CR3","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1016\/S0304-3975(01)00330-9","volume":"290","author":"P.A. Abdulla","year":"2003","unstructured":"Abdulla, P.A., Jonsson, B.: Model checking of systems with many identical timed processes. Theoretical Computer Science\u00a0290(1), 241\u2013264 (2003)","journal-title":"Theoretical Computer Science"},{"key":"6_CR4","unstructured":"Alur, R.: Techniques for Automatic Verification of Real-Time Systems. PhD thesis, Dept. of Computer Sciences, Stanford University (1991)"},{"key":"6_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/3-540-45740-2_5","volume-title":"Applications and Theory of Petri Nets 2001","author":"P.A. Abdulla","year":"2001","unstructured":"Abdulla, P.A., Nyl\u00e9n, A.: Timed Petri nets and BQOs. In: Colom, J.-M., Koutny, M. (eds.) ICATPN 2001. LNCS, vol.\u00a02075, pp. 53\u201370. Springer, Heidelberg (2001)"},{"key":"6_CR6","unstructured":"Abdulla, P.A., Nyl\u00e9n, A.: Undecidability of ltl for timed petri nets. In: INFINITY 2002, 4th International Workshop on Verification of Infinite-State Systems (2002)"},{"key":"6_CR7","unstructured":"Bowden, F.D.J.: Modelling time in Petri nets. In: Proc. Second Australian-Japan Workshop on Stochastic Models (1996)"},{"key":"6_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/3-540-44988-4_12","volume-title":"Application and Theory of Petri Nets 2000","author":"D. Frutos Escrig de","year":"2000","unstructured":"D.\u00a0de\u00a0Frutos\u00a0Escrig, V.\u00a0Valero Ruiz, and O.\u00a0Marroqu\u00edn Alonso. Decidability of properties of timed-arc Petri nets. In ICATPN 2000, number 1825 in Lecture Notes in Computer Science, pages 187\u2013206, 2000."},{"key":"6_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/3-540-48523-6_27","volume-title":"Automata, Languages and Programming","author":"C. Dufourd","year":"1999","unstructured":"Dufourd, C., Jan\u010dar, P.: Boundedness of Reset P\/T Nets. In: Wiedermann, J., Van Emde Boas, P., Nielsen, M. (eds.) ICALP 1999. LNCS, vol.\u00a01644, p. 301. Springer, Heidelberg (1999)"},{"key":"6_CR10","unstructured":"Godskesen, J.C.: Timed Modal Specifications. PhD thesis, Aalborg University (1994)"},{"key":"6_CR11","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1112\/plms\/s3-2.1.326","volume":"2","author":"G. Higman","year":"1952","unstructured":"Higman, G.: Ordering by divisibility in abstract algebras. Proc. London Math. Soc.\u00a02, 326\u2013336 (1952)","journal-title":"Proc. London Math. Soc."},{"issue":"2","key":"6_CR12","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1016\/S0022-0000(69)80011-5","volume":"3","author":"R.M. Karp","year":"1969","unstructured":"Karp, R.M., Miller, R.E.: Parallel program schemata. Journal of Computer and Systems Sciences\u00a03(2), 147\u2013195 (1969)","journal-title":"Journal of Computer and Systems Sciences"},{"issue":"1-3","key":"6_CR13","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1016\/S0304-3975(02)00646-1","volume":"297","author":"R. Mayr","year":"2003","unstructured":"Mayr, R.: Undecidable problems in unreliable computations. TCS\u00a0297(1-3), 337\u2013354 (2003)","journal-title":"TCS"},{"key":"6_CR14","doi-asserted-by":"crossref","unstructured":"Valero Ruiz, V., Cuartero Gomez, F., de Frutos Escrig, D.: On non-decidability of reachability for timed-arc Petri nets. In: Proc. 8th International Workshop on Petri Nets and Performance Models, pp. 88\u2013196 (1999)","DOI":"10.1109\/PNPM.1999.796565"},{"key":"6_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/3-540-48778-6_18","volume-title":"Formal Methods for Real-Time and Probabilistic Systems","author":"S. Tripakis","year":"1999","unstructured":"Tripakis, S.: Verifying progress in times systems. In: Katoen, J.-P. (ed.) AMAST-ARTS 1999, ARTS 1999, and AMAST-WS 1999. LNCS, vol.\u00a01601, pp. 299\u2013314. Springer, Heidelberg (1999)"},{"key":"6_CR16","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1007\/BF00289715","volume":"21","author":"R. Valk","year":"1985","unstructured":"Valk, R., Jantzen, M.: The Residue of Vector Sets with Applications to Decidability Problems in Petri Nets. Acta Informatica\u00a021, 643\u2013674 (1985)","journal-title":"Acta Informatica"}],"container-title":["Lecture Notes in Computer Science","FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30538-5_6.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,18]],"date-time":"2020-11-18T23:58:58Z","timestamp":1605743938000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30538-5_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540240587","9783540305385"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30538-5_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}