{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:10:44Z","timestamp":1760202644588},"publisher-location":"Berlin, Heidelberg","reference-count":60,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642381423"},{"type":"electronic","value":"9783642381430"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38143-0_5","type":"book-chapter","created":{"date-parts":[[2013,4,22]],"date-time":"2013-04-22T08:13:53Z","timestamp":1366618433000},"page":"162-224","source":"Crossref","is-referenced-by-count":10,"title":["Structure Theory of Petri Nets"],"prefix":"10.1007","author":[{"given":"Eike","family":"Best","sequence":"first","affiliation":[]},{"given":"Harro","family":"Wimmel","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"5_CR1","doi-asserted-by":"crossref","unstructured":"Baeten, J.C.M., Weijland, W.P.: Process algebra. In: Cambridge Tracts in Theoretical Computer Science, vol.\u00a018. Cambridge University Press (1990)","DOI":"10.1017\/CBO9780511624193"},{"key":"5_CR2","doi-asserted-by":"crossref","first-page":"33","DOI":"10.3233\/FI-2009-0086","volume":"93","author":"K. Barylska","year":"2009","unstructured":"Barylska, K., Ochma\u0144ski, E.: Levels of Persistency in Place\/Transition Systems. Fundamenta Informaticae\u00a093, 33\u201343 (2009)","journal-title":"Fundamenta Informaticae"},{"key":"5_CR3","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/s00236-009-0095-6","volume":"46","author":"E. Best","year":"2009","unstructured":"Best, E., Darondeau, P.: A decomposition theorem for finite persistent transition systems. Acta Informatica\u00a046, 237\u2013254 (2009)","journal-title":"Acta Informatica"},{"key":"5_CR4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.3233\/FI-2011-575","volume":"112","author":"E. Best","year":"2011","unstructured":"Best, E.: P Darondeau: Separability in persistent Petri nets. Fundamenta Informaticae\u00a0112, 1\u201325 (2011)","journal-title":"Fundamenta Informaticae"},{"key":"5_CR5","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1016\/0304-3975(92)90048-K","volume":"101","author":"E. Best","year":"1992","unstructured":"Best, E., Desel, J., Esparza, J.: Traps characterize home states in free choice systems. Theoretical Computer Science\u00a0101, 161\u2013176 (1992)","journal-title":"Theoretical Computer Science"},{"key":"5_CR6","first-page":"75","volume":"80","author":"E. Best","year":"2007","unstructured":"Best, E., Darondeau, P., Wimmel, H.: Making Petri nets safe and free of internal transitions. Fundamenta Informaticae\u00a080, 75\u201390 (2007)","journal-title":"Fundamenta Informaticae"},{"key":"5_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1007\/3-540-15204-0_4","volume-title":"Advances in Petri Nets 1984","author":"E. Best","year":"1985","unstructured":"Best, E., Merceron, A.: Frozen tokens and D-continuity: a study in relating system properties to process properties. In: Rozenberg, G. (ed.) APN 1984. LNCS, vol.\u00a0188, pp. 48\u201361. Springer, Heidelberg (1985)"},{"key":"5_CR8","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/BF00289141","volume":"21","author":"E. Best","year":"1984","unstructured":"Best, E., Voss, K.: Free choice systems have home states. Acta Informatica\u00a021, 89\u2013100 (1984)","journal-title":"Acta Informatica"},{"issue":"12","key":"5_CR9","doi-asserted-by":"publisher","first-page":"1368","DOI":"10.1109\/9.106153","volume":"36","author":"J. Campos","year":"1991","unstructured":"Campos, J., Chiola, G., Silva, M.: Properties and performance bounds for closed free choice synchronized monoclass queueing networks. IEEE Transactions on Automatic Control\u00a036(12), 1368\u20131381 (1991)","journal-title":"IEEE Transactions on Automatic Control"},{"key":"5_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/3-540-57208-2_11","volume-title":"CONCUR\u201993","author":"S. Christensen","year":"1993","unstructured":"Christensen, S., Hirshfeld, Y., Stirling, C.: Bisimulation equivalence is decidable for basic parallel processes. In: Best, E. (ed.) CONCUR 1993. LNCS, vol.\u00a0715, pp. 143\u2013157. Springer, Heidelberg (1993)"},{"issue":"2","key":"5_CR11","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1006\/inco.1995.1129","volume":"121","author":"S. Christensen","year":"1995","unstructured":"Christensen, S., H\u00fcttel, H., Stirling, C.: Bisimulation equivalence is decidable for all context-free processes. Information and Computation\u00a0121(2), 143\u2013148 (1995)","journal-title":"Information and Computation"},{"key":"5_CR12","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1016\/S0022-0000(71)80013-2","volume":"5","author":"F. Commoner","year":"1971","unstructured":"Commoner, F., Holt, A., Even, S., Pnueli, A.: Marked directed graphs. Journal of Computer and System Sciences\u00a05, 511\u2013523 (1971)","journal-title":"Journal of Computer and System Sciences"},{"key":"5_CR13","doi-asserted-by":"crossref","unstructured":"Desel, J.: Struktur und Analyse von Free-Choice-Petrinetzen. In: Dissertation. Deutscher Universit\u00e4tsverlag, Vieweg (1992)","DOI":"10.1007\/978-3-663-14543-1"},{"key":"5_CR14","doi-asserted-by":"crossref","unstructured":"Desel, J.: Petrinetze, lineare Algebra und lineare Programmierung. Teubner-Texte zur Informatik, vol.\u00a026. Band (1998)","DOI":"10.1007\/978-3-322-95382-7"},{"key":"5_CR15","doi-asserted-by":"crossref","unstructured":"Desel, J., Esparza, J.: Free choice Petri nets. Cambridge Tracts in Theoretical Computer Science, vol.\u00a040. Cambridge University Press (1995)","DOI":"10.1017\/CBO9780511526558"},{"key":"5_CR16","unstructured":"Diestel, R.: Graph theory, http:\/\/diestel-graph-theory.com\/"},{"key":"5_CR17","doi-asserted-by":"crossref","first-page":"13","DOI":"10.3233\/FI-1997-3112","volume":"31","author":"J. Esparza","year":"1997","unstructured":"Esparza, J.: Petri nets, commutative context-free grammars, and basic parallel processes. Fundamenta Informaticae\u00a031, 13\u201326 (1997)","journal-title":"Fundamenta Informaticae"},{"issue":"1-2","key":"5_CR18","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/S0304-3975(97)00235-1","volume":"198","author":"J. Esparza","year":"1998","unstructured":"Esparza, J.: Reachability in live and safe free-choice Petri nets is NP-complete. Theoretical Computer Science\u00a0198(1-2), 211\u2013224 (1998)","journal-title":"Theoretical Computer Science"},{"key":"5_CR19","first-page":"1","volume":"124","author":"J. Farkas","year":"1902","unstructured":"Farkas, J.: \u00dcber die Theorie der einfachen Ungleichungen. Journal f\u00fcr die Reine und Angewandte Mathematik\u00a0124, 1\u201324 (1902)","journal-title":"Journal f\u00fcr die Reine und Angewandte Mathematik"},{"key":"5_CR20","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1016\/S0022-0000(03)00039-4","volume":"66","author":"B. Gaujal","year":"2003","unstructured":"Gaujal, B., Haar, S., Mairesse, J.: Blocking a transition in a free choice net and what it tells about its throughput. Journal of Computer and System Sciences\u00a066, 515\u2013548 (2003)","journal-title":"Journal of Computer and System Sciences"},{"key":"5_CR21","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/BF00264027","volume":"2","author":"H.J. Genrich","year":"1973","unstructured":"Genrich, H.J., Lautenbach, K.: Synchronisationsgraphen. Acta Informatica\u00a02, 143\u2013161 (1973)","journal-title":"Acta Informatica"},{"key":"5_CR22","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1016\/0304-3975(84)90137-3","volume":"30","author":"H.J. Genrich","year":"1984","unstructured":"Genrich, H.J., Thiagarajan, P.S.: A theory of bipolar synchronization schemes. Theoretical Computer Science\u00a030, 241\u2013318 (1984)","journal-title":"Theoretical Computer Science"},{"key":"5_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/978-3-642-23217-6_4","volume-title":"CONCUR 2011 \u2013 Concurrency Theory","author":"R.J. Glabbeek van","year":"2011","unstructured":"van Glabbeek, R.J., Goltz, U., Schicke, J.-W.: On causal semantics of Petri nets. In: Katoen, J.-P., K\u00f6nig, B. (eds.) CONCUR 2011. LNCS, vol.\u00a06901, pp. 43\u201359. Springer, Heidelberg (2011)"},{"key":"5_CR24","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/BF01442864","volume":"6","author":"P. Gordan","year":"1873","unstructured":"Gordan, P.: \u00dcber die Aufl\u00f6sung linearer Gleichungen mit reellen Coefficienten. Mathematische Annalen\u00a06, 23\u201328 (1873)","journal-title":"Mathematische Annalen"},{"key":"5_CR25","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1016\/0020-0190(80)90026-5","volume":"11","author":"J. Grabowski","year":"1980","unstructured":"Grabowski, J.: The decidability of persistence for vector addition systems. Information Processing Letters\u00a011, 20\u201323 (1980)","journal-title":"Information Processing Letters"},{"key":"5_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"466","DOI":"10.1007\/978-3-642-14162-1_39","volume-title":"Automata, Languages and Programming","author":"P. Habermehl","year":"2010","unstructured":"Habermehl, P., Meyer, R., Wimmel, H.: The downward-closure of Petri net languages. In: Abramsky, S., Gavoille, C., Kirchner, C., Meyer auf der Heide, F., Spirakis, P.G. (eds.) ICALP 2010. LNCS, vol.\u00a06199, pp. 466\u2013477. Springer, Heidelberg (2010)"},{"key":"5_CR27","unstructured":"Hack, M.H.T.: Analysis of production schemata by Petri nets. TR\u201394, MIT\u2013MAC (1972); Corrections (1974)"},{"key":"5_CR28","unstructured":"Hack, M.H.T.: Decision problems for Petri nets and vector addition systems. Computation Structures Memo 95, Project MAC, MIT (1974)"},{"key":"5_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/3-540-44919-1_22","volume-title":"Applications and Theory of Petri Nets 2003","author":"K. Hee van","year":"2003","unstructured":"van Hee, K., Sidorova, N., Voorhoeve, M.: Soundness and separability of workflow nets in the stepwise refinement approach. In: van der Aalst, W.M.P., Best, E. (eds.) ICATPN 2003. LNCS, vol.\u00a02679, pp. 337\u2013356. Springer, Heidelberg (2003)"},{"issue":"2","key":"5_CR30","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/0304-3975(92)90329-E","volume":"93","author":"K. Hiraishi","year":"1992","unstructured":"Hiraishi, K., Ichikawa, A.: On structural conditions for weak persistency and semilinearity of Petri nets. Theoretical Computer Science\u00a093(2), 185\u2013199 (1992)","journal-title":"Theoretical Computer Science"},{"issue":"3","key":"5_CR31","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1016\/0304-3975(89)90053-4","volume":"64","author":"R.R. Howell","year":"1989","unstructured":"Howell, R.R., Rosier, L.E.: Problems concerning fairness and temporal logic for conflict-free Petri nets. Theoretical Computer Science\u00a064(3), 305\u2013329 (1989)","journal-title":"Theoretical Computer Science"},{"key":"5_CR32","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 System Sciences\u00a03, 147\u2013195 (1969)","journal-title":"Journal of Computer and System Sciences"},{"key":"5_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1007\/3-540-07135-0_113","volume-title":"Parallel Processing","author":"R.M. Keller","year":"1975","unstructured":"Keller, R.M.: A fundamental theorem of asynchronous parallel computation. In: Tse-Yun, F. (ed.) Parallel Processing. LNCS, vol.\u00a024, pp. 102\u2013112. Springer, Heidelberg (1975)"},{"key":"5_CR34","doi-asserted-by":"crossref","unstructured":"Kosaraju, S.R.: Decidability of reachability in vector addition systems. In: Proceedings of the 14th Annual ACM STOC, pp. 267\u2013281 (1982)","DOI":"10.1145\/800070.802201"},{"key":"5_CR35","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/0304-3975(92)90173-D","volume":"99","author":"J.L. Lambert","year":"1992","unstructured":"Lambert, J.L.: A structure to decide reachability in Petri nets. Theoretical Computer Science\u00a099, 79\u2013104 (1992)","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"5_CR36","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1109\/TSE.1977.229904","volume":"3","author":"L. Lamport","year":"1977","unstructured":"Lamport, L.: Proving the correctness of multiprocess programs. IEEE Transactions on Software Engineering\u00a03(2), 125\u2013143 (1977)","journal-title":"IEEE Transactions on Software Engineering"},{"key":"5_CR37","unstructured":"Lamport, L.: Personal communication (around 1995), http:\/\/research.microsoft.com\/en-us\/um\/people\/lamport\/pubs\/pubs.html entry 23 (Last accessed April 14, 2012)"},{"issue":"3","key":"5_CR38","doi-asserted-by":"publisher","first-page":"352","DOI":"10.1145\/322077.322079","volume":"25","author":"L.H. Landweber","year":"1978","unstructured":"Landweber, L.H., Robertson, E.L.: Properties of conflict-free and persistent Petri nets. Journal of the ACM\u00a025(3), 352\u2013364 (1978)","journal-title":"Journal of the ACM"},{"key":"5_CR39","unstructured":"Lautenbach, K.: Exakte Bedingungen der Lebendigkeit f\u00fcr eine Klasse von Petri-Netzen. GMD, Bericht Nr.\u00a082 (Dissertation) (1973)"},{"key":"5_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"358","DOI":"10.1007\/3-540-58152-9_20","volume-title":"Application and Theory of Petri Nets 1994","author":"K. Lautenbach","year":"1994","unstructured":"Lautenbach, K., Ridder, H.: Liveness in bounded Petri nets which are covered by T-invariants. In: Valette, R. (ed.) ICATPN 1994. LNCS, vol.\u00a0815, pp. 358\u2013375. Springer, Heidelberg (1994)"},{"key":"5_CR41","doi-asserted-by":"crossref","unstructured":"Leroux, J.: The general vector addition system reachability problem by Presburger inductive invariants. In: 24th IEEE Symposium on Logic in Computer Science (LICS 2009), Los Angeles, California, USA, August 11-14, pp. 4\u201313 (2009)","DOI":"10.1109\/LICS.2009.10"},{"issue":"4","key":"5_CR42","first-page":"628","volume":"E81-A","author":"T. Matsumoto","year":"1998","unstructured":"Matsumoto, T., Mayano, Y.: Reachability criterion for Petri nets with known firing vectors. IEICE Trans. Fundamentals\u00a0E81-A(4), 628\u2013634 (1998)","journal-title":"IEICE Trans. Fundamentals"},{"key":"5_CR43","unstructured":"Mayr, E.W.: Ein Algorithmus f\u00fcr das allgemeine Erreichbarkeitsproblem bei Petrinetzen und damit zusammenh\u00e4ngende Probleme. Technischer Bericht der Technischen Universit\u00e4t M\u00fcnchen TUM-I8010 (Dissertation). Institut f\u00fcr Informatik (1980)"},{"issue":"3","key":"5_CR44","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1137\/0213029","volume":"13","author":"E.W. Mayr","year":"1984","unstructured":"Mayr, E.W.: An algorithm for the general Petri net reachability problem. SIAM Journal of Computing\u00a013(3), 441\u2013460 (1984)","journal-title":"SIAM Journal of Computing"},{"issue":"4","key":"5_CR45","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1109\/5.24143","volume":"77","author":"T. Murata","year":"1989","unstructured":"Murata, T.: Petri nets: properties, analysis and applications. Proceedings of the IEEE\u00a077(4), 541\u2013580 (1989)","journal-title":"Proceedings of the IEEE"},{"key":"5_CR46","unstructured":"Peterson, J.L.: Petri net theory and the modeling of systems. Prentice-Hall (1981)"},{"key":"5_CR47","unstructured":"Petri, C.A.: Kommunikation mit Automaten. Dissertation, Institut f\u00fcr Instrumentelle Mathematik, Bonn, Schriften des IMM Nr.\u00a02 (1962)"},{"key":"5_CR48","unstructured":"Priese, L., Wimmel, H.: Petri-Netze, 376 pages. Springer (2003) ISBN: 3-540-44289-8"},{"issue":"1","key":"5_CR49","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1142\/S0218126698000092","volume":"8","author":"L. Recalde","year":"1998","unstructured":"Recalde, L., Teruel, E., Silva, M.: On linear algebraic techniques for liveness analysis of P\/T Systems. Journal of Circuits, Systems, and Computers\u00a08(1), 223\u2013265 (1998)","journal-title":"Journal of Circuits, Systems, and Computers"},{"key":"5_CR50","unstructured":"Reisig, W.: Petri nets. EATCS Monographs on Theoretical Computer Science, vol.\u00a04. Springer (1985)"},{"key":"5_CR51","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"352","DOI":"10.1007\/3-540-11494-7_23","volume-title":"International Symposium on Programming","author":"J. Rushby","year":"1982","unstructured":"Rushby, J.: Proof of Separability \u2013 a Verification Technique for a Class of Security Kernels. In: Dezani-Ciancaglini, M., Montanari, U. (eds.) Programming 1982. LNCS, vol.\u00a0137, pp. 352\u2013367. Springer, Heidelberg (1982)"},{"key":"5_CR52","unstructured":"Schrijver, A.: Theory of linear and integer programming. Wiley (1986)"},{"key":"5_CR53","doi-asserted-by":"crossref","unstructured":"Teruel, E., Chrz\u0105stowski-Wachtel, P., Colom, J.M., Silva, M.: On weighted T-systems. In: Jensen, K. (ed.) ICATPN 1992. LNCS, vol.\u00a0616, Springer, Heidelberg (1992)","DOI":"10.1007\/3-540-55676-1_20"},{"issue":"1-2","key":"5_CR54","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1016\/0304-3975(95)00124-7","volume":"153","author":"E. Teruel","year":"1996","unstructured":"Teruel, E., Silva, M.: Structure theory of equal conflict systems. Theoretical Computer Science\u00a0153(1-2), 271\u2013300 (1996); Special volume on Petri nets","journal-title":"Theoretical Computer Science"},{"key":"5_CR55","doi-asserted-by":"crossref","first-page":"1","DOI":"10.3233\/FI-2009-164","volume":"96","author":"J. Wehler","year":"2009","unstructured":"Wehler, J.: Free-choice Petri nets without frozen tokens, and bipolar synchronization systems. Fundamenta Informaticae\u00a096, 1\u201338 (2009)","journal-title":"Fundamenta Informaticae"},{"key":"5_CR56","doi-asserted-by":"publisher","first-page":"532","DOI":"10.1016\/j.jcss.2009.10.001","volume":"76","author":"J. Wehler","year":"2010","unstructured":"Wehler, J.: Simplified proof of the blocking theorem for free-choice Petri nets. Journal of Computer and System Sciences\u00a076, 532\u2013537 (2010)","journal-title":"Journal of Computer and System Sciences"},{"key":"5_CR57","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"426","DOI":"10.1007\/978-3-540-27793-4_24","volume-title":"Applications and Theory of Petri Nets 2004","author":"H. Wimmel","year":"2004","unstructured":"Wimmel, H.: Infinity of intermediate states is decidable for petri nets. In: Cortadella, J., Reisig, W. (eds.) ICATPN 2004. LNCS, vol.\u00a03099, pp. 426\u2013434. Springer, Heidelberg (2004)"},{"issue":"3","key":"5_CR58","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1016\/0020-0190(81)90117-4","volume":"13","author":"H. Yamasaki","year":"1981","unstructured":"Yamasaki, H.: On weak persistency of Petri nets. Information Processing Letters\u00a013(3), 94\u201397 (1981)","journal-title":"Information Processing Letters"},{"key":"5_CR59","first-page":"4","volume":"60","author":"H. Yamasaki","year":"2001","unstructured":"Yamasaki, H., Huang, J.S., Murata, T.: Reachability analysis of Petri nets via structural and behavioral classifications of transitions. Petri Net Newsletter\u00a060, 4\u201321 (2001); Gesellschaft f\u00fcr Informatik","journal-title":"Petri Net Newsletter"},{"key":"5_CR60","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/3-540-45071-8_17","volume-title":"Computing and Combinatorics","author":"H. Yen","year":"2003","unstructured":"Yen, H., Yu, L.: Petri nets with simple circuits. In: Warnow, T.J., Zhu, B. (eds.) COCOON 2003. LNCS, vol.\u00a02697, pp. 149\u2013158. Springer, Heidelberg (2003)"}],"container-title":["Lecture Notes in Computer Science","Transactions on Petri Nets and Other Models of Concurrency VII"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38143-0_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,7,25]],"date-time":"2020-07-25T14:38:05Z","timestamp":1595687885000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38143-0_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642381423","9783642381430"],"references-count":60,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38143-0_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}