{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T04:28:35Z","timestamp":1743049715297,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642198045"},{"type":"electronic","value":"9783642198052"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-19805-2_11","type":"book-chapter","created":{"date-parts":[[2011,3,14]],"date-time":"2011-03-14T09:05:14Z","timestamp":1300093514000},"page":"153-167","source":"Crossref","is-referenced-by-count":5,"title":["Ordinal Theory for Expressiveness of Well Structured Transition Systems"],"prefix":"10.1007","author":[{"given":"Remi","family":"Bonnet","sequence":"first","affiliation":[]},{"given":"Alain","family":"Finkel","sequence":"additional","affiliation":[]},{"given":"Serge","family":"Haddad","sequence":"additional","affiliation":[]},{"given":"Fernando","family":"Rosa-Velardo","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"11_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/978-3-540-74915-8_11","volume-title":"Computer Science Logic","author":"P.A. Abdulla","year":"2007","unstructured":"Abdulla, P.A., Delzanno, G., Van Begin, L.: Comparing the Expressive Power of Well-Structured Transition Systems. In: Duparc, J., Henzinger, T.A. (eds.) CSL 2007. LNCS, vol.\u00a04646, pp. 99\u2013114. Springer, Heidelberg (2007)"},{"key":"11_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/978-3-642-00982-2_6","volume-title":"Language and Automata Theory and Applications","author":"P.A. Abdulla","year":"2009","unstructured":"Abdulla, P.A., Delzanno, G., Van Begin, L.: A Language-Based Comparison of Extensions of Petri Nets with and without Whole-Place Operations. In: Dediu, A.H., Ionescu, A.M., Mart\u00edn-Vide, C. (eds.) LATA 2009. LNCS, vol.\u00a05457, pp. 71\u201382. Springer, Heidelberg (2009)"},{"key":"11_CR3","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., Nylen, 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":"11_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1007\/978-3-540-48654-1_16","volume-title":"CONCUR \u201994: Concurrency Theory","author":"R. Alur","year":"1994","unstructured":"Alur, R., Courcoubetis, C., Henzinger, T.A.: The Observational Power of Clocks. In: Jonsson, B., Parrow, J. (eds.) CONCUR 1994. LNCS, vol.\u00a0836, pp. 162\u2013177. Springer, Heidelberg (1994)"},{"key":"11_CR5","unstructured":"Finkel, A., Bonnet, R., Haddad, S., Rosa-Velardo, F.: Comparing Petri Data Nets and Timed Petri Nets. LSV Research Report 10-23 (2010)"},{"key":"11_CR6","doi-asserted-by":"crossref","unstructured":"Finkel, A., Bonnet, R., Haddad, S., Rosa-Velardo, F.: Ordinal Theory for Expresiveness of Well-Structured Transition Systems. LSV Research Report 11-01 (2011)","DOI":"10.1007\/978-3-642-19805-2_11"},{"key":"11_CR7","doi-asserted-by":"crossref","unstructured":"Figueira, D., Figueira, S., Schmitz, S., Schnoebelen, P.: Ackermann and Primitive-Recursive Bounds with Dickson\u2019s Lemma. CoRR abs\/1007.2989 (2010)","DOI":"10.1109\/LICS.2011.39"},{"key":"11_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1007\/3-540-18088-5_43","volume-title":"Automata, Languages and Programming","author":"A. Finkel","year":"1987","unstructured":"Finkel, A.: A generalization of the procedure of karp and miller to well structured transition systems. In: Ottmann, T. (ed.) ICALP 1987. LNCS, vol.\u00a0267, pp. 499\u2013508. Springer, Heidelberg (1987)"},{"issue":"1-2","key":"11_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ic.2004.01.005","volume":"195","author":"A. Finkel","year":"2004","unstructured":"Finkel, A., McKenzie, P., Picaronny, C.: A well-structured framework for analysing petri net extensions. Information and Computation\u00a0195(1-2), 1\u201329 (2004)","journal-title":"Information and Computation"},{"key":"11_CR10","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., Van Begin, L.: Well-structured languages. Acta Informatica\u00a044, 249\u2013288 (2007)","journal-title":"Acta Informatica"},{"key":"11_CR11","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/1385-7258(77)90067-1","volume":"80","author":"D.H.J. Jongh de","year":"1977","unstructured":"de Jongh, D.H.J., Parikh, R.: Well partial orderings and hierarchies. Indagationes Mathematicae (Proceedings)\u00a080, 195\u2013207 (1977)","journal-title":"Indagationes Mathematicae (Proceedings)"},{"key":"11_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/3-540-63371-5_6","volume-title":"Parallel Computing Technologies","author":"O. Kouchnarenko","year":"1997","unstructured":"Kouchnarenko, O., Schnoebelen, P.: A Formal Framework for the Analysis of Recursive-Parallel Programs. In: Malyshkin, V.E. (ed.) PaCT 1997. LNCS, vol.\u00a01277, pp. 45\u201359. Springer, Heidelberg (1997)"},{"issue":"3","key":"11_CR13","first-page":"251","volume":"88","author":"R. Lazic","year":"2008","unstructured":"Lazic, R., Newcomb, T.C., Ouaknine, J., Roscoe, A.W., Worrell, J.: Nets with Tokens Which Carry Data. Fund. Informaticae\u00a088(3), 251\u2013274 (2008)","journal-title":"Fund. Informaticae"},{"issue":"3","key":"11_CR14","first-page":"329","volume":"88","author":"F. Rosa-Velardo","year":"2008","unstructured":"Rosa-Velardo, F., de Frutos-Escrig, D.: Name creation vs. replication in Petri Net systems. Fund. Informaticae\u00a088(3), 329\u2013356 (2008)","journal-title":"Fund. Informaticae"},{"key":"11_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"524","DOI":"10.1007\/978-3-642-13089-2_44","volume-title":"Language and Automata Theory and Applications","author":"F. Rosa-Velardo","year":"2010","unstructured":"Rosa-Velardo, F., Delzanno, G.: Language-Based Comparison of Petri Nets with black tokens, pure names and ordered data. In: Dediu, A.-H., Fernau, H., Mart\u00edn-Vide, C. (eds.) LATA 2010. LNCS, vol.\u00a06031, pp. 524\u2013535. Springer, Heidelberg (2010)"},{"key":"11_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/978-3-642-13675-7_12","volume-title":"Applications and Theory of Petri Nets","author":"F. Rosa-Velardo","year":"2010","unstructured":"Rosa-Velardo, F., de Frutos-Escrig, D.: Forward Analysis for Petri Nets with Name Creation. In: Lilius, J., Penczek, W. (eds.) PETRI NETS 2010. LNCS, vol.\u00a06128, pp. 185\u2013205. Springer, Heidelberg (2010)"},{"key":"11_CR17","unstructured":"Schmidt, D.: Well-partial orderings and their maximal order types. Fakult\u00e4t f\u00fcr Mathematik der Ruprecht-Karls-Universit\u00e4t Heidelberg. Habilitationsschrift (1979)"},{"key":"11_CR18","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","Foundations of Software Science and Computational Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-19805-2_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T06:52:34Z","timestamp":1558421554000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-19805-2_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642198045","9783642198052"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-19805-2_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}