{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,25]],"date-time":"2026-01-25T04:38:51Z","timestamp":1769315931536,"version":"3.49.0"},"reference-count":26,"publisher":"Elsevier BV","issue":"2-3","license":[{"start":{"date-parts":[[1990,5,1]],"date-time":"1990-05-01T00:00:00Z","timestamp":641520000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":8478,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1990,5]]},"DOI":"10.1016\/0304-3975(90)90038-j","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:47:37Z","timestamp":1027640857000},"page":"265-288","source":"Crossref","is-referenced-by-count":93,"title":["Proof systems for satisfiability in Hennessy-Milner Logic with recursion"],"prefix":"10.1016","volume":"72","author":[{"given":"Kim G.","family":"Larsen","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(90)90038-J_BIB1","series-title":"Handbook of Mathematical Logic","article-title":"An introduction to inductive definitions","author":"Aczel","year":"1983"},{"key":"10.1016\/0304-3975(90)90038-J_BIB2","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1007\/BF01257083","article-title":"The temporal logic of branching time","volume":"20","author":"Ben-Ari","year":"1983","journal-title":"Acta Inform."},{"key":"10.1016\/0304-3975(90)90038-J_BIB3","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/0304-3975(85)90004-0","article-title":"A logical characterization of observation equivalence","volume":"35","author":"Bloom","year":"1985","journal-title":"Theoret Comput. Sci."},{"key":"10.1016\/0304-3975(90)90038-J_BIB4","article-title":"Behavioural Equivalence Relations Induced by Programming Logics","volume":"154","author":"Brookes","year":"1983"},{"key":"10.1016\/0304-3975(90)90038-J_BIB5","series-title":"Logics of Programs","first-page":"52","article-title":"Design and synthesis of synchronization skeletons using branching time temporal logic","volume":"131","author":"Clarke","year":"1981"},{"key":"10.1016\/0304-3975(90)90038-J_BIB6","first-page":"117","article-title":"Automatic verification of finite state concurrent systems using temporal logic specifications: a practical approach","author":"Clarke","year":"1983","journal-title":"Proc. 10th ACM POPL"},{"key":"10.1016\/0304-3975(90)90038-J_BIB7","article-title":"A modal characterization of observational congruence on finite terms of CCS","volume":"172","author":"Graf","year":"1984"},{"key":"10.1016\/0304-3975(90)90038-J_BIB8","doi-asserted-by":"crossref","first-page":"507","DOI":"10.1007\/BF00288467","article-title":"A logic for the specification and proof of regular controllable processes of CCS","volume":"23","author":"Graf","year":"1986","journal-title":"Acta Inform."},{"key":"10.1016\/0304-3975(90)90038-J_BIB9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0019-9958(86)80038-9","article-title":"A logic for the description of non-deterministic programs and their properties","volume":"68","author":"Graf","year":"1986","journal-title":"Inform. and Control"},{"key":"10.1016\/0304-3975(90)90038-J_BIB10","doi-asserted-by":"crossref","DOI":"10.1145\/2455.2460","article-title":"Algebraic laws for nondeterminism and concurrency","author":"Hennessy","year":"1985","journal-title":"J. AC"},{"key":"10.1016\/0304-3975(90)90038-J_BIB11","series-title":"9th ICALP","article-title":"Results on the propositional mu-calculus","volume":"140","author":"Kozen","year":"1982"},{"key":"10.1016\/0304-3975(90)90038-J_BIB12","article-title":"Proof systems for Hennessy-Milner logic with recursion","volume":"299","author":"Larsen","year":"1988"},{"key":"10.1016\/0304-3975(90)90038-J_BIB13","article-title":"Synthesis of Communicating Processes from Temporal Logic Specifications","volume":"131","author":"Manna","year":"1981"},{"key":"10.1016\/0304-3975(90)90038-J_BIB14","article-title":"A Calculus of Communicating Systems","volume":"92","author":"Milner","year":"1980"},{"key":"10.1016\/0304-3975(90)90038-J_BIB15","article-title":"A Modal Characterization of Observable Machine-Behaviour","volume":"112","author":"Milner","year":"1981"},{"key":"10.1016\/0304-3975(90)90038-J_BIB16","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1016\/0304-3975(83)90114-7","article-title":"Calculi for synchrony and asynchrony","volume":"25","author":"Milner","year":"1983","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(90)90038-J_BIB17","article-title":"Concurrency and automata on infinite sequences","volume":"84","author":"Park","year":"1980"},{"key":"10.1016\/0304-3975(90)90038-J_BIB18","series-title":"DAIMI-FN-19","article-title":"A structural approach to operational semantics","author":"Plotkin","year":"1981"},{"key":"10.1016\/0304-3975(90)90038-J_BIB19","series-title":"12th ICALP","article-title":"Linear and branching structures in the semantics and logics of reactive systems","volume":"194","author":"Pnueli","year":"1985"},{"key":"10.1016\/0304-3975(90)90038-J_BIB20","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/0304-3975(85)90129-X","article-title":"A proof theoretic characterization of observational equivalence","volume":"39","author":"Stirling","year":"1985","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(90)90038-J_BIB21","series-title":"CAAP '85","article-title":"A complete proof system for a subset of SCCS","volume":"185","author":"Stirling","year":"1985"},{"key":"10.1016\/0304-3975(90)90038-J_BIB22","series-title":"12th ICALP","article-title":"A compositional modal proof system for a subset of CCS","volume":"194","author":"Stirling","year":"1985"},{"key":"10.1016\/0304-3975(90)90038-J_BIB23","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1016\/0304-3975(87)90012-0","article-title":"Modal logics for communicating systems","volume":"49","author":"Stirling","year":"1987","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(90)90038-J_BIB24","doi-asserted-by":"crossref","DOI":"10.2140\/pjm.1955.5.285","article-title":"A lattice-theoretical fixpoint theorem and its applications","volume":"5","author":"Tarski","year":"1955","journal-title":"Pacific J. Math."},{"key":"10.1016\/0304-3975(90)90038-J_BIB25","article-title":"On the Composition and Decomposition of Assertions","volume":"197","author":"Winskel","year":"1984"},{"key":"10.1016\/0304-3975(90)90038-J_BIB26","series-title":"Technical Report","article-title":"A complete proof system for SCCS with modal assertions","author":"Winskel","year":"1985"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759090038J?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759090038J?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T23:51:24Z","timestamp":1555113084000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439759090038J"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,5]]},"references-count":26,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[1990,5]]}},"alternative-id":["030439759090038J"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(90)90038-j","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1990,5]]}}}