{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T22:43:16Z","timestamp":1725576196677},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540231677"},{"type":"electronic","value":"9783540302063"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30206-3_24","type":"book-chapter","created":{"date-parts":[[2011,1,18]],"date-time":"2011-01-18T10:19:15Z","timestamp":1295345955000},"page":"343-362","source":"Crossref","is-referenced-by-count":11,"title":["Forward Reachability Analysis of Timed Petri Nets"],"prefix":"10.1007","author":[{"given":"Parosh Aziz","family":"Abdulla","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Johann","family":"Deneux","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pritha","family":"Mahata","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aletta","family":"Nyl\u00e9n","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"24_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1007\/BFb0028754","volume-title":"Computer Aided Verification","author":"P.A. Abdulla","year":"1998","unstructured":"Abdulla, P.A., Bouajjani, A., Jonsson, B.: On-the-fly analysis of systems with unbounded, lossy fifo channels. In: Y. Vardi, M. (ed.) CAV 1998. LNCS, vol.\u00a01427, pp. 305\u2013318. Springer, Heidelberg (1998)"},{"key":"24_CR2","doi-asserted-by":"crossref","unstructured":"Abdulla, P.A., \u010cera $\\bar{n}$ s, K., Jonsson, B., Yih-Kuen, T.: Algorithmic analysis of programs with well quasi-ordered domains. Information and Computation 160, 109\u2013127 (2000)","DOI":"10.1006\/inco.1999.2843"},{"key":"24_CR3","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":"24_CR4","doi-asserted-by":"crossref","unstructured":"Abdulla, P.A., Deneux, J., Mahata, P., Nyl\u00e9n, A.: Forward reachability analysis of timed petri nets. Technical Report 2003- 056, Dept. of Information Technology, Uppsala University, Sweden (2003), http:\/\/user.it.uu.se\/~pritha\/Papers\/tpn.ps","DOI":"10.1007\/978-3-540-30206-3_24"},{"key":"24_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":"24_CR6","series-title":"Lecture Notes in Computer Science","first-page":"1","volume-title":"Computer Aided Verification","author":"B. Boigelot","year":"1996","unstructured":"Boigelot, B., Godefroid, P.: Symbolic verification of communication protocols with infinite state spaces using QDDs. In: Alur, R., Henzinger, T.A. (eds.) CAV 1996. LNCS, vol.\u00a01102, pp. 1\u201312. Springer, Heidelberg (1996)"},{"key":"24_CR7","series-title":"Lecture Notes in Computer Science","volume-title":"Automata, Languages and Programming","author":"A. Bouajjani","year":"1997","unstructured":"Bouajjani, A., Habermehl, P.: Symbolic reachability analysis of fifo-channel systems with nonregular sets of configurations. In: Degano, P., Gorrieri, R., Marchetti-Spaccamela, A. (eds.) ICALP 1997. LNCS, vol.\u00a01256, Springer, Heidelberg (1997)"},{"key":"24_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/BFb0028755","volume-title":"Computer Aided Verification","author":"S. Bensalem","year":"1998","unstructured":"Bensalem, S., Lakhnech, Y., Owre, S.: Computing abstractions of infinite state systems automatically and compositionally. In: Y. Vardi, M. (ed.) CAV 1998. LNCS, vol.\u00a01427, pp. 319\u2013331. Springer, Heidelberg (1998)"},{"key":"24_CR9","unstructured":"Bowden, F.D.J.: Modelling time in Petri nets. In: Proc. Second Australian-Japan Workshop on Stochastic Models (1996)"},{"key":"24_CR10","first-page":"287","volume-title":"Protocol Specification, Testing, and Verification IX","author":"R. Cleaveland","year":"1989","unstructured":"Cleaveland, R., Parrow, J., Steffen, B.: A semantics-based tool for the verification of finite-state systems. In: Brinksma, Scollo, Vissers (eds.) Protocol Specification, Testing, and Verification IX, pp. 287\u2013302. North-Holland, Amsterdam (1989)"},{"key":"24_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"426","DOI":"10.1007\/3-540-46419-0_29","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"G. Delzanno","year":"2000","unstructured":"Delzanno, G., Raskin, J.F.: Symbolic representation of upward-closed sets. In: Schwartzbach, M.I., Graf, S. (eds.) TACAS 2000. LNCS, vol.\u00a01785, pp. 426\u2013440. Springer, Heidelberg (2000)"},{"key":"24_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"566","DOI":"10.1007\/3-540-44618-4_40","volume-title":"CONCUR 2000 - Concurrency Theory","author":"A. Finkel","year":"2000","unstructured":"Finkel, A., Purushothaman Iyer, S., Sutre, G.: Well-abstracted transition systems. In: Palamidessi, C. (ed.) CONCUR 2000. LNCS, vol.\u00a01877, pp. 566\u2013580. Springer, Heidelberg (2000)"},{"key":"24_CR13","unstructured":"Finkel, A., Raskin, J.-F., Samuelides, M., Van Begin, L.: Monotonic extensions of petri nets: Forward and backward search revisited. In: Proc. Infinity 2002 (2002)"},{"key":"24_CR14","unstructured":"Godskesen, J.C.: Timed Modal Specifications. PhD thesis, Aalborg University (1994)"},{"issue":"2","key":"24_CR15","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"},{"key":"24_CR16","unstructured":"Lakhnech, Y., Bensalem, S., Berezin, S., Owre, S.: Symbolic techniques for parametric reasoning about counter and clock systems. In: Proc. TACAS 2001. LNCS, vol.\u00a02031 (2001)"},{"key":"24_CR17","doi-asserted-by":"crossref","unstructured":"Larsen, K.G., Pettersson, P., Yi, W.: UPPAAL in a nutshell. Software Tools for Technology Transfer 1(1-2) (1997)","DOI":"10.1007\/s100090050010"},{"key":"24_CR18","series-title":"Lecture Notes in Computer Science","volume-title":"LATIN 2000: Theoretical Informatics","author":"R. Mayr","year":"2000","unstructured":"Mayr, R.: Undecidable problems in unreliable computations. In: Gonnet, G.H., Viola, A. (eds.) LATIN 2000. LNCS, vol.\u00a01776, Springer, Heidelberg (2000)"},{"key":"24_CR19","doi-asserted-by":"crossref","unstructured":"Nielson, M., Sassone, V., Srba, J.: Towards a distributed time for petri nets. In: Colom, J.-M., Koutny, M. (eds.) ICATPN 2001. LNCS, vol.\u00a02075, pp. 23\u201331. Springer, Heidelberg (2001)","DOI":"10.1007\/3-540-45740-2_3"},{"key":"24_CR20","unstructured":"Vardi, M.Y., Wolper, P.: An automata-theoretic approach to automatic program verification. In: Proc. LICS 1986, June 1986, pp. 332\u2013344 (1986)"},{"key":"24_CR21","doi-asserted-by":"crossref","unstructured":"Yovine, S.: Kronos: A verification tool for real-time systems. Journal of Software Tools for Technology Transfer 1(1-2) (1997)","DOI":"10.1007\/s100090050009"}],"container-title":["Lecture Notes in Computer Science","Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30206-3_24.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,17]],"date-time":"2021-11-17T15:28:50Z","timestamp":1637162930000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30206-3_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540231677","9783540302063"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30206-3_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}