{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:26:24Z","timestamp":1725564384532},"publisher-location":"Berlin, Heidelberg","reference-count":34,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540230687"},{"type":"electronic","value":"9783540300809"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30080-9_3","type":"book-chapter","created":{"date-parts":[[2010,9,7]],"date-time":"2010-09-07T03:26:49Z","timestamp":1283830009000},"page":"59-97","source":"Crossref","is-referenced-by-count":4,"title":["Timed Process Algebra (With a Focus on Explicit Termination and Relative-Timing)"],"prefix":"10.1007","author":[{"given":"J. C. M.","family":"Baeten","sequence":"first","affiliation":[]},{"given":"M. A.","family":"Reniers","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"3_CR1","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1007\/BF01898401","volume":"3","author":"J. Baeten","year":"1991","unstructured":"Baeten, J., Bergstra, J.: Real time process algebra. Formal Aspects of Computing\u00a03, 142\u2013188 (1991)","journal-title":"Formal Aspects of Computing"},{"key":"3_CR2","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1006\/inco.1995.1041","volume":"177","author":"M. Hennessy","year":"1995","unstructured":"Hennessy, M., Regan, T.: A process algebra for timed systems. Information and Computation\u00a0177, 221\u2013239 (1995)","journal-title":"Information and Computation"},{"key":"3_CR3","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.: 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":"3_CR4","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\u00a0114, 131\u2013178 (1994)","journal-title":"Information and Computation"},{"key":"3_CR5","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1007\/BF01211556","volume":"5","author":"J. Quemada","year":"1993","unstructured":"Quemada, J., de Frutos, D., Azcorra, A.: TIC: A TImed calculus. Formal Aspects of Computing\u00a05, 224\u2013252 (1993)","journal-title":"Formal Aspects of Computing"},{"key":"3_CR6","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1016\/S0167-6423(96)00036-6","volume":"29","author":"S. Bos","year":"1997","unstructured":"Bos, S., Reniers, M.: The I2C-bus in discrete-time process algebra. Science of Computer Programming\u00a029, 235\u2013258 (1997)","journal-title":"Science of Computer Programming"},{"key":"3_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"640","DOI":"10.1007\/BFb0032011","volume-title":"Real-Time: Theory in Practice","author":"S. Schneider","year":"1992","unstructured":"Schneider, S., Davies, J., Jackson, D., Reed, G., Reed, J., Roscoe, A.: Timed CSP: Theory and practice. In: Huizing, C., de Bakker, J.W., Rozenberg, G., de Roever, W.-P. (eds.) REX 1991. LNCS, vol.\u00a0600, pp. 640\u2013675. Springer, Heidelberg (1992)"},{"key":"3_CR8","unstructured":"Groote, J.: The syntax and semantics of timed \u03bcCRL. Technical Report SENR9709, CWI, Amsterdam (1997)"},{"key":"3_CR9","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1007\/BF01214556","volume":"8","author":"J. Baeten","year":"1996","unstructured":"Baeten, J., Bergstra, J.: Discrete time process algebra. Formal Aspects of Computing\u00a08, 188\u2013208 (1996)","journal-title":"Formal Aspects of Computing"},{"key":"3_CR10","doi-asserted-by":"crossref","first-page":"51","DOI":"10.3233\/FI-1997-291203","volume":"29","author":"J. Baeten","year":"1997","unstructured":"Baeten, J., Bergstra, J.: Discrete time process algebra: absolute time, relative time and parametric time. Fundamenta Informaticae\u00a029, 51\u201376 (1997)","journal-title":"Fundamenta Informaticae"},{"key":"3_CR11","unstructured":"Groote, J.: Process Algebra and Structured Operational Semantics. PhD thesis, University of Amsterdam (1991)"},{"key":"3_CR12","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-04995-2","volume-title":"Process Algebra with Timing","author":"J. Baeten","year":"2002","unstructured":"Baeten, J., Middelburg, C.: Process Algebra with Timing. Springer, Heidelberg (2002)"},{"key":"3_CR13","doi-asserted-by":"publisher","first-page":"589","DOI":"10.1017\/S0960129503004006","volume":"13","author":"J. Baeten","year":"2003","unstructured":"Baeten, J.: Embedding untimed into timed process algebra: the case for explicit termination. Mathematical Structures in Computer Science\u00a013, 589\u2013618 (2003)","journal-title":"Mathematical Structures in Computer Science"},{"key":"3_CR14","unstructured":"Baeten, J., Reniers, M.: Explicit termination in timed process algebra with relativetiming. Formal Aspects of Computing (2004) (to appear)"},{"key":"3_CR15","unstructured":"Koymans, C., Vrancken, J.: Extending process algebra with the empty process \u03b5. Technical Report Logic Group Preprint Series 1, University Utrecht, Department of Philosophy (1985)"},{"key":"3_CR16","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. Baeten","year":"1987","unstructured":"Baeten, J., Glabbeek, R.v.: Merge and termination in process algebra. In: Nori, K.V. (ed.) FSTTCS 1987. LNCS, vol.\u00a0287, pp. 153\u2013172. Springer, Heidelberg (1987)"},{"key":"3_CR17","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/S0304-3975(96)00250-2","volume":"177","author":"J. Vrancken","year":"1997","unstructured":"Vrancken, J.: The algebra of communicating processes with empty process. Theoretical Computer Science\u00a0177, 287\u2013328 (1997)","journal-title":"Theoretical Computer Science"},{"key":"3_CR18","unstructured":"Vereijken, J.: Discrete-time process algebra. PhD thesis, Eindhoven University of Technology (1997)"},{"key":"3_CR19","unstructured":"Baeten, J., Vereijken, J.: Discrete-time process algebra with empty process. In: Brun\u00e9, M., van Deursen, A., Heering, J. (eds.) Dat is dus heel interessant, CWI. Liber Amicorum dedicated to Paul Klint, pp. 5\u201324 (1997)"},{"key":"3_CR20","series-title":"International Series in Computer Science","volume-title":"Communicating Sequential Processes","author":"C. Hoare","year":"1985","unstructured":"Hoare, C.: Communicating Sequential Processes. International Series in Computer Science. Prentice-Hall International, Englewood Cliffs (1985)"},{"key":"3_CR21","doi-asserted-by":"crossref","first-page":"367","DOI":"10.3233\/FI-2000-41401","volume":"41","author":"V. Bos","year":"2000","unstructured":"Bos, V., Kleijn, J.: Formalisation of a production system modelling language: the operational semantics of \u03c7 Core. Fundamenta Informaticae\u00a041, 367\u2013392 (2000)","journal-title":"Fundamenta Informaticae"},{"key":"3_CR22","unstructured":"Reniers, M.: Message Sequence Chart: Syntax and Semantics. PhD thesis, Eindhoven University of Technology (1999)"},{"key":"3_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"332","DOI":"10.1007\/BFb0039069","volume-title":"CONCUR \u201990","author":"J. Groote","year":"1990","unstructured":"Groote, J.: Transition system specifications with negative premises. In: Baeten, J.C.M., Klop, J.W. (eds.) CONCUR 1990. LNCS, vol.\u00a0458, pp. 332\u2013341. Springer, Heidelberg (1990)"},{"key":"3_CR24","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, 274\u2013302 (1995)","journal-title":"Nordic Journal of Computing"},{"key":"3_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"440","DOI":"10.1007\/3-540-57887-0_109","volume-title":"Theoretical Aspects of Computer Software","author":"W. Fokkink","year":"1994","unstructured":"Fokkink, W.: The tyft\/tyxt format reduces to tree rules. In: Hagiya, M., Mitchell, J.C. (eds.) TACS 1994. LNCS, vol.\u00a0789, pp. 440\u2013453. Springer, Heidelberg (1994)"},{"key":"3_CR26","unstructured":"Baeten, J., Reniers, M.: Termination in timed process algebra. Technical Report CSR 00-13, Eindhoven University of Technology, Department of Computing Science (2000)"},{"key":"3_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"477","DOI":"10.1007\/3-540-57208-2_33","volume-title":"CONCUR\u201993","author":"J. Baeten","year":"1993","unstructured":"Baeten, J., Verhoef, C.: A congruence theorem for structured operational semantics with predicates. In: Best, E. (ed.) CONCUR 1993. LNCS, vol.\u00a0715, pp. 477\u2013492. Springer, Heidelberg (1993)"},{"key":"3_CR28","series-title":"Handbook of Logic in Computer Science","first-page":"149","volume-title":"Semantic Modelling","author":"J. Baeten","year":"1995","unstructured":"Baeten, J., Verhoef, C.: Concrete process algebra. In: Abramsky, S., Gabbay, D.M., Maibaum, T. (eds.) Semantic Modelling. Handbook of Logic in Computer Science, vol.\u00a04, pp. 149\u2013268. Oxford University Press, Oxford (1995)"},{"key":"3_CR29","series-title":"Cambridge Tracts in Theoretical Computer Science","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511608841","volume-title":"Process Algebra","author":"J. Baeten","year":"1990","unstructured":"Baeten, J., Weijland, W.: Process Algebra. Cambridge Tracts in Theoretical Computer Science, vol.\u00a018. Cambridge University Press, Cambridge (1990)"},{"key":"3_CR30","unstructured":"Baeten, J., Basten, T., Reniers, M.: Algebra of Communicating Processes. Cambridge University Press (2004) (to appear)"},{"key":"3_CR31","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1145\/233551.233556","volume":"43","author":"R. Glabbeek van","year":"1996","unstructured":"van Glabbeek, R., Weijland, W.: Branching time and abstraction in bisimulation semantics. Journal of the ACM\u00a043, 555\u2013600 (1996)","journal-title":"Journal of the ACM"},{"key":"3_CR32","series-title":"Cambridge Tracts in Theoretical Computer Science","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1017\/CBO9780511608841.003","volume-title":"Applications of process algebra","author":"F. Vaandrager","year":"1990","unstructured":"Vaandrager, F.: Two simple protocols. In: Baeten, J. (ed.) Applications of process algebra. Cambridge Tracts in Theoretical Computer Science, vol.\u00a017, pp. 23\u201344. Cambridge University Press, Cambridge (1990)"},{"key":"3_CR33","doi-asserted-by":"crossref","unstructured":"Baeten, J., Middelburg, C., Reniers, M.: A new equivalence for processes with timing. Technical Report CSR 02-10, Eindhoven University of Technology, Department of Computing Science (2002)","DOI":"10.1007\/978-3-662-04995-2"},{"key":"3_CR34","series-title":"Foundations of Computing Series","doi-asserted-by":"crossref","first-page":"535","DOI":"10.7551\/mitpress\/5641.003.0026","volume-title":"Proof, Language, and Interaction: Essays in Honour of Robin Milner","author":"J. Baeten","year":"2000","unstructured":"Baeten, J., Bergstra, J., Reniers, M.: Discrete time process algebra with silent step. In: Plotkin, G., Stirling, C., Tofte, M. (eds.) Proof, Language, and Interaction: Essays in Honour of Robin Milner. Foundations of Computing Series, pp. 535\u2013569. MIT Press, Cambridge (2000)"}],"container-title":["Lecture Notes in Computer Science","Formal Methods for the Design of Real-Time Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30080-9_3.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,30]],"date-time":"2024-03-30T05:40:31Z","timestamp":1711777231000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30080-9_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540230687","9783540300809"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30080-9_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}