{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:03:15Z","timestamp":1740096195480,"version":"3.37.3"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642250316"},{"type":"electronic","value":"9783642250323"}],"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-25032-3_5","type":"book-chapter","created":{"date-parts":[[2011,11,8]],"date-time":"2011-11-08T20:27:53Z","timestamp":1320784073000},"page":"60-75","source":"Crossref","is-referenced-by-count":1,"title":["Simulation and Verification of Synchronous Set Relations in Rewriting Logic"],"prefix":"10.1007","author":[{"given":"Camilo","family":"Rocha","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C\u00e9sar","family":"Mu\u00f1oz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3","key":"5_CR1","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/j.entcs.2008.04.091","volume":"200","author":"M. AlTurki","year":"2008","unstructured":"AlTurki, M., Meseguer, J.: Reduction semantics and formal analysis of Orc programs. Electronic Notes in Theoretical Computer Science\u00a0200(3), 25\u201341 (2008); Proceedings of the 3rd International Workshop on Automated Specification and Verification of Web Systems (WWV 2007)","journal-title":"Electronic Notes in Theoretical Computer Science"},{"issue":"1-3","key":"5_CR2","doi-asserted-by":"publisher","first-page":"386","DOI":"10.1016\/j.tcs.2006.04.012","volume":"360","author":"R. Bruni","year":"2006","unstructured":"Bruni, R., Meseguer, J.: Semantic foundations for generalized rewrite theories. Theoretical Computer Science\u00a0360(1-3), 386\u2013414 (2006)","journal-title":"Theoretical Computer Science"},{"issue":"6","key":"5_CR3","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1016\/j.jlap.2010.03.006","volume":"79","author":"C. Chira","year":"2010","unstructured":"Chira, C., Serbanuta, T.F., Stefanescu, G.: P systems with control nuclei: The concept. Journal of Logic and Algebraic Programming\u00a079(6), 326\u2013333 (2010); Membrane computing and programming","journal-title":"Journal of Logic and Algebraic Programming"},{"key":"5_CR4","series-title":"Lecture Notes in Computer Science","first-page":"797","volume-title":"All About Maude - A High-Performance Logical Framework","author":"M. Clavel","year":"2007","unstructured":"Clavel, M., Dur\u00e1n, F., Eker, S., Lincoln, P., Mart\u00ed-Oliet, N., Meseguer, J., Talcott, C.L.: All About Maude - A High-Performance Logical Framework. LNCS, vol.\u00a04350, p. 797. Springer, Heidelberg (2007)"},{"key":"5_CR5","doi-asserted-by":"publisher","first-page":"77","DOI":"10.4204\/EPTCS.18.6","volume":"18","author":"G. Dowek","year":"2010","unstructured":"Dowek, G., Mu\u00f1oz, C., Rocha, C.: Rewriting logic semantics of a plan execution language. Electronic Proceedings in Theoretical Computer Science\u00a018, 77\u201391 (2010)","journal-title":"Electronic Proceedings in Theoretical Computer Science"},{"key":"5_CR6","unstructured":"Estlin, T., J\u00f3nsson, A., P\u0103s\u0103reanu, C., Simmons, R., Tso, K., Verna, V.: Plan Execution Interchange Language (PLEXIL). Technical Memorandum TM-2006-213483, NASA (2006)"},{"key":"5_CR7","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/j.entcs.2009.03.038","volume":"237","author":"D. Lucanu","year":"2009","unstructured":"Lucanu, D.: Strategy-based rewrite semantics for membrane systems preserves maximal concurrency of evolution rule actions. Electronic Notes in Theoretical Computer Science\u00a0237, 107\u2013125 (2009); Proceedings of the 8th International Workshop on Reduction Strategies in Rewriting and Programming (WRS 2008)","journal-title":"Electronic Notes in Theoretical Computer Science"},{"key":"5_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1007\/3-540-64299-4_26","volume-title":"Recent Trends in Algebraic Development Techniques","author":"J. Meseguer","year":"1998","unstructured":"Meseguer, J.: Membership algebra as a logical framework for equational specification. In: Parisi-Presicce, F. (ed.) WADT 1997. LNCS, vol.\u00a01376, pp. 18\u201361. Springer, Heidelberg (1998)"},{"key":"5_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/978-3-642-16901-4_21","volume-title":"Formal Methods and Software Engineering","author":"J. Meseguer","year":"2010","unstructured":"Meseguer, J., \u00d6lveczky, P.: Formalization and correctness of the pals architectural pattern for distributed real-time systems. In: Dong, J.S., Zhu, H. (eds.) ICFEM 2010. LNCS, vol.\u00a06447, pp. 303\u2013320. Springer, Heidelberg (2010)"},{"key":"5_CR10","doi-asserted-by":"crossref","unstructured":"Rocha, C., Meseguer, J.: Proving safety properties of rewrite theories. Technical report, University of Illinois at Urbana-Champaign (2010), \n                  \n                    http:\/\/dx.doi.org\/10.1007\/978-3-642-22944-2_22","DOI":"10.1007\/978-3-642-22944-2_22"},{"issue":"37","key":"5_CR11","doi-asserted-by":"publisher","first-page":"4853","DOI":"10.1016\/j.tcs.2011.01.027","volume":"412","author":"C. Rocha","year":"2011","unstructured":"Rocha, C., Mu\u00f1oz, C., Dowek, G.: A formal library of set relations and its application to synchronous languages. Theoretical Computer Science\u00a0412(37), 4853\u20134866 (2011)","journal-title":"Theoretical Computer Science"},{"key":"5_CR12","unstructured":"Serbanuta, T.: A Rewriting Approach to Concurrent Programming Language Design and Semantics. PhD thesis, University of Illinois at Urbana-Champaign (December 2010), \n                  \n                    http:\/\/hdl.handle.net\/2142\/18252"},{"key":"5_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1007\/978-3-540-95885-7_26","volume-title":"Membrane Computing","author":"T. Serbanuta","year":"2009","unstructured":"Serbanuta, T., Stefanescu, G., Rosu, G.: Defining and executing p systems with structured data in k. In: Corne, D., Frisco, P., Paun, G., Rozenberg, G., Salomaa, A. (eds.) WMC 2008. LNCS, vol.\u00a05391, pp. 374\u2013393. Springer, Heidelberg (2009)"},{"issue":"2","key":"5_CR14","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1016\/S0304-3975(01)00366-8","volume":"285","author":"P. Viry","year":"2002","unstructured":"Viry, P.: Equational rules for rewriting logic. Theoretical Computer Science\u00a0285(2), 487\u2013517 (2002)","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","Formal Methods, Foundations and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-25032-3_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T01:36:05Z","timestamp":1555378565000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-25032-3_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642250316","9783642250323"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-25032-3_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}