{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T10:08:17Z","timestamp":1761905297914,"version":"build-2065373602"},"reference-count":33,"publisher":"Open Publishing Association","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electron. Proc. Theor. Comput. Sci.","EPTCS"],"DOI":"10.4204\/eptcs.433.6","type":"journal-article","created":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T11:01:24Z","timestamp":1761562884000},"page":"65-84","source":"Crossref","is-referenced-by-count":0,"title":["Unique Solutions of Guarded Recursive Equations"],"prefix":"10.4204","volume":"433","author":[{"given":"Rob","family":"van Glabbeek","sequence":"first","affiliation":[]}],"member":"2720","published-online":{"date-parts":[[2025,10,28]]},"reference":[{"issue":"1","key":"ABV94","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/inco.1994.1040","article-title":"Turning SOS Rules into Equations","volume":"111","author":"Aceto","year":"1994","journal-title":"Information and Computation"},{"key":"BBK87a","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/0304-3975(87)90052-1","article-title":"On the consistency of Koomen's fair abstraction rule","volume":"51","author":"Baeten","year":"1987","journal-title":"Theoretical Computer Science"},{"key":"BW90","series-title":"Cambridge Tracts in Theoretical Computer Science 18","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511624193","volume-title":"Process Algebra","author":"Baeten","year":"1990"},{"key":"BK88","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/S0049-237X(09)70651-2","article-title":"A complete inference system for regular processes with silent moves","volume-title":"Proceedings Logic Colloquium 1986 Hull","author":"Bergstra","year":"1988"},{"issue":"1","key":"BFG04","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1145\/963927.963929","article-title":"Precongruence Formats for Decorated Trace Semantics","volume":"5","author":"Bloom","year":"2004","journal-title":"Transactions on Computational Logic"},{"key":"BIM88","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1145\/73560.73580","article-title":"Bisimulation Can't be Traced: Preliminary Report","volume-title":"Conference Record of the 15th ACM Symposium on Principles of Programming Languages, San Diego, California","author":"Bloom","year":"1988"},{"issue":"1","key":"BIM95","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1145\/200836.200876","article-title":"Bisimulation Can't be Traced","volume":"42","author":"Bloom","year":"1995","journal-title":"Journal of the ACM"},{"issue":"5","key":"BolG96","doi-asserted-by":"publisher","first-page":"863","DOI":"10.1145\/234752.234756","article-title":"The meaning of negative premises in transition system specifications","volume":"43","author":"Bol","year":"1996","journal-title":"Journal of the ACM"},{"issue":"3","key":"BHR84","doi-asserted-by":"publisher","first-page":"560","DOI":"10.1145\/828.833","article-title":"A theory of communicating sequential processes","volume":"31","author":"Brookes","year":"1984","journal-title":"Journal of the ACM"},{"key":"DH84","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/0304-3975(84)90113-0","article-title":"Testing equivalences for processes","volume":"34","author":"De Nicola","year":"1984","journal-title":"Theoretical Computer Science"},{"key":"Fok00","series-title":"Texts in Theoretical Computer Science, An EATCS Series","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-04293-9","volume-title":"Introduction to Process Algebra","author":"Fokkink","year":"2000"},{"issue":"1","key":"FG96","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/inco.1996.0030","article-title":"Ntyft\/ntyxt rules reduce to ntree rules","volume":"126","author":"Fokkink","year":"1996","journal-title":"Information and Computation"},{"key":"FGW12","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/j.ic.2011.10.011","article-title":"Divide and congruence: From decomposition of modal formulas to preservation of branching and \u03b7-bisimilarity","volume":"214","author":"Fokkink","year":"2012","journal-title":"Information and Computation"},{"issue":"3","key":"GRS91","doi-asserted-by":"publisher","first-page":"620","DOI":"10.1145\/116825.116838","article-title":"The well-founded semantics for general logic programs","volume":"38","author":"Gelder","year":"1991","journal-title":"Journal of the ACM"},{"key":"vG93d","series-title":"Workshops in Computing","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/978-1-4471-3227-1_7","article-title":"Full Abstraction in Structural Operational Semantics (extended abstract)","volume-title":"Proceedings of the 3rd International Conference on Algebraic Methodology and Software Technology, AMAST'93, Twente, The Netherlands, June l993","author":"Glabbeek","year":"1993"},{"key":"vG93","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1007\/3-540-57208-2_6","article-title":"The Linear Time \u2013 Branching Time Spectrum II; The semantics of sequential systems with silent moves (extended abstract)","volume-title":"Proceedings CONCUR'93, 4th International Conference on Concurrency Theory, Hildesheim, Germany, August 1993","volume":"715","author":"Glabbeek","year":"1993"},{"key":"vG01","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/B978-044482830-9\/50019-9","article-title":"The Linear Time \u2013 Branching Time Spectrum I; The Semantics of Concrete, Sequential Processes","volume-title":"Handbook of Process Algebra","author":"Glabbeek","year":"2001"},{"key":"vG04","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1016\/j.jlap.2004.03.007","article-title":"The Meaning of Negative Premises in Transition System Specifications II","volume":"60\u201361","author":"Glabbeek","year":"2004","journal-title":"Journal of Logic and Algebraic Programming"},{"key":"vG17b","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2017.8005142","article-title":"Lean and Full Congruence Formats for Recursion","volume-title":"Proceedings 32nd Annual ACM\/IEEE Symposium on Logic in Computer Science, LICS'17, Reykjavik, Iceland, June 2017","author":"Glabbeek","year":"2017"},{"issue":"2","key":"GV93","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1016\/0304-3975(93)90006-F","article-title":"Modular Specification of Process Algebras","volume":"113","author":"Glabbeek","year":"1993","journal-title":"Theoretical Computer Science"},{"key":"Gr93","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1016\/0304-3975(93)90111-6","article-title":"Transition System Specifications with Negative Premises","volume":"118","author":"Groote","year":"1993","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"GrV92","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1016\/0890-5401(92)90013-6","article-title":"Structured Operational Semantics and Bisimulation as a Congruence","volume":"100","author":"Groote","year":"1992","journal-title":"Information and Computation"},{"volume-title":"Communicating Sequential Processes","year":"1985","author":"Hoare","key":"Ho85"},{"issue":"2","key":"Lam77","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1109\/TSE.1977.229904","article-title":"Proving the correctness of multiprocess programs","volume":"3","author":"Lamport","year":"1977","journal-title":"IEEE Transactions on Software Engineering"},{"key":"Lam98","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1016\/S0304-3975(98)00129-7","article-title":"Proving Possibility Properties","volume":"206","author":"Lamport","year":"1998","journal-title":"Theoretical Computer Science"},{"key":"LT88","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1109\/LICS.1988.5119","article-title":"A Modal Process Logic","volume-title":"Proc. LICS'88","author":"Larsen","year":"1988"},{"key":"Mi84","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1016\/0022-0000(84)90023-0","article-title":"A complete inference system for a class of regular behaviours","volume":"28","author":"Milner","year":"1984","journal-title":"Journal of Computer and System Sciences"},{"key":"Mi90ccs","first-page":"1201","article-title":"Operational and algebraic semantics of concurrent processes","volume-title":"Handbook of Theoretical Computer Science","author":"Milner","year":"1990"},{"key":"OH86","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1007\/BF00268075","article-title":"Specification-oriented semantics for communicating processes","volume":"23","author":"Olderog","year":"1986","journal-title":"Acta Informatica"},{"key":"Pl04","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/j.jlap.2004.05.001","article-title":"A Structural Approach to Operational Semantics","volume":"60\u201361","author":"Plotkin","year":"2004","journal-title":"The Journal of Logic and Algebraic Programming"},{"issue":"4","key":"Prz90","doi-asserted-by":"publisher","first-page":"445","DOI":"10.3233\/FI-1990-13404","article-title":"The Well-founded Semantics Coincides with the Three-valued Stable Semantics","volume":"XIII","author":"Przymusinski","year":"1990","journal-title":"Fundamenta Informaticae"},{"volume-title":"The Theory and Practice of Concurrency","year":"1997","author":"Roscoe","key":"Ros97"},{"key":"Va93","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"609","DOI":"10.1007\/3-540-56596-5_49","article-title":"Expressiveness Results for Process Algebras","volume-title":"Proceedings REX Workshop on Semantics: Foundations and Applications, Beekbergen, The Netherlands, 1992","volume":"666","author":"Vaandrager","year":"1993"}],"container-title":["Electronic Proceedings in Theoretical Computer Science"],"original-title":[],"language":"en","deposited":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T10:03:46Z","timestamp":1761905026000},"score":1,"resource":{"primary":{"URL":"http:\/\/arxiv.org\/abs\/2510.24206v1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10,28]]},"references-count":33,"URL":"https:\/\/doi.org\/10.4204\/eptcs.433.6","relation":{},"ISSN":["2075-2180"],"issn-type":[{"type":"electronic","value":"2075-2180"}],"subject":[],"published":{"date-parts":[[2025,10,28]]}}}