{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:08:43Z","timestamp":1725559723126},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540275800"},{"type":"electronic","value":"9783540316916"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11523468_118","type":"book-chapter","created":{"date-parts":[[2010,7,18]],"date-time":"2010-07-18T18:58:59Z","timestamp":1279479539000},"page":"1462-1473","source":"Crossref","is-referenced-by-count":6,"title":["Signaling P Systems and Verification Problems"],"prefix":"10.1007","author":[{"given":"Cheng","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhe","family":"Dang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Oscar H.","family":"Ibarra","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hsu-Chun","family":"Yen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"118_CR1","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/0304-3975(94)90010-8","volume":"126","author":"R. Alur","year":"1994","unstructured":"Alur, R., Dill, D.L.: A theory of timed automata. TCS\u00a0126(2), 183\u2013235 (1994)","journal-title":"TCS"},{"unstructured":"Ardelean, I.I., Cavaliere, M., Sburlan, D.: Computing using signals: From cells to P Systems. In: Second Brainstorming Week on Membrane Computing, Sevilla, Spain, February 2-7, pp. 60\u201373 (2004)","key":"118_CR2"},{"key":"118_CR3","volume-title":"The World of the Cell","author":"W.M. Becker","year":"2003","unstructured":"Becker, W.M., Kleinsmith, L.J., Hardin, J.: The World of the Cell, 5th edn. Benjamin Cummings, San Francisco (2003)","edition":"5"},{"issue":"10","key":"118_CR4","doi-asserted-by":"publisher","first-page":"695","DOI":"10.1007\/s00236-002-0090-7","volume":"38","author":"P. Bottoni","year":"2002","unstructured":"Bottoni, P., Martin-Vide, C., Paun, G., Rozenberg, G.: Membrane systems with promoters\/inhibitors. Acta Informatica\u00a038(10), 695\u2013720 (2002)","journal-title":"Acta Informatica"},{"issue":"4","key":"118_CR5","doi-asserted-by":"publisher","first-page":"747","DOI":"10.1145\/325478.325480","volume":"21","author":"T. Bultan","year":"1999","unstructured":"Bultan, T., Gerber, R., Pugh, W.: Model-checking concurrent systems with unbounded integer variables: symbolic representations, approximations, and experimental results. TOPLAS\u00a021(4), 747\u2013789 (1999)","journal-title":"TOPLAS"},{"issue":"2","key":"118_CR6","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1145\/5397.5399","volume":"8","author":"E.M. Clarke","year":"1986","unstructured":"Clarke, E.M., Emerson, E.A., Sistla, A.P.: Automatic verification of finite-state concurrent systems using temporal logic specifications. TOPLAS\u00a08(2), 244\u2013263 (1986)","journal-title":"TOPLAS"},{"key":"118_CR7","volume-title":"Model Checking","author":"E.M. Clarke","year":"1999","unstructured":"Clarke, E.M., Grumberg, O., Peled, D.A.: Model Checking. MIT Press, Cambridge (1999)"},{"doi-asserted-by":"crossref","unstructured":"Dang, Z., Ibarra, O.H., Li, C., Xie, G.: On model-checking of P systems (2005) (submitted)","key":"118_CR8","DOI":"10.1007\/11560319_9"},{"doi-asserted-by":"crossref","unstructured":"Esparza, J.: Decidability and complexity of Petri net problems - an introduction. In: Petri Nets, pp. 374\u2013428 (1996)","key":"118_CR9","DOI":"10.1007\/3-540-65306-6_20"},{"unstructured":"Freund, R., Kari, L., Oswald, M., Sosik, P.: Computationally universal P systems without priorities: two catalysts are sufficient (2003), Available at http:\/\/psystems.disco.unimib.it","key":"118_CR10"},{"unstructured":"Freund, R., Paun, G.: On deterministic P systems (2003), Available at http:\/\/psystems.disco.unimib.it","key":"118_CR11"},{"key":"118_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1007\/978-3-540-24619-0_16","volume-title":"Membrane Computing","author":"O.H. Ibarra","year":"2004","unstructured":"Ibarra, O.H.: The number of membranes matters. In: Mart\u00edn-Vide, C., Mauri, G., P\u0103un, G., Rozenberg, G., Salomaa, A. (eds.) WMC 2003. LNCS, vol.\u00a02933, pp. 218\u2013231. Springer, Heidelberg (2004)"},{"issue":"2-3","key":"118_CR13","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1016\/j.tcs.2003.10.028","volume":"312","author":"O.H. Ibarra","year":"2004","unstructured":"Ibarra, O.H., Dang, Z., Egecioglu, O.: Catalytic P systems, semilinear sets, and vector addition systems. Theoretical Computer Science\u00a0312(2-3), 379\u2013399 (2004)","journal-title":"Theoretical Computer Science"},{"key":"118_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1007\/978-3-540-30550-7_18","volume-title":"Developments in Language Theory","author":"O.H. Ibarra","year":"2004","unstructured":"Ibarra, O.H., Yen, H., Dang, Z.: The power of maximal parallelism in P systems. In: Calude, C.S., Calude, E., Dinneen, M.J. (eds.) DLT 2004. LNCS, vol.\u00a03340, pp. 212\u2013224. Springer, Heidelberg (2004)"},{"doi-asserted-by":"crossref","unstructured":"Ito, M., Martin-Vide, C., Paun, G.: A characterization of Parikh sets of ET0L languages in terms of P systems. In: Words, Semigroups, and Transducers, pp. 239\u2013254. World Scientific, Singapore","key":"118_CR15","DOI":"10.1142\/9789812810908_0019"},{"key":"118_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1007\/3-540-45132-3_5","volume-title":"Machines, Computations, and Universality","author":"C. Martin-Vide","year":"2001","unstructured":"Martin-Vide, C., Paun, G.: Computing with membranes (P systems): universality results. In: Margenstern, M., Rogozhin, Y. (eds.) MCU 2001. LNCS, vol.\u00a02055, pp. 82\u2013101. Springer, Heidelberg (2001)"},{"key":"118_CR17","volume-title":"Hilbert\u2019s Tenth Problem","author":"Y.V. Matiyasevich","year":"1993","unstructured":"Matiyasevich, Y.V.: Hilbert\u2019s Tenth Problem. MIT Press, Cambridge (1993)"},{"issue":"1","key":"118_CR18","first-page":"108","volume":"61","author":"G.. Paun","year":"2000","unstructured":"Paun, G.: Computing with membranes. JCSS\u00a061(1), 108\u2013143 (2000)","journal-title":"JCSS"},{"key":"118_CR19","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-56196-2","volume-title":"Membrane Computing: An Introduction","author":"G.. Paun","year":"2002","unstructured":"Paun, G.: Membrane Computing: An Introduction. Springer, Heidelberg (2002)"},{"issue":"1","key":"118_CR20","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/S0304-3975(02)00136-6","volume":"287","author":"G.. Paun","year":"2002","unstructured":"Paun, G., Rozenberg, G.: A guide to membrane computing. TCS\u00a0287(1), 73\u2013100 (2002)","journal-title":"TCS"},{"key":"118_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1007\/3-540-36490-0_28","volume-title":"Membrane Computing","author":"P. Sosik","year":"2003","unstructured":"Sosik, P.: P systems versus register machines: two universality proofs. In: P\u0103un, G., Rozenberg, G., Salomaa, A., Zandron, C. (eds.) WMC 2002. LNCS, vol.\u00a02597, pp. 371\u2013382. Springer, Heidelberg (2003)"},{"key":"118_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"400","DOI":"10.1007\/3-540-36490-0_28","volume-title":"Membrane Computing","author":"P. Sosik","year":"2003","unstructured":"Sosik, P., Freund, R.: P systems without priorities are computationally universal. In: P\u0103un, G., Rozenberg, G., Salomaa, A., Zandron, C. (eds.) WMC 2002. LNCS, vol.\u00a02597, pp. 400\u2013409. Springer, Heidelberg (2003)"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11523468_118.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:06:01Z","timestamp":1605643561000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11523468_118"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540275800","9783540316916"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/11523468_118","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}