{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,31]],"date-time":"2025-05-31T04:05:21Z","timestamp":1748664321248,"version":"3.41.0"},"publisher-location":"Cham","reference-count":53,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319231648"},{"type":"electronic","value":"9783319231655"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-23165-5_1","type":"book-chapter","created":{"date-parts":[[2015,8,26]],"date-time":"2015-08-26T03:57:43Z","timestamp":1440561463000},"page":"1-47","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Jos\u00e9 Meseguer: Scientist and Friend Extraordinaire"],"prefix":"10.1007","author":[{"given":"Narciso","family":"Mart\u00ed-Oliet","sequence":"first","affiliation":[]},{"given":"Peter Csaba","family":"\u00d6lveczky","sequence":"additional","affiliation":[]},{"given":"Carolyn","family":"Talcott","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,8,27]]},"reference":[{"issue":"2","key":"1_CR1","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1016\/j.entcs.2005.10.040","volume":"153","author":"GA Agha","year":"2006","unstructured":"Agha, G.A., Meseguer, J., Sen, K.: PMaude: rewrite-based specification language for probabilistic object systems. Electron. Notes Theoret. Comput. Sci. 153(2), 213\u2013239 (2006)","journal-title":"Electron. Notes Theoret. Comput. Sci."},{"key":"1_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1007\/3-540-54317-1_101","volume-title":"Conditional and Typed Rewriting Systems","author":"H Aida","year":"1991","unstructured":"Aida, H., Goguen, J.A., Meseguer, J.: Compiling concurrent rewriting onto the rewrite rule machine. In: Okada, M., Kaplan, S. (eds.) CTRS 1990. LNCS, vol. 516, pp. 320\u2013332. Springer, Heidelberg (1991)"},{"key":"1_CR3","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/j.scico.2014.09.011","volume":"103","author":"K Bae","year":"2015","unstructured":"Bae, K., Krisiloff, J., Meseguer, J., \u00d6lveczky, P.C.: Designing and verifying distributed cyber-physical systems using Multirate PALS: an airplane turning control system case study. Sci. Comput. Program. 103, 13\u201350 (2015)","journal-title":"Sci. Comput. Program."},{"key":"1_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1007\/978-3-319-08918-8_5","volume-title":"Rewriting and Typed Lambda Calculi","author":"K Bae","year":"2014","unstructured":"Bae, K., Meseguer, J.: Predicate abstraction of rewrite theories. In: Dowek, G. (ed.) RTA-TLCA 2014. LNCS, vol. 8560, pp. 61\u201376. Springer, Heidelberg (2014)"},{"issue":"1\u20132","key":"1_CR5","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/S0304-3975(99)00206-6","volume":"236","author":"A Bouhoula","year":"2000","unstructured":"Bouhoula, A., Jouannaud, J., Meseguer, J.: Specification and proof in membership equational logic. Theoret. Comput. Sci. 236(1\u20132), 35\u2013132 (2000)","journal-title":"Theoret. Comput. Sci."},{"key":"1_CR6","doi-asserted-by":"crossref","unstructured":"Chen, S., Meseguer, J., Sasse, R., Wang, H.J., Wang, Y.: A systematic approach to uncover security flaws in GUI logic. In: Proceedings of the IEEE Symposium on Security and Privacy, pp. 71\u201385. IEEE Computer Society (2007)","DOI":"10.1109\/SP.2007.6"},{"key":"1_CR7","volume-title":"Reflection in Rewriting Logic: Metalogical Foundations and Metaprogramming Applications","author":"M Clavel","year":"2000","unstructured":"Clavel, M.: Reflection in Rewriting Logic: Metalogical Foundations and Metaprogramming Applications. CSLI Publications, Stanford (2000)"},{"key":"1_CR8","series-title":"Lecture Notes in Computer Science","volume-title":"All About Maude - A High-Performance Logical Framework","year":"2007","unstructured":"Clavel, M., Dur\u00e1n, F., Eker, S., Lincoln, P., Mart\u00ed-Oliet, N., Meseguer, J., Talcott, C. (eds.): All About Maude. LNCS, vol. 4350. Springer, Heidelberg (2007)"},{"key":"1_CR9","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1016\/S1571-0661(04)00037-4","volume":"4","author":"M Clavel","year":"1996","unstructured":"Clavel, M., Meseguer, J.: Reflection and strategies in rewriting logic. Electron. Notes Theoret. Comput. Sci. 4, 126\u2013148 (1996)","journal-title":"Electron. Notes Theoret. Comput. Sci."},{"issue":"2","key":"1_CR10","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1016\/S0304-3975(01)00360-7","volume":"285","author":"M Clavel","year":"2002","unstructured":"Clavel, M., Meseguer, J.: Reflection in conditional rewriting logic. Theoret. Comput. Sci. 285(2), 245\u2013288 (2002)","journal-title":"Theoret. Comput. Sci."},{"issue":"2","key":"1_CR11","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/j.scico.2006.07.002","volume":"66","author":"F Dur\u00e1n","year":"2007","unstructured":"Dur\u00e1n, F., Meseguer, J.: Maude\u2019s module algebra. Sci. Comput. Program. 66(2), 125\u2013153 (2007)","journal-title":"Sci. Comput. Program."},{"issue":"7\u20138","key":"1_CR12","doi-asserted-by":"publisher","first-page":"816","DOI":"10.1016\/j.jlap.2011.12.004","volume":"81","author":"F Dur\u00e1n","year":"2012","unstructured":"Dur\u00e1n, F., Meseguer, J.: On the Church-Rosser and coherence properties of conditional order-sorted rewrite theories. J. Logic Algebraic Program. 81(7\u20138), 816\u2013850 (2012)","journal-title":"J. Logic Algebraic Program."},{"key":"1_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1007\/978-3-642-28872-2_6","volume-title":"Fundamental Approaches to Software Engineering","author":"J Eckhardt","year":"2012","unstructured":"Eckhardt, J., M\u00fchlbauer, T., AlTurki, M., Meseguer, J., Wirsing, M.: Stable availability under denial of service attacks through formal patterns. In: de Lara, J., Zisman, A. (eds.) FASE 2012. LNCS, vol. 7212, pp. 78\u201393. Springer, Heidelberg (2012)"},{"key":"1_CR14","doi-asserted-by":"crossref","unstructured":"Eker, S., Knapp, M., Laderoute, K., Lincoln, P., Meseguer, J., Sonmez, K.: Pathway logic: symbolic analysis of biological signaling. In: Proceedings of the Pacific Symposium on Biocomputing, pp. 400\u2013412, January 2002. http:\/\/psb.stanford.edu\/psb-online\/proceedings\/psb02\/eker.pdf","DOI":"10.1142\/9789812799623_0038"},{"key":"1_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-03829-7_1","volume-title":"Foundations of Security Analysis and Design V","author":"S Escobar","year":"2009","unstructured":"Escobar, S., Meadows, C., Meseguer, J.: Maude-NPA: cryptographic protocol analysis modulo equational properties. In: Aldini, A., Barthe, G., Gorrieri, R. (eds.) FOSAD 2007\/2008\/2009. LNCS, vol. 5705, pp. 1\u201350. Springer, Heidelberg (2009)"},{"issue":"7\u20138","key":"1_CR16","doi-asserted-by":"publisher","first-page":"898","DOI":"10.1016\/j.jlap.2012.01.002","volume":"81","author":"S Escobar","year":"2012","unstructured":"Escobar, S., Sasse, R., Meseguer, J.: Folding variant narrowing and optimal variant termination. J. Logic Algebraic Programm. 81(7\u20138), 898\u2013928 (2012)","journal-title":"J. Logic Algebraic Programm."},{"key":"1_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1007\/978-3-642-24690-6_29","volume-title":"Software Engineering and Formal Methods","author":"M Fadlisyah","year":"2011","unstructured":"Fadlisyah, M., \u00d6lveczky, P.C., \u00c1brah\u00e1m, E.: Object-oriented formal modeling and analysis of interacting hybrid systems in HI-Maude. In: Barthe, G., Pardo, A., Schneider, G. (eds.) SEFM 2011. LNCS, vol. 7041, pp. 415\u2013430. Springer, Heidelberg (2011)"},{"key":"1_CR18","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/j.scico.2014.06.010","volume":"99","author":"M Fadlisyah","year":"2015","unstructured":"Fadlisyah, M., \u00d6lveczky, P.C., \u00c1brah\u00e1m, E.: Formal modeling and analysis of interacting hybrid systems in HI-Maude: what happened at the 2010 Sauna World Championships? Sci. Comput. Program. 99, 95\u2013127 (2015)","journal-title":"Sci. Comput. Program."},{"key":"1_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1007\/978-3-540-27813-9_46","volume-title":"Computer Aided Verification","author":"A Farzan","year":"2004","unstructured":"Farzan, A., Chen, F., Meseguer, J., Ro\u015fu, G.: Formal analysis of Java programs in JavaFAN. In: Alur, R., Peled, D.A. (eds.) CAV 2004. LNCS, vol. 3114, pp. 501\u2013505. Springer, Heidelberg (2004)"},{"key":"1_CR20","doi-asserted-by":"crossref","unstructured":"Futatsugi, K., Goguen, J.A., Jouannaud, J., Meseguer, J.: Principles of OBJ2. In: Proceedings of the ACM Symposium on Principles of Programming Languages, pp. 52\u201366. ACM Press (1985)","DOI":"10.1145\/318593.318610"},{"key":"1_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/BFb0015747","volume-title":"Automata, Languages and Programming","author":"JA Goguen","year":"1985","unstructured":"Goguen, J.A., Jouannaud, J., Meseguer, J.: Operational semantics for order-sorted algebra. In: Brauer, W. (ed.) ICALP 1985. LNCS, vol. 194, pp. 221\u2013231. Springer, Heidelberg (1985)"},{"key":"1_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1007\/3-540-19242-5_22","volume-title":"Conditional Term Rewriting Systems","author":"JA Goguen","year":"1988","unstructured":"Goguen, J.A., Kirchner, C., Kirchner, H., M\u00e9grelis, A., Meseguer, J., Winkler, T.C.: An introduction to OBJ3. In: Kaplan, S., Jouannaud, J.-P. (eds.) CTRS 1987. LNCS, vol. 308, pp. 258\u2013263. Springer, Heidelberg (1988)"},{"key":"1_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/3-540-18420-1_50","volume-title":"Graph Reduction","author":"JA Goguen","year":"1987","unstructured":"Goguen, J.A., Kirchner, C., Meseguer, J.: Concurrent term rewriting as a model of computation. In: Fasel, J.H., Keller, R.M. (eds.) Graph Reduction 1986. LNCS, vol. 279, pp. 53\u201393. Springer, Heidelberg (1987)"},{"key":"1_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"580","DOI":"10.1007\/3-540-08353-7_183","volume-title":"Mathematical Foundations of Computer Science 1977","author":"JA Goguen","year":"1977","unstructured":"Goguen, J.A., Meseguer, J.: Correctness of recursive flow diagram programs. In: Gruska, J. (ed.) MFCS 1977. LNCS, vol. 53, pp. 580\u2013595. Springer, Heidelberg (1977)"},{"key":"1_CR25","doi-asserted-by":"crossref","unstructured":"Goguen, J.A., Meseguer, J.: Security policies and security models. In: Proceedings of the IEEE Symposium on Security and Privacy, pp. 11\u201320. IEEE Computer Society (1982)","DOI":"10.1109\/SP.1982.10014"},{"issue":"2","key":"1_CR26","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/0304-3975(92)90302-V","volume":"105","author":"JA Goguen","year":"1992","unstructured":"Goguen, J.A., Meseguer, J.: Order-sorted algebra I: equational deduction for multiple inheritance, overloading, exceptions and partial operations. Theoret. Comput. Sci. 105(2), 217\u2013273 (1992)","journal-title":"Theoret. Comput. Sci."},{"key":"1_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1007\/978-3-319-10431-7_12","volume-title":"Software Engineering and Formal Methods","author":"J Grov","year":"2014","unstructured":"Grov, J., \u00d6lveczky, P.C.: Increasing consistency in multi-site data stores: Megastore-CGC and its formal analysis. In: Giannakopoulou, D., Sala\u00fcn, G. (eds.) SEFM 2014. LNCS, vol. 8702, pp. 159\u2013174. Springer, Heidelberg (2014)"},{"key":"1_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/3-540-19488-6_123","volume-title":"Automata, Languages and Programming","author":"C Kirchner","year":"1988","unstructured":"Kirchner, C., Kirchner, H., Meseguer, J.: Operational semantics of OBJ3 (extended abstract). In: Lepist\u00f6, T., Salomaa, A. (eds.) ICALP 1988. LNCS, vol. 317, pp. 287\u2013301. Springer, Heidelberg (1988)"},{"key":"1_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1007\/978-3-540-39958-2_3","volume-title":"Formal Methods for Open Object-Based Distributed Systems","author":"N Kumar","year":"2003","unstructured":"Kumar, N., Sen, K., Meseguer, J., Agha, G.: A rewriting based model for probabilistic distributed object systems. In: Najm, E., Nestmann, U., Stevens, P. (eds.) FMOODS 2003. LNCS, vol. 2884, pp. 32\u201346. Springer, Heidelberg (2003)"},{"key":"1_CR30","unstructured":"Lincoln, P.D., Talcott, C.: Symbolic systems biology and Pathway Logic. In: Symbolic Systems Biology, pp. 1\u201329. Jones and Bartlett (2010)"},{"key":"1_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"332","DOI":"10.1007\/978-3-319-11737-9_22","volume-title":"Formal Methods and Software Engineering","author":"S Liu","year":"2014","unstructured":"Liu, S., Rahman, M.R., Skeirik, S., Gupta, I., Meseguer, J.: Formal modeling and analysis of Cassandra in Maude. In: Merz, S., Pang, J. (eds.) ICFEM 2014. LNCS, vol. 8829, pp. 332\u2013347. Springer, Heidelberg (2014)"},{"key":"1_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1007\/978-3-319-15545-6_9","volume-title":"Software, Services, and Systems","author":"S Lucas","year":"2015","unstructured":"Lucas, S., Meseguer, J.: Localized operational termination in general logics. In: De Nicola, R., Hennicker, R. (eds.) Software, Services, and Systems. LNCS, vol. 8950, pp. 91\u2013114. Springer, Heidelberg (2015)"},{"key":"1_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/BFb0018359","volume-title":"Category Theory and Computer Science","author":"N Mart\u00ed-Oliet","year":"1989","unstructured":"Mart\u00ed-Oliet, N., Meseguer, J.: From Petri nets to linear logic. In: Dybjer, P., Pitts, A.M., Pitt, D.H., Poign\u00e9, A., Rydeheard, D.E. (eds.) CTCS 1989. LNCS, vol. 389, pp. 313\u2013340. Springer, Heidelberg (1989)"},{"key":"1_CR34","doi-asserted-by":"crossref","unstructured":"Meseguer, J.: General logics. In: Proceedings of the Logic Colloquium 1987, pp. 275\u2013329. North-Holland (1989)","DOI":"10.1016\/S0049-237X(08)70132-0"},{"key":"1_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1007\/3-540-54317-1_81","volume-title":"Conditional and Typed Rewriting Systems","author":"J Meseguer","year":"1991","unstructured":"Meseguer, J.: Conditional rewriting logic: deduction, models and concurrency. In: Okada, M., Kaplan, S. (eds.) CTRS 1990. LNCS, vol. 516, pp. 64\u201391. Springer, Heidelberg (1991)"},{"key":"1_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"384","DOI":"10.1007\/BFb0039072","volume-title":"CONCUR \u201990","author":"J Meseguer","year":"1990","unstructured":"Meseguer, J.: Rewriting as a unified model of concurrency. In: Baeten, J.C.M., Klop, J.W. (eds.) CONCUR 1990. LNCS, vol. 458, pp. 384\u2013400. Springer, Heidelberg (1990)"},{"issue":"1","key":"1_CR37","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/0304-3975(92)90182-F","volume":"96","author":"J Meseguer","year":"1992","unstructured":"Meseguer, J.: Conditional rewriting logic as a unified model of concurrency. Theoret. Comput. Sci. 96(1), 73\u2013155 (1992)","journal-title":"Theoret. Comput. Sci."},{"key":"1_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1007\/BFb0013826","volume-title":"Algebraic and Logic Programming","author":"J Meseguer","year":"1992","unstructured":"Meseguer, J.: Multiparadigm logic programming. In: Kirchner, H., Levi, G. (eds.) ALP 1992. LNCS, vol. 632, pp. 158\u2013200. Springer, Heidelberg (1992)"},{"key":"1_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/3-540-61604-7_64","volume-title":"CONCUR \u201996: Concurrency Theory","author":"J Meseguer","year":"1996","unstructured":"Meseguer, J.: Rewriting logic as a semantic framework for concurrency: a progress report. In: Sassone, V., Montanari, U. (eds.) CONCUR 1996. LNCS, vol. 1119, pp. 331\u2013372. Springer, Heidelberg (1996)"},{"key":"1_CR40","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. 1376, pp. 18\u201361. Springer, Heidelberg (1998)"},{"key":"1_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1007\/11780274_14","volume-title":"Algebra, Meaning, and Computation","author":"J Meseguer","year":"2006","unstructured":"Meseguer, J.: From OBJ to Maude and beyond. In: Futatsugi, K., Jouannaud, J.-P., Meseguer, J. (eds.) Algebra, Meaning, and Computation. LNCS, vol. 4060, pp. 252\u2013280. Springer, Heidelberg (2006)"},{"issue":"7\u20138","key":"1_CR42","doi-asserted-by":"publisher","first-page":"721","DOI":"10.1016\/j.jlap.2012.06.003","volume":"81","author":"J Meseguer","year":"2012","unstructured":"Meseguer, J.: Twenty years of rewriting logic. J. Logic Algebraic Program. 81(7\u20138), 721\u2013781 (2012)","journal-title":"J. Logic Algebraic Program."},{"key":"1_CR43","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.scico.2013.07.004","volume":"83","author":"J Meseguer","year":"2014","unstructured":"Meseguer, J.: Taming distributed system complexity through formal patterns. Sci. Comput. Program. 83, 3\u201334 (2014)","journal-title":"Sci. Comput. Program."},{"issue":"2","key":"1_CR44","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1016\/0890-5401(90)90013-8","volume":"88","author":"J Meseguer","year":"1990","unstructured":"Meseguer, J., Montanari, U.: Petri nets are monoids. Inf. Comput. 88(2), 105\u2013155 (1990)","journal-title":"Inf. Comput."},{"issue":"2","key":"1_CR45","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1016\/j.jlap.2009.07.003","volume":"79","author":"J Meseguer","year":"2010","unstructured":"Meseguer, J., Palomino, M., Mart\u00ed-Oliet, N.: Algebraic simulations. J. Logic Algebraic Program. 79(2), 103\u2013143 (2010)","journal-title":"J. Logic Algebraic Program."},{"issue":"3","key":"1_CR46","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1016\/j.tcs.2006.12.018","volume":"373","author":"J Meseguer","year":"2007","unstructured":"Meseguer, J., Ro\u015fu, G.: The rewriting logic semantics project. Theoret. Comput. Sci. 373(3), 213\u2013237 (2007)","journal-title":"Theoret. Comput. Sci."},{"key":"1_CR47","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-22953-4_1","volume-title":"Fundamentals of Computation Theory","author":"J Meseguer","year":"2011","unstructured":"Meseguer, J., Ro\u015fu, G.: The rewriting logic semantics project: a progress report. In: Owe, O., Steffen, M., Telle, J.A. (eds.) FCT 2011. LNCS, vol. 6914, pp. 1\u201337. Springer, Heidelberg (2011)"},{"key":"1_CR48","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"460","DOI":"10.1007\/11730637_35","volume-title":"Hybrid Systems: Computation and Control","author":"J Meseguer","year":"2006","unstructured":"Meseguer, J., Sharykin, R.: Specification and analysis of distributed object-based stochastic hybrid systems. In: Hespanha, J.P., Tiwari, A. (eds.) HSCC 2006. LNCS, vol. 3927, pp. 460\u2013475. Springer, Heidelberg (2006)"},{"issue":"1\u20132","key":"1_CR49","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/s10990-007-9000-6","volume":"20","author":"J Meseguer","year":"2007","unstructured":"Meseguer, J., Thati, P.: Symbolic reachability analysis using narrowing and its application to verification of cryptographic protocols. Higher-Order Symb. Comput. 20(1\u20132), 123\u2013160 (2007)","journal-title":"Higher-Order Symb. Comput."},{"key":"1_CR50","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1007\/978-3-319-12904-4_3","volume-title":"Rewriting Logic and Its Applications","author":"PC \u00d6lveczky","year":"2014","unstructured":"\u00d6lveczky, P.C.: Real-Time Maude and its applications. In: Escobar, S. (ed.) WRLA 2014. LNCS, vol. 8663, pp. 42\u201379. Springer, Heidelberg (2014)"},{"issue":"2","key":"1_CR51","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1016\/S0304-3975(01)00363-2","volume":"285","author":"PC \u00d6lveczky","year":"2002","unstructured":"\u00d6lveczky, P.C., Meseguer, J.: Specification of real-time and hybrid systems in rewriting logic. Theoret. Comput. Sci. 285(2), 359\u2013405 (2002)","journal-title":"Theoret. Comput. Sci."},{"issue":"1\u20132","key":"1_CR52","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/s10990-007-9001-5","volume":"20","author":"PC \u00d6lveczky","year":"2007","unstructured":"\u00d6lveczky, P.C., Meseguer, J.: Semantics and pragmatics of Real-Time Maude. Higher-Order Symb. Comput. 20(1\u20132), 161\u2013196 (2007)","journal-title":"Higher-Order Symb. Comput."},{"key":"1_CR53","series-title":"Lecture Notes in Computer Science (Lecture Notes in Bioinformatics)","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/11880646_10","volume-title":"Transactions on Computational Systems Biology VI","author":"C Talcott","year":"2006","unstructured":"Talcott, C., Dill, D.L.: Multiple representations of biological processes. In: Priami, C., Plotkin, G. (eds.) Transactions on Computational Systems Biology VI. LNCS (LNBI), vol. 4220, pp. 221\u2013245. Springer, Heidelberg (2006)"}],"container-title":["Lecture Notes in Computer Science","Logic, Rewriting, and Concurrency"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-23165-5_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,30]],"date-time":"2025-05-30T04:39:47Z","timestamp":1748579987000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-23165-5_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319231648","9783319231655"],"references-count":53,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-23165-5_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"27 August 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}