乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T15:40:07Z","timestamp":1649086807525},"reference-count":59,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1997,5,1]],"date-time":"1997-05-01T00:00:00Z","timestamp":862444800000},"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":5921,"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":[[1997,5]]},"DOI":"10.1016\/s0304-3975(96)00292-7","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T23:53:40Z","timestamp":1051142020000},"page":"351-380","source":"Crossref","is-referenced-by-count":13,"title":["A general conservative extension theorem in process algebras with inequalities"],"prefix":"10.1016","volume":"177","author":[{"given":"Pedro R.","family":"D'Argenio","sequence":"first","affiliation":[]},{"given":"Chris","family":"Verhoef","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(96)00292-7_BIB1","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/0304-3975(87)90065-X","article-title":"Observation equivalence as a testing equivalence","volume":"53","author":"Abramsky","year":"1987","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(96)00292-7_BIB2","series-title":"Proc. Mathematical Foundations of Programming Semantics (MFPS 7)","first-page":"376","article-title":"On relating concurrency and nondeterminism","volume":"Vol. 598","author":"Aceto","year":"1991"},{"key":"10.1016\/S0304-3975(96)00292-7_BIB3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1006\/inco.1994.1040","article-title":"Turning SOS rules into equations","volume":"111","author":"Aceto","year":"1994","journal-title":"Inform. Comput."},{"key":"10.1016\/S0304-3975(96)00292-7_BIB4","article-title":"Term rewriting analysis in process algebra","author":"Akkerman","year":"1990"},{"issue":"2","key":"10.1016\/S0304-3975(96)00292-7_BIB5","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1007\/BF01898401","article-title":"Real time process algebra","volume":"3","author":"Baeten","year":"1991","journal-title":"Formal Aspects Comput."},{"key":"10.1016\/S0304-3975(96)00292-7_BIB6","doi-asserted-by":"crossref","unstructured":"J.C.M. Baeten and J.A. Bergstra, Non-interleaving process algebra, in: [15, pp. 308\u2013323].","DOI":"10.1007\/3-540-57208-2_22"},{"issue":"2","key":"10.1016\/S0304-3975(96)00292-7_BIB7","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 Comput."},{"issue":"2","key":"10.1016\/S0304-3975(96)00292-7_BIB8","first-page":"127","article-title":"Syntax and defining equations for an interrupt mechanism in process algebra","volume":"IX","author":"Baeten","year":"1986","journal-title":"Fund. Inform."},{"key":"10.1016\/S0304-3975(96)00292-7_BIB9","series-title":"Proc. CONCUR 90","volume":"Vol. 458","year":"1990"},{"key":"10.1016\/S0304-3975(96)00292-7_BIB10","article-title":"Concrete process algebra","volume":"Vol. 4","author":"Baeten","year":"1995"},{"key":"10.1016\/S0304-3975(96)00292-7_BIB11","article-title":"Process Algebra","volume":"Vol. 18","author":"Baeten","year":"1990"},{"issue":"4","key":"10.1016\/S0304-3975(96)00292-7_BIB12","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1093\/comjnl\/37.4.243","article-title":"Process algebra with iteration and nesting","volume":"37","author":"Bergstra","year":"1994","journal-title":"Comput. J."},{"issue":"1\/3","key":"10.1016\/S0304-3975(96)00292-7_BIB13","first-page":"109","article-title":"Process algebra for synchronous communication","volume":"60","author":"Bergstra","year":"1984","journal-title":"Inform. and Comput."},{"key":"10.1016\/S0304-3975(96)00292-7_BIB14","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/0304-3975(85)90088-X","article-title":"Algebra of communicating processes with abstraction","volume":"37","author":"Bergstra","year":"1985","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(96)00292-7_BIB15","series-title":"Proc. CONCUR 93","volume":"Vol. 715","year":"1993"},{"key":"10.1016\/S0304-3975(96)00292-7_BIB16","series-title":"Conf. Record of the 15th ACM Symp. on Principles of Programming Languages","first-page":"229","author":"Bloom","year":"1988"},{"key":"10.1016\/S0304-3975(96)00292-7_BIB17","doi-asserted-by":"crossref","first-page":"232","DOI":"10.1145\/200836.200876","article-title":"Bisimulation can't be traced","volume":"42","author":"Bloom","year":"1995","journal-title":"J. ACM"},{"issue":"5","key":"10.1016\/S0304-3975(96)00292-7_BIB18","doi-asserted-by":"crossref","first-page":"863","DOI":"10.1145\/234752.234756","article-title":"The meaning of negative premises in transition system specifications","volume":"43","author":"Bol","year":"1996","journal-title":"J. ACM"},{"key":"10.1016\/S0304-3975(96)00292-7_BIB19","series-title":"Proc. Internat. Symp. on Theoretical Aspects of Computer Software (TACS'94)","first-page":"425","article-title":"Term rewriting properties of SOS axiomatisations","volume":"Vol. 789","author":"Bosscher","year":"1994"},{"issue":"1\/2","key":"10.1016\/S0304-3975(96)00292-7_BIB20","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1016\/0304-3975(88)90096-5","article-title":"Concurrency and atomicity","volume":"59","author":"Boudol","year":"1988","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(96)00292-7_BIB21","series-title":"Proc. MFCS'93","article-title":"Observing distribution in processes","volume":"Vol. 711","author":"Castellani","year":"1993"},{"key":"10.1016\/S0304-3975(96)00292-7_BIB22","doi-asserted-by":"crossref","unstructured":"P.R. D'Argenio, A general conservative extension theorem in process algebras with inequalities, in: [41, pp. 67\u201379].","DOI":"10.1016\/S0304-3975(96)00292-7"},{"key":"10.1016\/S0304-3975(96)00292-7_BIB23_1","article-title":"A conservative look at term deduction systems with variable binding","author":"Fokkink","year":"1995"},{"key":"10.1016\/S0304-3975(96)00292-7_BIB23_2","series-title":"Logic Group Preprint Series 140","author":"Fokkink","year":"1995"},{"issue":"4","key":"10.1016\/S0304-3975(96)00292-7_BIB24","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1093\/comjnl\/37.4.259","article-title":"Basic process algebra with iteration: completeness of its equational axioms","volume":"37","author":"Fokkink","year":"1994","journal-title":"Comput. J."},{"key":"10.1016\/S0304-3975(96)00292-7_BIB25","article-title":"Applied Algebra for the Computer Sciences","author":"Gill","year":"1976"},{"issue":"2","key":"10.1016\/S0304-3975(96)00292-7_BIB26","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1016\/0304-3975(93)90111-6","article-title":"Transition system specifications with negative premises","volume":"118","author":"Groote","year":"1993","journal-title":"Theoret. Comput. Sci."},{"issue":"2","key":"10.1016\/S0304-3975(96)00292-7_BIB27","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1016\/0890-5401(92)90013-6","article-title":"Structured operational semantics and bisimulation as a congruence","volume":"100","author":"Groote","year":"1992","journal-title":"Inform. and Comput."},{"key":"10.1016\/S0304-3975(96)00292-7_BIB28","series-title":"Algebraic Theory of Processes","author":"Hennessy","year":"1988"},{"key":"10.1016\/S0304-3975(96)00292-7_BIB29","series-title":"7th Internat. Conf. on Automated Deduction","first-page":"175","article-title":"Termination of a set of rules modulo a set of equations","volume":"Vol. 170","author":"Jouannaud","year":"1984"},{"key":"10.1016\/S0304-3975(96)00292-7_BIB30","series-title":"Proc. CONCUR 91","first-page":"376","article-title":"Completeness in real time process algebra","volume":"Vol. 527","author":"Klusener","year":"1991"},{"key":"10.1016\/S0304-3975(96)00292-7_BIB31","article-title":"Models and axioms for a fragment of real time process algebra","author":"Klusener","year":"1993"},{"key":"10.1016\/S0304-3975(96)00292-7_BIB32","article-title":"Extending process algebra with the empty process \u03b5","author":"Koymans","year":"1985"},{"key":"10.1016\/S0304-3975(96)00292-7_BIB33","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1016\/0022-0000(84)90023-0","article-title":"A complete inference system for a class of regular behaviours","volume":"28","author":"Milner","year":"1984","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0304-3975(96)00292-7_BIB34","series-title":"Communication and Concurrency","author":"Milner","year":"1989"},{"key":"10.1016\/S0304-3975(96)00292-7_BIB35","doi-asserted-by":"crossref","unstructured":"F. Moller and C. Tofts, A temporal calculus of communicating systems, in: [9, pp. 401\u2013415].","DOI":"10.1007\/BFb0039073"},{"key":"10.1016\/S0304-3975(96)00292-7_BIB36","article-title":"The algebra of timed processes ATP: theory and application (revised version)","author":"Nicollin","year":"1991"},{"key":"10.1016\/S0304-3975(96)00292-7_BIB37","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1006\/inco.1994.1083","article-title":"The algebra of timed processes ATP: theory and application","volume":"114","author":"Nicollin","year":"1994","journal-title":"Inform. Comput."},{"key":"10.1016\/S0304-3975(96)00292-7_BIB38","series-title":"Proc. 5th Conf. on Foundations of Software Technology and Theoretical Computer Science","first-page":"89","article-title":"Degrees of non-determinism and concurrency: a Petri net view","volume":"Vol. 181","author":"Nielsen","year":"1984"},{"key":"10.1016\/S0304-3975(96)00292-7_BIB39","series-title":"5th GI Conf.","first-page":"167","article-title":"Concurrency and automata on infinite sequences","volume":"Vol. 104","author":"Park","year":"1981"},{"key":"10.1016\/S0304-3975(96)00292-7_BIB40","article-title":"A structural approach to operational semantics","author":"Plotkin","year":"1981"},{"key":"10.1016\/S0304-3975(96)00292-7_BIB41","series-title":"Proc 2nd Workshop ACP'95","year":"1995"},{"key":"10.1016\/S0304-3975(96)00292-7_BIB42","series-title":"Proc. 9th Amu. Symp. on Logic in Computer Science","first-page":"62","article-title":"Bisimulation is not (first order) equationally axiomatisable","author":"Sewell","year":"1994"},{"key":"10.1016\/S0304-3975(96)00292-7_BIB43","series-title":"Proc. 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\/S0304-3975(96)00292-7_BIB44","doi-asserted-by":"crossref","unstructured":"R.J. van Glabbeek, The linear time \u2014 branching time spectrum, in: [9, pp. 278\u2013297].","DOI":"10.1007\/3-540-57208-2_6"},{"key":"10.1016\/S0304-3975(96)00292-7_BIB45","unstructured":"R.J. van Glabbeek, The linear time \u2014 branching time spectrum II (the semantics of sequential systems with silent moves), in [15, pp. 66\u201381]."},{"key":"10.1016\/S0304-3975(96)00292-7_BIB46_1","series-title":"Proc. 23rd ICALP","first-page":"502","article-title":"The meaning of negative premises in transition system specifications II (extended abstract)","volume":"Vol. 1099","author":"van Glabbeek","year":"1996"},{"key":"10.1016\/S0304-3975(96)00292-7_BIB46_2","series-title":"Report STAN-CS-TN-95-16","author":"van Glabbeek","year":"1995"},{"issue":"3","key":"10.1016\/S0304-3975(96)00292-7_BIB47","doi-asserted-by":"crossref","first-page":"555","DOI":"10.1145\/233551.233556","article-title":"Branching time and abstraction in bisimulation semantics","volume":"43","author":"van Glabbeek","year":"1996","journal-title":"J. ACM"},{"key":"10.1016\/S0304-3975(96)00292-7_BIB48","series-title":"Proc. IFIP Conf. Programming Concepts, Methods and Calculi","first-page":"149","article-title":"A general conservative extension theorem in process algebra","volume":"Vol. A-56","author":"Verhoef","year":"1994"},{"key":"10.1016\/S0304-3975(96)00292-7_BIB49","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":"Nord. J. Comput."},{"key":"10.1016\/S0304-3975(96)00292-7_BIB50","article-title":"Process algebra with autonomous actions","author":"Voorhoeve","year":"1996"},{"key":"10.1016\/S0304-3975(96)00292-7_BIB51","unstructured":"A preliminary version appeared in [41, pp. 181\u2013194]."},{"key":"10.1016\/S0304-3975(96)00292-7_BIB52","article-title":"Studies in process algebra, algebraic specifications and parallelism","author":"Vrancken","year":"1991"},{"issue":"2","key":"10.1016\/S0304-3975(96)00292-7_BIB53","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1016\/0890-5401(90)90048-M","article-title":"Bisimulation and divergence","volume":"85","author":"Walker","year":"1990","journal-title":"Inform. and Comput."},{"key":"10.1016\/S0304-3975(96)00292-7_BIB54","series-title":"Universal Algebra for Computer Scientists","author":"Wechler","year":"1992"},{"key":"10.1016\/S0304-3975(96)00292-7_BIB55","article-title":"Parametric views of process description languages","author":"Yankelevich","year":"1993"},{"key":"10.1016\/S0304-3975(96)00292-7_BIB56","unstructured":"W. Yi, Real-time behaviour of asynchronous agents [9, pp. 502\u2013520]."},{"key":"10.1016\/S0304-3975(96)00292-7_BIB57","doi-asserted-by":"crossref","first-page":"89","DOI":"10.3233\/FI-1995-24124","article-title":"Termination of term rewriting by semantic labelling","volume":"24","author":"Zantema","year":"1995","journal-title":"Fund. Inform."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397596002927?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397596002927?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T17:49:37Z","timestamp":1578505777000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397596002927"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,5]]},"references-count":59,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1997,5]]}},"alternative-id":["S0304397596002927"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(96)00292-7","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1997,5]]}}}