{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T04:57:29Z","timestamp":1725771449062},"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_42","type":"book-chapter","created":{"date-parts":[[2014,2,5]],"date-time":"2014-02-05T08:52:25Z","timestamp":1391590345000},"page":"516-527","source":"Crossref","is-referenced-by-count":2,"title":["Expressiveness of Dynamic Networks of Timed Petri Nets"],"prefix":"10.1007","author":[{"given":"Mar\u00eda","family":"Martos-Salgado","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fernando","family":"Rosa-Velardo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1-2","key":"42_CR1","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1006\/inco.1999.2843","volume":"160","author":"P.A. Abdulla","year":"2000","unstructured":"Abdulla, P.A., Cerans, K., Jonsson, B., Tsay, Y.K.: Algorithmic analysis of programs with well quasi-ordered domains. Inf. Comput\u00a0160(1-2), 109\u2013127 (2000)","journal-title":"Inf. Comput"},{"issue":"3","key":"42_CR2","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1016\/j.ic.2010.11.003","volume":"209","author":"P.A. Abdulla","year":"2011","unstructured":"Abdulla, P.A., Delzanno, G., Begin, L.V.: A classification of the expressive power of well-structured transition systems. Inf. Comput\u00a0209(3), 248\u2013279 (2011)","journal-title":"Inf. Comput"},{"key":"42_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1007\/BFb0054179","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"P.A. Abdulla","year":"1998","unstructured":"Abdulla, P.A., Jonsson, B.: Verifying networks of timed processes (extended abstract). In: Steffen, B. (ed.) TACAS 1998. LNCS, vol.\u00a01384, pp. 298\u2013312. Springer, Heidelberg (1998)"},{"key":"42_CR4","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":"42_CR5","doi-asserted-by":"crossref","unstructured":"Bonnet, R., Finkel, A., Haddad, S., Rosa-Velardo, F.: Ordinal theory for expressiveness of well structured transition systems. Inf. Comput. (2012)","DOI":"10.1007\/978-3-642-19805-2_11"},{"issue":"3","key":"42_CR6","first-page":"225","volume":"88","author":"M. Boyer","year":"2008","unstructured":"Boyer, M., Roux, O.H.: On the compared expressiveness of arc, place and transition time Petri nets. Fundam. Inform.\u00a088(3), 225\u2013249 (2008)","journal-title":"Fundam. Inform."},{"key":"42_CR7","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1016\/j.tcs.2012.09.021","volume":"467","author":"G. Delzanno","year":"2013","unstructured":"Delzanno, G., Rosa-Velardo, F.: On the coverability and reachability languages of monotonic extensions of petri nets. Theor. Comput. Sci.\u00a0467, 12\u201329 (2013)","journal-title":"Theor. Comput. Sci."},{"issue":"1-2","key":"42_CR8","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/S0304-3975(00)00102-X","volume":"256","author":"A. Finkel","year":"2001","unstructured":"Finkel, A., Schnoebelen, P.: Well-structured transition systems everywhere! Theor. Comput. Sci.\u00a0256(1-2), 63\u201392 (2001)","journal-title":"Theor. Comput. Sci."},{"issue":"3-4","key":"42_CR9","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/s00236-007-0050-3","volume":"44","author":"G. Geeraerts","year":"2007","unstructured":"Geeraerts, G., Raskin, J.-F., Begin, L.V.: Well-structured languages. Acta Inf.\u00a044(3-4), 249\u2013288 (2007)","journal-title":"Acta Inf."},{"key":"42_CR10","doi-asserted-by":"crossref","unstructured":"Haddad, S., Schmitz, S., Schnoebelen, P.: The ordinal-recursive complexity of timed-arc Petri nets, data nets, and other enriched nets. IEEE LICS, 355\u2013364 (2012)","DOI":"10.1109\/LICS.2012.46"},{"key":"42_CR11","doi-asserted-by":"crossref","unstructured":"de Jongh, D.H.J., Parikh, R.: Well partial orderings and hierarchies. Indagationes Mathematicae, 195\u2013207 (1977)","DOI":"10.1016\/1385-7258(77)90067-1"},{"key":"42_CR12","unstructured":"Martos-Salgado, M., Rosa-Velardo, F.: Dynamic networks of infinite-state timed processes. Technical Report 9\/13, UCM (2013), \n                    \n                      http:\/\/antares.sip.ucm.es\/~frosa\/"},{"issue":"34","key":"42_CR13","doi-asserted-by":"publisher","first-page":"4439","DOI":"10.1016\/j.tcs.2011.05.007","volume":"412","author":"F. Rosa-Velardo","year":"2011","unstructured":"Rosa-Velardo, F., de Frutos-Escrig, D.: Decidability and complexity of Petri nets with unordered data. Theor. Comput. Sci.\u00a0412(34), 4439\u20134451 (2011)","journal-title":"Theor. Comput. Sci."},{"key":"42_CR14","unstructured":"Schmidt, D.: Well-partial orderings and their maximal order types. Habilitationsscrift (1979)"},{"key":"42_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"488","DOI":"10.1007\/978-3-642-03073-4_50","volume-title":"Mathematical Theory and Computational Practice","author":"A. Weiermann","year":"2009","unstructured":"Weiermann, A.: A computation of the maximal order type of the term ordering on finite multisets. In: Ambos-Spies, K., L\u00f6we, B., Merkle, W. (eds.) CiE 2009. LNCS, vol.\u00a05635, pp. 488\u2013498. Springer, Heidelberg (2009)"}],"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_42","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,26]],"date-time":"2019-05-26T01:57:20Z","timestamp":1558835840000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-04921-2_42"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319049205","9783319049212"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-04921-2_42","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}