乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T16:26:13Z","timestamp":1710347173536},"reference-count":30,"publisher":"Elsevier BV","issue":"28","license":[{"start":{"date-parts":[[2011,6,1]],"date-time":"2011-06-01T00:00:00Z","timestamp":1306886400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2015,6,20]],"date-time":"2015-06-20T00:00:00Z","timestamp":1434758400000},"content-version":"vor","delay-in-days":1480,"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":[[2011,6]]},"DOI":"10.1016\/j.tcs.2011.01.024","type":"journal-article","created":{"date-parts":[[2011,2,2]],"date-time":"2011-02-02T09:45:14Z","timestamp":1296639914000},"page":"3045-3071","source":"Crossref","is-referenced-by-count":9,"title":["SOS rule formats for zero and unit elements"],"prefix":"10.1016","volume":"412","author":[{"given":"Luca","family":"Aceto","sequence":"first","affiliation":[]},{"given":"Matteo","family":"Cimini","sequence":"additional","affiliation":[]},{"given":"Anna","family":"Ingolfsdottir","sequence":"additional","affiliation":[]},{"given":"MohammadReza","family":"Mousavi","sequence":"additional","affiliation":[]},{"given":"Michel A.","family":"Reniers","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.tcs.2011.01.024_br000005","series-title":"Fundamentals of Software Engineering","first-page":"146","article-title":"Rule formats for determinism and idempotence","volume":"vol. 5961","author":"Aceto","year":"2010"},{"key":"10.1016\/j.tcs.2011.01.024_br000010","series-title":"Proceedings of Structural Operational Semantics 2009","first-page":"1","article-title":"A bisimulation-based method for proving the validity of equations in GSOS languages","volume":"vol. 18","author":"Aceto","year":"2010"},{"key":"10.1016\/j.tcs.2011.01.024_br000015","series-title":"Proceedings of the 26th Conference on the Mathematical Foundations of Programming Semantics","article-title":"On rule formats for zero and unit elements","author":"Aceto","year":"2010"},{"key":"10.1016\/j.tcs.2011.01.024_br000020","series-title":"Handbook of Process Algebra","first-page":"197","article-title":"Structural operational semantics","author":"Aceto","year":"1999"},{"key":"10.1016\/j.tcs.2011.01.024_br000025","first-page":"81","article-title":"Algebraic properties for free!","volume":"99","author":"Aceto","year":"2009","journal-title":"Bulletin of the EATCS"},{"key":"10.1016\/j.tcs.2011.01.024_br000030","series-title":"SOFSEM 2010, 36th Conference on Current Trends in Theory and Practice of Computer Science","first-page":"141","article-title":"Rule formats for unit elements","volume":"vol. 5901","author":"Aceto","year":"2010"},{"key":"10.1016\/j.tcs.2011.01.024_br000035","series-title":"Process Algebra: Equational Theories of Communicating Processes","volume":"vol. 50","author":"Baeten","year":"2009"},{"issue":"2","key":"10.1016\/j.tcs.2011.01.024_br000040","doi-asserted-by":"crossref","first-page":"188","DOI":"10.1007\/BF01214556","article-title":"Discrete time process algebra","volume":"8","author":"Baeten","year":"1996","journal-title":"Formal Aspects of Computing"},{"key":"10.1016\/j.tcs.2011.01.024_br000045","unstructured":"J. Baeten, J. Bergstra, Mode transfer in process algebra, Technical Report Report CSR 00\u201301, Eindhoven University of Technology, 2000."},{"key":"10.1016\/j.tcs.2011.01.024_br000050","series-title":"Process Algebra with Timing","author":"Baeten","year":"2002"},{"key":"10.1016\/j.tcs.2011.01.024_br000055","series-title":"CONCUR\u201990: Proceedings of the Theories of Concurrency: Unification and Extension","first-page":"83","article-title":"Process algebra with a zero object","author":"Baeten","year":"1990"},{"key":"10.1016\/j.tcs.2011.01.024_br000060","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1016\/j.jlap.2004.03.001","article-title":"Axiomatizing GSOS with termination","volume":"60\u201361","author":"Baeten","year":"2004","journal-title":"Journal of Logic and Algebraic Programming"},{"key":"10.1016\/j.tcs.2011.01.024_br000065","series-title":"Report IW 206","article-title":"Fixed point semantics in process algebras","author":"Bergstra","year":"1982"},{"issue":"1\/3","key":"10.1016\/j.tcs.2011.01.024_br000070","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/S0019-9958(84)80025-X","article-title":"Process algebra for synchronous communication","volume":"60","author":"Bergstra","year":"1984","journal-title":"Information and Control"},{"issue":"2","key":"10.1016\/j.tcs.2011.01.024_br000075","doi-asserted-by":"crossref","first-page":"172","DOI":"10.1016\/j.jlap.2006.08.004","article-title":"Preferential choice and coordination conditions","volume":"70","author":"Bergstra","year":"2007","journal-title":"The Journal of Logic and Algebraic Programming"},{"issue":"1","key":"10.1016\/j.tcs.2011.01.024_br000080","doi-asserted-by":"crossref","first-page":"232","DOI":"10.1145\/200836.200876","article-title":"Bisimulation can\u2019t be traced","volume":"42","author":"Bloom","year":"1995","journal-title":"Journal of the ACM"},{"key":"10.1016\/j.tcs.2011.01.024_br000085","series-title":"Proceedings of the 19th International Conference on Concurrency Theory","first-page":"447","article-title":"A rule format for associativity","volume":"vol. 5201","author":"Cranen","year":"2008"},{"issue":"1","key":"10.1016\/j.tcs.2011.01.024_br000090","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1145\/2455.2460","article-title":"Algebraic laws for nondeterminism and concurrency","volume":"32","author":"Hennessy","year":"1985","journal-title":"Journal of the ACM"},{"key":"10.1016\/j.tcs.2011.01.024_br000095","series-title":"Communicating Sequential Processes","author":"Hoare","year":"1985"},{"issue":"8","key":"10.1016\/j.tcs.2011.01.024_br000100","doi-asserted-by":"crossref","first-page":"666","DOI":"10.1145\/359576.359585","article-title":"Communicating sequential processes","volume":"21","author":"Hoare","year":"1978","journal-title":"Commun. ACM"},{"key":"10.1016\/j.tcs.2011.01.024_br000105","series-title":"Communication and Concurrency","author":"Milner","year":"1989"},{"issue":"217\u2013223","key":"10.1016\/j.tcs.2011.01.024_br000110","article-title":"A syntactic commutativity format for SOS","volume":"93","author":"Mousavi","year":"2005","journal-title":"Information Processing Letters"},{"issue":"3","key":"10.1016\/j.tcs.2011.01.024_br000115","doi-asserted-by":"crossref","first-page":"238","DOI":"10.1016\/j.tcs.2006.12.019","article-title":"SOS formats and meta-theory: 20 years after","volume":"373","author":"Mousavi","year":"2007","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/j.tcs.2011.01.024_br000120","series-title":"Proceedings of the 5th GI-Conference on Theoretical Computer Science","first-page":"167","article-title":"Concurrency and automata on infinite sequences","author":"Park","year":"1981"},{"key":"10.1016\/j.tcs.2011.01.024_br000125","unstructured":"G.D. Plotkin, A structural approach to operational semantics, Technical Report DAIMI FN-19, University of Aarhus, 1981."},{"key":"10.1016\/j.tcs.2011.01.024_br000130","series-title":"Automata, Languages and Programming","first-page":"418","article-title":"A powerdomain for countable non-determinism (extended abstract)","volume":"vol. 140","author":"Plotkin","year":"1982"},{"key":"10.1016\/j.tcs.2011.01.024_br000135","first-page":"17","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":"10.1016\/j.tcs.2011.01.024_br000140","doi-asserted-by":"crossref","first-page":"445","DOI":"10.3233\/FI-1990-13404","article-title":"The well-founded semantics coincides with the three-valued stable semantics","volume":"13","author":"Przymusinski","year":"1990","journal-title":"Fundamenta Informaticae"},{"key":"10.1016\/j.tcs.2011.01.024_br000145","series-title":"The Pi-calculus: A Theory of Mobile Processes","author":"Sangiorgi","year":"2001"},{"issue":"2","key":"10.1016\/j.tcs.2011.01.024_br000150","first-page":"274","article-title":"A congruence theorem for structured operational semantics with predicates and negative premises","volume":"2","author":"Verhoef","year":"1995","journal-title":"Nordic Journal on Computing"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397511000685?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397511000685?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2021,11,18]],"date-time":"2021-11-18T11:22:02Z","timestamp":1637234522000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397511000685"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,6]]},"references-count":30,"journal-issue":{"issue":"28","published-print":{"date-parts":[[2011,6]]}},"alternative-id":["S0304397511000685"],"URL":"https:\/\/doi.org\/10.1016\/j.tcs.2011.01.024","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2011,6]]}}}