乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:54:34Z","timestamp":1725551674484},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540309116"},{"type":"electronic","value":"9783540324256"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11601548_15","type":"book-chapter","created":{"date-parts":[[2005,12,10]],"date-time":"2005-12-10T00:39:45Z","timestamp":1134175185000},"page":"251-279","source":"Crossref","is-referenced-by-count":1,"title":["Timing the Untimed: Terminating Successfully While Being Conservative"],"prefix":"10.1007","author":[{"given":"J. C. M.","family":"Baeten","sequence":"first","affiliation":[]},{"given":"M. R.","family":"Mousavi","sequence":"additional","affiliation":[]},{"given":"M. A.","family":"Reniers","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"4","key":"15_CR1","doi-asserted-by":"publisher","first-page":"589","DOI":"10.1017\/S0960129503004006","volume":"13","author":"J.C.M. Baeten","year":"2003","unstructured":"Baeten, J.C.M.: Embedding untimed into timed process algebra: the case for explicit termination. Mathematical Structures in Computer Science (MSCS)\u00a013(4), 589\u2013618 (2003)","journal-title":"Mathematical Structures in Computer Science (MSCS)"},{"key":"15_CR2","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1007\/BF01898401","volume":"3","author":"J.C.M. Baeten","year":"1991","unstructured":"Baeten, J.C.M., Bergstra, J.A.: Real Time Process Algebra. Formal Aspects of Computing\u00a03, 142\u2013188 (1991)","journal-title":"Formal Aspects of Computing"},{"issue":"2","key":"15_CR3","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1007\/BF01214556","volume":"8","author":"J.C.M. Baeten","year":"1996","unstructured":"Baeten, J.C.M., Bergstra, J.A.: Discrete time process algebra. Formal Aspects of Computing\u00a08(2), 188\u2013208 (1996)","journal-title":"Formal Aspects of Computing"},{"key":"15_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1007\/3-540-18625-5_49","volume-title":"Foundations of Software Technology and Theoretical Computer Science","author":"J.C.M. Baeten","year":"1987","unstructured":"Baeten, J.C.M., van Glabbeek, R.J.: Merge and termination in process algebra. In: Nori, K.V. (ed.) FSTTCS 1987. LNCS, vol.\u00a0287, pp. 153\u2013172. Springer, Heidelberg (1987)"},{"key":"15_CR5","volume-title":"EATCS Monographs","author":"J.C.M. Baeten","year":"2002","unstructured":"Baeten, J.C.M., Middelburg, C.A.: Process Algebra with Timing. In: EATCS Monographs. Springer, Berlin (2002)"},{"key":"15_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/978-3-540-30080-9_3","volume-title":"Formal Methods for the Design of Real-Time Systems","author":"J.C.M. Baeten","year":"2004","unstructured":"Baeten, J.C.M., Reniers, M.A.: Timed process algebra (with a focus on explicit termination and relative-timing). In: Bernardo, M., Corradini, F. (eds.) SFM-RT 2004. LNCS, vol.\u00a03185, pp. 59\u201397. Springer, Heidelberg (2004)"},{"key":"15_CR7","series-title":"Cambridge Tracts in Theoretical Computer Science","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511608841","volume-title":"Process Algebra","author":"J.C.M. Baeten","year":"1990","unstructured":"Baeten, J.C.M., Weijland, W.P.: Process Algebra. Cambridge Tracts in Theoretical Computer Science, vol.\u00a018. CambrIdge University Press, Cambridge (1990)"},{"key":"15_CR8","unstructured":"Bergstra, J.A., Klop, J.W.: Fixed point semantics in process algebra. Technical Report IW 206\/82, Mathematical Center, Amsterdam, The Netherlands (1982)"},{"issue":"1-3","key":"15_CR9","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/S0019-9958(84)80025-X","volume":"60","author":"J.A. Bergstra","year":"1984","unstructured":"Bergstra, J.A., Klop, J.W.: Process algebra for synchronous communication. Information and Control\u00a060(1-3), 109\u2013137 (1984)","journal-title":"Information and Control"},{"key":"15_CR10","first-page":"89","volume-title":"Proceedings of the CWI Symposium Mathematics and Computer Science","author":"J.A. Bergstra","year":"1986","unstructured":"Bergstra, J.A., Klop, J.W.: Algebra of communicating processes. In: de Bakker, J.W., Hazewinkel, M., Lenstra, J.K. (eds.) Proceedings of the CWI Symposium Mathematics and Computer Science, pp. 89\u2013138. North-Holland, Amsterdam (1986)"},{"issue":"5","key":"15_CR11","doi-asserted-by":"publisher","first-page":"863","DOI":"10.1145\/234752.234756","volume":"43","author":"R. Bol","year":"1996","unstructured":"Bol, R., Groote, J.F.: The meaning of negative premises in transition system specifications. Journal of the ACM (JACM)\u00a043(5), 863\u2013914 (1996)","journal-title":"Journal of the ACM (JACM)"},{"issue":"1","key":"15_CR12","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1006\/inco.1998.2729","volume":"146","author":"W.J. Fokkink","year":"1998","unstructured":"Fokkink, W.J., Verhoef, C.: A conservative look at operational semantics with variable binding. Information and Computation (I&C)\u00a0146(1), 24\u201354 (1998)","journal-title":"Information and Computation (I&C)"},{"key":"15_CR13","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1016\/j.jlap.2004.03.007","volume":"60\u201361","author":"R.J. Glabbeek van","year":"2004","unstructured":"van Glabbeek, R.J.: The meaning of negative premises in transition system specifications II. Journal of Logic and Algebraic Programming (JLAP)\u00a060\u201361, 229\u2013258 (2004)","journal-title":"Journal of Logic and Algebraic Programming (JLAP)"},{"issue":"2","key":"15_CR14","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1016\/0304-3975(93)90111-6","volume":"118","author":"J.F. Groote","year":"1993","unstructured":"Groote, J.F.: Transition system specifications with negative premises. Theoretical Computer Science (TCS)\u00a0118(2), 263\u2013299 (1993)","journal-title":"Theoretical Computer Science (TCS)"},{"issue":"2","key":"15_CR15","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1006\/inco.1995.1041","volume":"117","author":"M. Hennessy","year":"1995","unstructured":"Hennessy, M., Regan, T.: A process algebra for timed systems. Information and Computation\u00a0117(2), 221\u2013239 (1995)","journal-title":"Information and Computation"},{"key":"15_CR16","unstructured":"Koymans, C.P.J., Vrancken, J.L.M.: Extending process algebra with the empty process. Technical Report 1, Logic Group Preprint Series, Department of Philosophy, Utrecht University, Utrecht, The Netherlands, Extended and enhanced version appeared as [22] (1985)"},{"key":"15_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1007\/BFb0039073","volume-title":"CONCUR \u201990","author":"F. Moller","year":"1990","unstructured":"Moller, F., Tofts, C.M.N.: A temporal calculus of communicating systems. In: Baeten, J.C.M., Klop, J.W. (eds.) CONCUR 1990. LNCS, vol.\u00a0458, pp. 401\u2013415. Springer, Heidelberg (1990)"},{"key":"15_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1214","DOI":"10.1007\/11523468_98","volume-title":"Automata, Languages and Programming","author":"M. Mousavi","year":"2005","unstructured":"Mousavi, M., Reniers, M.A.: Orthogonal extensions in structural operational semantics. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol.\u00a03580, pp. 1214\u20131225. Springer, Heidelberg (2005)"},{"issue":"1","key":"15_CR19","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1006\/inco.1994.1083","volume":"114","author":"X. Nicollin","year":"1994","unstructured":"Nicollin, X., Sifakis, J.: The algebra of timed processes ATP: theory and application. Information and Computation (I&C)\u00a0114(1), 131\u2013178 (1994)","journal-title":"Information and Computation (I&C)"},{"key":"15_CR20","unstructured":"Vereijken, J.J.: Discrete Time Process Algebra. PhD thesis, Department of Mathematics and Computer Science, Eindhoven University of Technology, Eindhoven, The Netherlands (1997)"},{"issue":"2","key":"15_CR21","first-page":"274","volume":"2","author":"C. Verhoef","year":"1995","unstructured":"Verhoef, C.: A congruence theorem for structured operational semantics with predicates and negative premises. Nordic Journal of Computing\u00a02(2), 274\u2013302 (1995)","journal-title":"Nordic Journal of Computing"},{"issue":"2","key":"15_CR22","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/S0304-3975(96)00250-2","volume":"177","author":"J.L.M. Vrancken","year":"1997","unstructured":"Vrancken, J.L.M.: The algebra of communicating processes with empty process. Theoretical Computer Science\u00a0177(2), 287\u2013328 (1997)","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","Processes, Terms and Cycles: Steps on the Road to Infinity"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11601548_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,13]],"date-time":"2019-03-13T08:05:57Z","timestamp":1552464357000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11601548_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540309116","9783540324256"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/11601548_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}