{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:48:38Z","timestamp":1740098918770,"version":"3.37.3"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319578606"},{"type":"electronic","value":"9783319578613"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"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":[[2017]]},"DOI":"10.1007\/978-3-319-57861-3_3","type":"book-chapter","created":{"date-parts":[[2017,5,4]],"date-time":"2017-05-04T02:10:40Z","timestamp":1493863840000},"page":"19-34","source":"Crossref","is-referenced-by-count":2,"title":["Resource Equivalences in Petri Nets"],"prefix":"10.1007","author":[{"given":"Irina A.","family":"Lomazova","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,5,5]]},"reference":[{"key":"3_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/3-540-55676-1_3","volume-title":"Application and Theory of Petri Nets 1992","author":"C Autant","year":"1992","unstructured":"Autant, C., Schnoebelen, P.: Place bisimulations in Petri nets. In: Jensen, K. (ed.) ICATPN 1992. LNCS, vol. 616, pp. 45\u201361. Springer, Heidelberg (1992). doi: 10.1007\/3-540-55676-1_3"},{"key":"3_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/978-3-642-04081-8_8","volume-title":"CONCUR 2009 - Concurrency Theory","author":"P Baldan","year":"2009","unstructured":"Baldan, P., Bonchi, F., Gadducci, F.: Encoding asynchronous interactions using open Petri nets. In: Bravetti, M., Zavattaro, G. (eds.) CONCUR 2009. LNCS, vol. 5710, pp. 99\u2013114. Springer, Heidelberg (2009). doi: 10.1007\/978-3-642-04081-8_8"},{"key":"3_CR3","first-page":"101","volume":"55","author":"VA Bashkin","year":"2003","unstructured":"Bashkin, V.A., Lomazova, I.A.: Petri nets and resource bisimulation. Fundam. Inf. 55, 101\u2013114 (2003). http:\/\/content.iospress.com\/articles\/fundamenta-informaticae\/fi55-2-02","journal-title":"Fundam. Inf."},{"key":"3_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/978-3-540-45145-7_4","volume-title":"Parallel Computing Technologies","author":"VA Bashkin","year":"2003","unstructured":"Bashkin, V.A., Lomazova, I.A.: Resource similarities in Petri net models of distributed systems. In: Malyshkin, V.E. (ed.) PaCT 2003. LNCS, vol. 2763, pp. 35\u201348. Springer, Heidelberg (2003). doi: 10.1007\/978-3-540-45145-7_4"},{"key":"3_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/11535294_3","volume-title":"Parallel Computing Technologies","author":"VA Bashkin","year":"2005","unstructured":"Bashkin, V.A., Lomazova, I.A.: Similarity of generalized resources in Petri nets. In: Malyshkin, V. (ed.) PaCT 2005. LNCS, vol. 3606, pp. 27\u201341. Springer, Heidelberg (2005). doi: 10.1007\/11535294_3"},{"key":"3_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-662-45730-6_1","volume-title":"Transactions on Petri Nets and Other Models of Concurrency IX","author":"VA Bashkin","year":"2014","unstructured":"Bashkin, V.A., Lomazova, I.A.: Decidability of $$k$$ k -soundness for workflow nets with an unbounded resource. In: Koutny, M., Haddad, S., Yakovlev, A. (eds.) Transactions on Petri Nets and Other Models of Concurrency IX. LNCS, vol. 8910, pp. 1\u201318. Springer, Heidelberg (2014). doi: 10.1007\/978-3-662-45730-6_1"},{"key":"3_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-319-47677-3_1","volume-title":"Dependable Software Engineering: Theories, Tools, and Applications","author":"X Dong","year":"2016","unstructured":"Dong, X., Fu, Y., Varacca, D.: Place bisimulation and liveness for open Petri nets. In: Fr\u00e4nzle, M., Kapur, D., Zhan, N. (eds.) SETTA 2016. LNCS, vol. 9984, pp. 1\u201317. Springer, Cham (2016). doi: 10.1007\/978-3-319-47677-3_1"},{"issue":"3","key":"3_CR8","doi-asserted-by":"crossref","first-page":"225","DOI":"10.3233\/FI-1999-37303","volume":"37","author":"B Farwer","year":"1999","unstructured":"Farwer, B.: A linear logic view of object Petri nets. Fundam. Inf. 37(3), 225\u2013246 (1999). http:\/\/dl.acm.org\/citation.cfm?id=2377296.2377299","journal-title":"Fundam. Inf."},{"key":"3_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/3-540-45575-2_26","volume-title":"Perspectives of System Informatics","author":"B Farwer","year":"2001","unstructured":"Farwer, B., Lomazova, I.: A systematic approach towards object-based Petri net formalisms. In: Bj\u00f8rner, D., Broy, M., Zamulin, A.V. (eds.) PSI 2001. LNCS, vol. 2244, pp. 255\u2013267. Springer, Heidelberg (2001). doi: 10.1007\/3-540-45575-2_26"},{"key":"3_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-319-45994-3_1","volume-title":"Reachability Problems","author":"A Finkel","year":"2016","unstructured":"Finkel, A.: The ideal theory for WSTS. In: Larsen, K.G., Potapov, I., Srba, J. (eds.) RP 2016. LNCS, vol. 9899, pp. 1\u201322. Springer, Cham (2016). doi: 10.1007\/978-3-319-45994-3_1"},{"issue":"1","key":"3_CR11","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!. Theoret. Comput. Sci. 256(1), 63\u201392 (2001). http:\/\/www.sciencedirect.com\/science\/article\/pii\/S030439750000102X","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"3_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0304-3975(87)90045-4","volume":"50","author":"JY Girard","year":"1987","unstructured":"Girard, J.Y.: Linear logic. Theoret. Comput. Sci. 50(1), 1\u2013101 (1987). http:\/\/www.sciencedirect.com\/science\/article\/pii\/0304397587900454","journal-title":"Theoret. Comput. Sci."},{"key":"3_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/978-3-540-40022-6_14","volume-title":"Petri Net Technology for Communication-Based Systems","author":"R Heckel","year":"2003","unstructured":"Heckel, R.: Open Petri nets as semantic model for workflow integration. In: Ehrig, H., Reisig, W., Rozenberg, G., Weber, H. (eds.) Petri Net Technology for Communication-Based Systems. LNCS, vol. 2472, pp. 281\u2013294. Springer, Heidelberg (2003). doi: 10.1007\/978-3-540-40022-6_14"},{"issue":"1","key":"3_CR14","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1112\/plms\/s3-2.1.326","volume":"s3\u20132","author":"G Higman","year":"1952","unstructured":"Higman, G.: Ordering by divisibility in abstract algebras. Proc. Lond. Math. Soc. s3\u20132(1), 326\u2013336 (1952). http:\/\/dx.doi.org\/10.1112\/plms\/s3-2.1.326","journal-title":"Proc. Lond. Math. Soc."},{"key":"3_CR15","unstructured":"Hirshfeld, Y.: Congruences in commutative semigroups. Technical report ECS-LFCS-94-291, Department of Computer Science, University of Edinburgh (1994)"},{"key":"3_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"581","DOI":"10.1007\/3-540-57785-8_173","volume-title":"STACS 94","author":"P Jan\u010dar","year":"1994","unstructured":"Jan\u010dar, P.: Decidability questions for bisimilarity of Petri nets and some related problems. In: Enjalbert, P., Mayr, E.W., Wagner, K.W. (eds.) STACS 1994. LNCS, vol. 775, pp. 581\u2013592. Springer, Heidelberg (1994). doi: 10.1007\/3-540-57785-8_173"},{"issue":"2","key":"3_CR17","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1016\/S0022-0000(69)80011-5","volume":"3","author":"RM Karp","year":"1969","unstructured":"Karp, R.M., Miller, R.E.: Parallel program schemata. J. Comput. Syst. Sci. 3(2), 147\u2013195 (1969). http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0022000069800115","journal-title":"J. Comput. Syst. Sci."},{"key":"3_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1007\/978-3-319-39086-4_3","volume-title":"Application and Theory of Petri Nets and Concurrency","author":"S Lasota","year":"2016","unstructured":"Lasota, S.: Decidability border for Petri nets with data: WQO dichotomy conjecture. In: Kordon, F., Moldt, D. (eds.) PETRI NETS 2016. LNCS, vol. 9698, pp. 20\u201336. Springer, Cham (2016). doi: 10.1007\/978-3-319-39086-4_3"},{"issue":"1","key":"3_CR19","doi-asserted-by":"crossref","first-page":"195","DOI":"10.3233\/FI-2000-43123410","volume":"43","author":"IA Lomazova","year":"2000","unstructured":"Lomazova, I.A.: Nested Petri nets - a formalism for specification and verification of multi-agent distributed systems. Fundam. Inf. 43(1), 195\u2013214 (2000). http:\/\/www.scopus.com\/inward\/record.url?eid=2-s2.0-0034250902&partnerID=40&md5=8a9efd42010e494aaaa3a09b99e97f25","journal-title":"Fundam. Inf."},{"issue":"3\u20134","key":"3_CR20","first-page":"283","volume":"47","author":"IA Lomazova","year":"2001","unstructured":"Lomazova, I.A.: Nested Petri nets: multi-level and recursive systems. Fundam. Inf. 47(3\u20134), 283\u2013293 (2001). http:\/\/dl.acm.org\/citation.cfm?id=1220035.1220044","journal-title":"Fundam. Inf."},{"issue":"1\u20132","key":"3_CR21","doi-asserted-by":"crossref","first-page":"129","DOI":"10.3233\/FI-2013-937","volume":"128","author":"IA Lomazova","year":"2013","unstructured":"Lomazova, I.A., Romanov, I.V.: Analyzing compatibility of services via resource conformance. Fundam. Inf. 128(1\u20132), 129\u2013141 (2013). http:\/\/dx.doi.org\/10.3233\/FI-2013-937","journal-title":"Fundam. Inf."},{"key":"3_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1007\/3-540-46562-6_18","volume-title":"Perspectives of System Informatics","author":"IA Lomazova","year":"2000","unstructured":"Lomazova, I.A., Schnoebelen, P.: Some decidability results for nested Petri Nets. In: Bj\u00f8ner, D., Broy, M., Zamulin, A.V. (eds.) PSI 1999. LNCS, vol. 1755, pp. 208\u2013220. Springer, Heidelberg (2000). doi: 10.1007\/3-540-46562-6_18"},{"key":"3_CR23","volume-title":"Communication and Concurrency","author":"R Milner","year":"1989","unstructured":"Milner, R.: Communication and Concurrency. Prentice-Hall Inc., Upper Saddle River (1989)"},{"key":"3_CR24","volume-title":"The Theory of Finitely Generated Commutative Semigroups","author":"L R\u00e9dei","year":"1965","unstructured":"R\u00e9dei, L.: The Theory of Finitely Generated Commutative Semigroups. Oxford University Press, New York (1965)"},{"issue":"34","key":"3_CR25","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. Theoret. Comput. Sci. 412(34), 4439\u20134451 (2011). http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0304397511003896","journal-title":"Theoret. Comput. Sci."},{"key":"3_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1007\/3-540-44988-4_23","volume-title":"Application and Theory of Petri Nets 2000","author":"P Schnoebelen","year":"2000","unstructured":"Schnoebelen, P., Sidorova, N.: Bisimulation and the reduction of Petri Nets. In: Nielsen, M., Simpson, D. (eds.) ICATPN 2000. LNCS, vol. 1825, pp. 409\u2013423. Springer, Heidelberg (2000). doi: 10.1007\/3-540-44988-4_23"},{"issue":"3","key":"3_CR27","doi-asserted-by":"publisher","first-page":"724","DOI":"10.1109\/TSMCA.2012.2210415","volume":"43","author":"N Sidorova","year":"2013","unstructured":"Sidorova, N., Stahl, C.: Soundness for resource-constrained workflow nets is decidable. IEEE Trans. Syst. Man Cybern.: Syst. 43(3), 724\u2013729 (2013)","journal-title":"IEEE Trans. Syst. Man Cybern.: Syst."}],"container-title":["Lecture Notes in Computer Science","Application and Theory of Petri Nets and Concurrency"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-57861-3_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,6]],"date-time":"2020-10-06T22:08:41Z","timestamp":1602022121000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-57861-3_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319578606","9783319578613"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-57861-3_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}