{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T14:18:51Z","timestamp":1761920331391,"version":"3.28.0"},"reference-count":55,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017,6]]},"DOI":"10.1109\/lics.2017.8005142","type":"proceedings-article","created":{"date-parts":[[2017,8,10]],"date-time":"2017-08-10T20:43:24Z","timestamp":1502397804000},"page":"1-11","source":"Crossref","is-referenced-by-count":6,"title":["Lean and full congruence formats for recursion"],"prefix":"10.1109","author":[{"given":"Rob","family":"van Glabbeek","sequence":"first","affiliation":[]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(93)90111-6"},{"key":"ref38","first-page":"555","volume":"43","year":"1996","journal-title":"Jounal of the ACM"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1016\/j.jlap.2004.03.007"},{"key":"ref32","first-page":"502","author":"meyer auf der heide","year":"0","journal-title":"Proc of ICALP'96 LNCS 1099"},{"key":"ref31","article-title":"The Meaning of Negative Premises in Transition System Specifications II","author":"van glabbeek","year":"1995","journal-title":"Technical Report STAN-CS-TN-95-16"},{"key":"ref30","first-page":"188","article-title":"On the expressiveness of ACP (extended abstract)","author":"van glabbeek","year":"1994","journal-title":"Proceedings First Workshop on the Algebra of Communicating Processes ACP94 Utrecht The Netherlands May 1994 Workshops in Computing"},{"key":"ref37","first-page":"613","article-title":"Branching Time and Abstraction in Bisimulation Semantics (extended abstract)","author":"van glabbeek","year":"1989","journal-title":"Information Processing 89 Proceedings of the IFIP 11th World Computer Congress"},{"key":"ref36","doi-asserted-by":"crossref","first-page":"371","DOI":"10.3233\/FI-2009-109","article-title":"Branching Bisimilarity with Explicit Divergence","volume":"93","author":"van glabbeek","year":"2009","journal-title":"Fundamenta Informaticae"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.4204\/EPTCS.89.7"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2011.02.036"},{"key":"ref28","first-page":"77","article-title":"Full abstraction in structural operational semantics (extended abstract)","author":"van glabbeek","year":"1993","journal-title":"Proc AMAST'93 Workshops in Computing"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/116825.116838"},{"key":"ref29","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1007\/3-540-57208-2_6","article-title":"The Linear Time-Branching Time Spectrum II; The semantics of sequential systems with silent moves (extended abstract)","author":"van glabbeek","year":"1993","journal-title":"CONCUR'93 LNCS 715"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2011.01.024"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/j.scico.2010.04.002"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1996.0030"},{"journal-title":"Precongruence Formats with Lookahead through Modal Decomposition","year":"2017","author":"fokkink","key":"ref22"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/2933575.2933590"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2011.10.011"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2005.11.035"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.4204\/EPTCS.120.4"},{"key":"ref25","first-page":"372","article-title":"CADP 2010: A Toolbox for the Construction and Analysis of Distributed Processes","author":"garavel","year":"2011","journal-title":"Proc TACAS'11 LNCS 6605"},{"key":"ref50","first-page":"445","article-title":"The Well-founded Semantics Coincides with the Three-valued Stable Semantics","volume":"xiii","author":"przymusinski","year":"1990","journal-title":"Fundamenta Informaticae"},{"key":"ref51","first-page":"7","article-title":"Calculabilité et Expressivité dans l'Algebra de Processus Parallèles Mei1e","author":"de simone","year":"1984","journal-title":"Thèse du 3 cycle"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1016\/S0890-5401(02)93161-5"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(99)00214-5"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.1992.185529"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(85)90093-3"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/963927.963929"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/200836.200876"},{"key":"ref40","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/9946.001.0001","author":"groote","year":"2014","journal-title":"Modeling and Analysis of Communicating Systems"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/234752.234756"},{"key":"ref13","article-title":"A Timed Process Algebra for Wireless Networkswith an Application in Routing","author":"bres","year":"2016","journal-title":"Technical Report 9145"},{"key":"ref14","first-page":"95","author":"thiemann","year":"2016","journal-title":"Proc ESOP'16 LNCS 9632"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/828.833"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-85361-9_35"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2016.03.009"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-04293-9"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1999.1663"},{"key":"ref4","first-page":"197","article-title":"Structural Operational Semantics","author":"aceto","year":"2000","journal-title":"Handbook of Process Algebra Chapter 1"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2012.07.036"},{"journal-title":"Process Algebra Equational Theories of Communicating Processes","year":"2010","author":"baeten","key":"ref6"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2014.12.003"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/S1571-0661(04)80358-X"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511608841"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1016\/j.jlap.2004.03.009"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(94)00152-9"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.4204\/EPTCS.154.2"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.1988.5119"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2004.11.007"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1016\/B978-0-444-88074-1.50024-X"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(92)90013-6"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1016\/j.entcs.2005.11.077"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1145\/1462179.1462181"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2013.04.001"}],"event":{"name":"2017 32nd Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS)","start":{"date-parts":[[2017,6,20]]},"location":"Reykjavik, Iceland","end":{"date-parts":[[2017,6,23]]}},"container-title":["2017 32nd Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7999337\/8005055\/08005142.pdf?arnumber=8005142","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,14]],"date-time":"2020-10-14T21:12:43Z","timestamp":1602709963000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/8005142\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,6]]},"references-count":55,"URL":"https:\/\/doi.org\/10.1109\/lics.2017.8005142","relation":{},"subject":[],"published":{"date-parts":[[2017,6]]}}}