{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,22]],"date-time":"2024-07-22T07:12:33Z","timestamp":1721632353058},"reference-count":15,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1991,12,1]],"date-time":"1991-12-01T00:00:00Z","timestamp":691545600000},"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":7899,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information and Computation"],"published-print":{"date-parts":[[1991,12]]},"DOI":"10.1016\/0890-5401(91)90044-3","type":"journal-article","created":{"date-parts":[[2004,12,16]],"date-time":"2004-12-16T20:34:26Z","timestamp":1103229266000},"page":"192-217","source":"Crossref","is-referenced-by-count":4,"title":["Process expressions and Hoare's logic: Showing an irreconcilability of context-free recursion with Scott's induction rule"],"prefix":"10.1016","volume":"95","author":[{"given":"Alban","family":"Ponse","sequence":"first","affiliation":[]}],"member":"78","reference":[{"issue":"4","key":"10.1016\/0890-5401(91)90044-3_BIB1","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1145\/357146.357150","article-title":"Ten Years of Hoare's Logic: A Survey\u2014Part I","volume":"3","author":"Apt","year":"1981","journal-title":"ACM Trans. Prog. Languages Systems"},{"key":"10.1016\/0890-5401(91)90044-3_BIB2","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/0304-3975(83)90066-X","article-title":"Ten Years of Hoare's Logic: A Survey\u2014Part II: Nondeterminism","volume":"28","author":"Apt","year":"1984","journal-title":"Theoret. Comput. Sci."},{"issue":"3","key":"10.1016\/0890-5401(91)90044-3_BIB3","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/0890-5401(88)90027-2","article-title":"Global Renaming Operators over Concrete Process Algebra","volume":"78","author":"Baeten","year":"1988","journal-title":"Inform. Comput."},{"key":"10.1016\/0890-5401(91)90044-3_BIB4","series-title":"Proceedings Computing Science in the Netherlands (SION)","first-page":"279","article-title":"Recursive Process Definitions with the State Operator","author":"Baeten","year":"1988"},{"key":"10.1016\/0890-5401(91)90044-3_BIB5","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511624193","article-title":"Process Algebra","author":"Baeten","year":"1990"},{"key":"10.1016\/0890-5401(91)90044-3_BIB6","author":"de Bakker","year":"1980"},{"key":"10.1016\/0890-5401(91)90044-3_BIB7","series-title":"Current Trends in Concurrency","first-page":"51","article-title":"Contrasting themes in the semantics of imperative concurrency","volume":"Vol. 224","author":"de Bakker","year":"1986"},{"key":"10.1016\/0890-5401(91)90044-3_BIB8","series-title":"Mathematics and Computer Science II","first-page":"61","article-title":"Process Algebra: Specification and Verification in Bisimulation Semantics","volume":"Vol. 4","author":"Bergstra","year":"1986"},{"key":"10.1016\/0890-5401(91)90044-3_BIB9","author":"van Dalen","year":"1983"},{"key":"10.1016\/0890-5401(91)90044-3_BIB10","series-title":"Proceedings STACS 87","first-page":"336","article-title":"Bounded Nondeterminism and the Approximation Induction Principle in Process Algebra","volume":"Vol. 247","author":"van Glabbeek","year":"1987"},{"key":"10.1016\/0890-5401(91)90044-3_BIB11","author":"Hopcroft","year":"1979"},{"key":"10.1016\/0890-5401(91)90044-3_BIB12","article-title":"A Calculus of Communicating Systems","volume":"Vol. 92","author":"Milner","year":"1980"},{"key":"10.1016\/0890-5401(91)90044-3_BIB13","series-title":"Proceedings 5th GI Conference","first-page":"167","article-title":"Concurrency and automata on infinite sequences","volume":"Vol. 104","author":"Park","year":"1981"},{"key":"10.1016\/0890-5401(91)90044-3_BIB14","series-title":"Formal Description of Programming Concepts\u2014II","first-page":"199","article-title":"An Operational Semantics for CSP","author":"Plotkin","year":"1983"},{"key":"10.1016\/0890-5401(91)90044-3_BIB15","author":"Ponse","year":"1989"}],"container-title":["Information and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0890540191900443?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0890540191900443?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,31]],"date-time":"2019-01-31T01:25:35Z","timestamp":1548897935000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0890540191900443"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,12]]},"references-count":15,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1991,12]]}},"alternative-id":["0890540191900443"],"URL":"https:\/\/doi.org\/10.1016\/0890-5401(91)90044-3","relation":{},"ISSN":["0890-5401"],"issn-type":[{"value":"0890-5401","type":"print"}],"subject":[],"published":{"date-parts":[[1991,12]]}}}