乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,4]],"date-time":"2023-09-04T18:25:26Z","timestamp":1693851926881},"reference-count":32,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2007,12,1]],"date-time":"2007-12-01T00:00:00Z","timestamp":1196467200000},"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":2055,"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":[[2007,12]]},"DOI":"10.1016\/j.tcs.2007.06.002","type":"journal-article","created":{"date-parts":[[2007,6,18]],"date-time":"2007-06-18T03:32:29Z","timestamp":1182137549000},"page":"83-108","source":"Crossref","is-referenced-by-count":27,"title":["Modular construction of complete coalgebraic logics"],"prefix":"10.1016","volume":"388","author":[{"given":"Corina","family":"C\u01d0rstea","sequence":"first","affiliation":[]},{"given":"Dirk","family":"Pattinson","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.tcs.2007.06.002_b1","series-title":"Category Theory and Computer Science","article-title":"A final coalgebra theorem","volume":"vol. 389","author":"Aczel","year":"1989"},{"key":"10.1016\/j.tcs.2007.06.002_b2","unstructured":"F. Bartels, On generalised coinduction and probabilistic specification formats, Ph.D. Thesis, CWI, Amsterdam, 2004"},{"key":"10.1016\/j.tcs.2007.06.002_b3","series-title":"Proc. CMCS 2003","article-title":"A hierarchy of probabilistic system types","volume":"vol. 82","author":"Bartels","year":"2003"},{"key":"10.1016\/j.tcs.2007.06.002_b4","series-title":"Modal Logic","author":"Blackburn","year":"2000"},{"key":"10.1016\/j.tcs.2007.06.002_b5","series-title":"Proc. CMCS 2003","article-title":"On expressivity and compositionality in logics for coalgebras","volume":"vol. 82","author":"C\u01d0rstea","year":"2003"},{"issue":"1\u20132","key":"10.1016\/j.tcs.2007.06.002_b6","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/j.tcs.2004.07.021","article-title":"A compositional approach to defining logics for coalgebras","volume":"327","author":"C\u01d0rstea","year":"2004","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/j.tcs.2007.06.002_b7","series-title":"Workshop on Logics of Programs","article-title":"Synthesis of synchronisation skeletons for branching temporal logics","volume":"vol. 131","author":"Clarke","year":"1981"},{"key":"10.1016\/j.tcs.2007.06.002_b8","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1016\/S0304-3975(99)00035-3","article-title":"Bisimulation for probabilistic transition systems: A coalgebraic approach","volume":"221","author":"de Vink","year":"1999","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/j.tcs.2007.06.002_b9","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1006\/inco.2001.2962","article-title":"Bisimulation for labelled Markov processes","volume":"179","author":"Desharnais","year":"2002","journal-title":"Information and Computation"},{"key":"10.1016\/j.tcs.2007.06.002_b10","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1006\/game.1999.0788","article-title":"Probability logic for type spaces","volume":"35","author":"Heifetz","year":"2001","journal-title":"Games and Economic Behaviour"},{"issue":"1","key":"10.1016\/j.tcs.2007.06.002_b11","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1051\/ita:2001108","article-title":"Many-sorted coalgebraic modal logic: A model-theoretic study","volume":"35","author":"Jacobs","year":"2001","journal-title":"Theoretical Informatics and Applications"},{"key":"10.1016\/j.tcs.2007.06.002_b12","article-title":"Categorical logic and type theory","volume":"vol. 141","author":"Jacobs","year":"1999"},{"key":"10.1016\/j.tcs.2007.06.002_b13","series-title":"Handbook of Process Algebra","first-page":"685","article-title":"Probabilistic extensions of process algebras","author":"Jonsson","year":"2001"},{"key":"10.1016\/j.tcs.2007.06.002_b14","series-title":"Proc. ICALP 2002","article-title":"Bialgebraic modelling of timed processes","volume":"vol. 2380","author":"Kick","year":"2002"},{"key":"10.1016\/j.tcs.2007.06.002_b15","series-title":"Proc. MFPS XXIII","article-title":"Coalgebraic modal logic beyond sets","volume":"vol. 173","author":"Klin","year":"2007"},{"key":"10.1016\/j.tcs.2007.06.002_b16","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1016\/0304-3975(82)90125-6","article-title":"Results on the propositional mu-calculus","volume":"27","author":"Kozen","year":"1983","journal-title":"Theoretical Computer Science"},{"issue":"1\u20132","key":"10.1016\/j.tcs.2007.06.002_b17","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/S0304-3975(00)00125-0","article-title":"Specifying coalgebras with modal logic","volume":"260","author":"Kurz","year":"2001","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/j.tcs.2007.06.002_b18","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1016\/j.entcs.2004.02.037","article-title":"Algebraic semantics for coalgebraic modal logic","volume":"106","author":"Kupke","year":"2004","journal-title":"Electronic Notes in Theoretical Computer Science"},{"key":"10.1016\/j.tcs.2007.06.002_b19","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0890-5401(91)90030-6","article-title":"Bisimulation through probabilistic testing","volume":"94","author":"Larsen","year":"1991","journal-title":"Information and Computation"},{"key":"10.1016\/j.tcs.2007.06.002_b20","series-title":"Communication and Concurrency","author":"Milner","year":"1989"},{"key":"10.1016\/j.tcs.2007.06.002_b21","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1016\/S0168-0072(98)00042-6","article-title":"Coalgebraic logic","volume":"96","author":"Moss","year":"1999","journal-title":"Annals of Pure and Applied Logic"},{"key":"10.1016\/j.tcs.2007.06.002_b22","unstructured":"P. Naur, B. Randell (Eds.), Software Engineering: Report of a Conference Sponsored by the NATO Science Committee, Garmisch, Germany, 7\u201311 Oct., 1968. Scientific Affairs Division, NATO, 1969"},{"key":"10.1016\/j.tcs.2007.06.002_b23","series-title":"Proceedings of the 5th GI Conference","article-title":"Concurrency and automata on infinite sequences","volume":"vol. 104","author":"Park","year":"1981"},{"issue":"1\u20133","key":"10.1016\/j.tcs.2007.06.002_b24","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/S0304-3975(03)00201-9","article-title":"Coalgebraic modal logic: Soundness, completeness and decidability of local consequence","volume":"309","author":"Pattinson","year":"2003","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"10.1016\/j.tcs.2007.06.002_b25","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1305\/ndjfl\/1094155277","article-title":"Expressive logics for coalgebras via terminal sequence induction","volume":"45","author":"Pattinson","year":"2004","journal-title":"Notre Dame Journal of Formal Logic"},{"key":"10.1016\/j.tcs.2007.06.002_b26","series-title":"Convex Analysis","author":"Rockafellar","year":"1970"},{"key":"10.1016\/j.tcs.2007.06.002_b27","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/S0304-3975(00)00128-6","article-title":"From modal logic to terminal coalgebras","volume":"260","author":"R\u00f6\u00dfiger","year":"2001","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/j.tcs.2007.06.002_b28","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/S0304-3975(00)00056-6","article-title":"Universal coalgebra: A theory of systems","volume":"249","author":"Rutten","year":"2000","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/j.tcs.2007.06.002_b29","unstructured":"R. Segala, Modelling and verification of randomized distributed real-time systems, Ph.D. Thesis, Massachusetts Institute of Technology, 1995"},{"key":"10.1016\/j.tcs.2007.06.002_b30","series-title":"Proc. 12th LICS Conference","first-page":"280","article-title":"Towards a mathematical operational semantics","author":"Turi","year":"1999"},{"key":"10.1016\/j.tcs.2007.06.002_b31","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1006\/inco.1995.1123","article-title":"Reactive, generative, and stratified models of probabilistic processes","volume":"121","author":"van Glabbeek","year":"1995","journal-title":"Information and Computation"},{"key":"10.1016\/j.tcs.2007.06.002_b32","doi-asserted-by":"crossref","first-page":"184","DOI":"10.1016\/j.tcs.2004.12.009","article-title":"On the final sequence of a finitary set functor","volume":"338","author":"Worrell","year":"2005","journal-title":"Theoretical Computer Science"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397507004793?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397507004793?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,6]],"date-time":"2019-01-06T15:51:24Z","timestamp":1546789884000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397507004793"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,12]]},"references-count":32,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2007,12]]}},"alternative-id":["S0304397507004793"],"URL":"https:\/\/doi.org\/10.1016\/j.tcs.2007.06.002","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2007,12]]}}}