{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T07:42:22Z","timestamp":1767339742553},"reference-count":26,"publisher":"Cambridge University Press (CUP)","issue":"6","license":[{"start":{"date-parts":[[2014,11,10]],"date-time":"2014-11-10T00:00:00Z","timestamp":1415577600000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Struct. Comp. Sci."],"published-print":{"date-parts":[[2015,9]]},"abstract":"<jats:p>Recently, in order to mix algebraic and logic styles of specification in a uniform framework, the notion of a logic labelled transition system (Logic LTS or LLTS for short) has been introduced and explored. A variety of constructors over LLTS, including usual process-algebraic operators, logic connectives (<jats:italic>conjunction<\/jats:italic> and <jats:italic>disjunction<\/jats:italic>) and standard temporal modalities (<jats:italic>always<\/jats:italic> and <jats:italic>unless<\/jats:italic>), have been given. However, no attempt has been made so far to develop the general theory concerning (nested) recursive operations over LLTS and a few fundamental problems are still open. This paper intends to study this issue in a pure process-algebraic style. A few fundamental properties, including precongruence and the uniqueness of consistent solutions of equations, will be established.<\/jats:p>","DOI":"10.1017\/s0960129514000073","type":"journal-article","created":{"date-parts":[[2014,11,10]],"date-time":"2014-11-10T17:59:53Z","timestamp":1415642393000},"page":"1382-1431","source":"Crossref","is-referenced-by-count":1,"title":["On recursive operations over logic LTS"],"prefix":"10.1017","volume":"25","author":[{"given":"YAN","family":"ZHANG","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"ZHAOHUI","family":"ZHU","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"JINJIN","family":"ZHANG","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"56","published-online":{"date-parts":[[2014,11,10]]},"reference":[{"key":"S0960129514000073_ref4","doi-asserted-by":"publisher","DOI":"10.1016\/B978-044482830-9\/50023-0"},{"key":"S0960129514000073_ref12","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(84)90113-0"},{"key":"S0960129514000073_ref20","volume-title":"Communication and Concurrency","author":"Milner","year":"1989"},{"key":"S0960129514000073_ref18","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2011.03.015"},{"key":"S0960129514000073_ref9","volume-title":"Model Checking","author":"Clarke","year":"2000"},{"key":"S0960129514000073_ref8","doi-asserted-by":"publisher","DOI":"10.1145\/234752.234756"},{"key":"S0960129514000073_ref10","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44450-5_25"},{"key":"S0960129514000073_ref2","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.1994.316076"},{"key":"S0960129514000073_ref14","volume-title":"Communicating Sequential Processes","author":"Hoare","year":"1985"},{"key":"S0960129514000073_ref5","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(84)80025-X"},{"key":"S0960129514000073_ref19","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(83)90114-7"},{"key":"S0960129514000073_ref13","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(93)90111-6"},{"key":"S0960129514000073_ref24","first-page":"46","volume-title":"Symposium on Foundations of Computer Science (FOCS 1977)","author":"Pnueli","year":"1977"},{"key":"S0960129514000073_ref21","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(89)90070-9"},{"key":"S0960129514000073_ref16","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2006.10.022"},{"key":"S0960129514000073_ref26","unstructured":"Zhang Y. , Zhu Z. H. and Zhang J. J. (2013) On recursive operations over Logic LTS. arXiv:1301.3350."},{"key":"S0960129514000073_ref11","doi-asserted-by":"publisher","DOI":"10.1016\/S1571-0661(05)80362-7"},{"key":"S0960129514000073_ref6","unstructured":"Bloom B. (1994) Ready Simulation, Bisimulation, and the Semantics of the CCS-Like Languages, Ph.D. dissertation, Massachusetts Institute of Technology, Cambridge."},{"key":"S0960129514000073_ref25","unstructured":"Zhang Y. , Zhu Z. H. , Zhang J. J. and Zhou Y. (2011) A process algebra with logical operators. arXiv:1212.2257."},{"key":"S0960129514000073_ref7","doi-asserted-by":"publisher","DOI":"10.1145\/200836.200876"},{"key":"S0960129514000073_ref3","doi-asserted-by":"publisher","DOI":"10.1017\/S0960129508007111"},{"key":"S0960129514000073_ref1","doi-asserted-by":"publisher","DOI":"10.1017\/S0960129511000375"},{"key":"S0960129514000073_ref15","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(91)90030-6"},{"key":"S0960129514000073_ref22","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(92)90008-4"},{"key":"S0960129514000073_ref23","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-3540-6"},{"key":"S0960129514000073_ref17","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2010.02.001"}],"container-title":["Mathematical Structures in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0960129514000073","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,20]],"date-time":"2019-04-20T19:39:23Z","timestamp":1555789163000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0960129514000073\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,11,10]]},"references-count":26,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2015,9]]}},"alternative-id":["S0960129514000073"],"URL":"https:\/\/doi.org\/10.1017\/s0960129514000073","relation":{},"ISSN":["0960-1295","1469-8072"],"issn-type":[{"value":"0960-1295","type":"print"},{"value":"1469-8072","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,11,10]]}}}