{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,22]],"date-time":"2025-01-22T05:13:39Z","timestamp":1737522819710,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540756972"},{"type":"electronic","value":"9783540756989"}],"license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-75698-9_19","type":"book-chapter","created":{"date-parts":[[2007,10,4]],"date-time":"2007-10-04T02:26:03Z","timestamp":1191464763000},"page":"287-301","source":"Crossref","is-referenced-by-count":2,"title":["Action Abstraction in Timed Process Algebra"],"prefix":"10.1007","author":[{"given":"Michel A.","family":"Reniers","sequence":"first","affiliation":[]},{"given":"Muck","family":"van Weerdenburg","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1\/3","key":"19_CR1","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/S0019-9958(84)80025-X","volume":"60","author":"J. Bergstra","year":"1984","unstructured":"Bergstra, J., Klop, J.: Process algebra for synchronous communication. Information and Control\u00a060(1\/3), 109\u2013137 (1984)","journal-title":"Information and Control"},{"key":"19_CR2","first-page":"613","volume-title":"Information Processing 1989","author":"R. Glabbeek van","year":"1989","unstructured":"van Glabbeek, R., Weijland, W.: Branching time and abstraction in bisimulation semantics (extended abstract). In: Ritter, G. (ed.) Information Processing 1989, pp. 613\u2013618. North-Holland, Amsterdam (1989)"},{"issue":"3","key":"19_CR3","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(3), 555\u2013600 (1996)","journal-title":"Journal of the ACM"},{"key":"19_CR4","doi-asserted-by":"crossref","unstructured":"Klusener, A.: Models and Axioms for a Fragment of Real Time Process Algebra. PhD thesis, Eindhoven University of Technology (1993)","DOI":"10.1007\/BFb0031999"},{"key":"19_CR5","series-title":"Lecture Notes in Computer Science","first-page":"1","volume-title":"Fundamentals of Computation Theory","author":"J. Baeten","year":"1995","unstructured":"Baeten, J., Bergstra, J.: Discrete time process algebra with abstraction. In: Reichel, H. (ed.) FCT 1995. LNCS, vol.\u00a0965, pp. 1\u201315. Springer, Heidelberg (1995)"},{"issue":"1","key":"19_CR6","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/S0020-0190(01)00215-0","volume":"80","author":"M.B. Zwaag van der","year":"2001","unstructured":"van der Zwaag, M.B.: The cones and foci proof technique for timed transition systems. Information Processing Letters\u00a080(1), 33\u201340 (2001)","journal-title":"Information Processing Letters"},{"key":"19_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"559","DOI":"10.1007\/3-540-55719-9_104","volume-title":"Automata, Languages and Programming","author":"F. Moller","year":"1992","unstructured":"Moller, F., Tofts, C.: Behavioural abstraction in TCCS. In: Kuich, W. (ed.) Automata, Languages and Programming. LNCS, vol.\u00a0623, pp. 559\u2013570. Springer, Heidelberg (1992)"},{"key":"19_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"372","DOI":"10.1007\/3-540-57182-5_29","volume-title":"Mathematical Foundations of Computer Science 1993","author":"L. Chen","year":"1993","unstructured":"Chen, L.: A model for real-time process algebras (extended abstract). In: Borzyszkowski, A.M., Sokolowski, S. (eds.) MFCS 1993. LNCS, vol.\u00a0711, pp. 372\u2013381. Springer, Heidelberg (1993)"},{"issue":"3","key":"19_CR9","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(3), 224\u2013252 (1993)","journal-title":"Formal Aspects of Computing"},{"issue":"2","key":"19_CR10","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/0020-0190(93)90197-H","volume":"46","author":"C. Ho-Stuart","year":"1993","unstructured":"Ho-Stuart, C., Zedan, H., Fang, M.: Congruent weak bisimulation with dense real-time. Information Processing Letters\u00a046(2), 55\u201361 (1993)","journal-title":"Information Processing Letters"},{"key":"19_CR11","series-title":"EATCS Monographs","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-04995-2","volume-title":"Process Algebra with Timing","author":"J.C.M. Baeten","year":"2002","unstructured":"Baeten, J.C.M., Middelburg, C.A.: Process Algebra with Timing. EATCS Monographs. Springer, Heidelberg (2002)"},{"issue":"3-4","key":"19_CR12","doi-asserted-by":"crossref","first-page":"361","DOI":"10.3233\/FUN-2002-503-407","volume":"50","author":"M. Reniers","year":"2002","unstructured":"Reniers, M., Groote, J., van der Zwaag, M., van Wamel, J.: Completeness of timed \u03bcCRL. Fundamenta Informaticae\u00a050(3-4), 361\u2013402 (2002)","journal-title":"Fundamenta Informaticae"},{"key":"19_CR13","unstructured":"Baeten, J., Basten, T., Reniers, M.: Process algebra: Equational theories of communicating processes (2007)"},{"key":"19_CR14","unstructured":"Groote, J.: The syntax and semantics of timed \u03bcCRL. Technical Report SEN-R9709, CWI, Amsterdam (1997)"},{"key":"19_CR15","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/B978-044482830-9\/50021-7","volume-title":"Handbook of Process Algebra","author":"L. Aceto","year":"2001","unstructured":"Aceto, L., Fokkink, W., Verhoef, C.: Structural operational semantics. In: Bergstra, J., Ponse, A., Smolka, S. (eds.) Handbook of Process Algebra, pp. 197\u2013292. Elsevier, Amsterdam (2001)"},{"key":"19_CR16","unstructured":"Fokkink, W.: Clock, Trees and Stars in Process Theory. PhD thesis, University of Amsterdam (1994)"},{"key":"19_CR17","doi-asserted-by":"crossref","first-page":"329","DOI":"10.3233\/FI-1997-323407","volume":"32","author":"W. Fokkink","year":"1997","unstructured":"Fokkink, W.: An axiomatization for regular processes in timed branching bisimulation. Fundamenta Informaticae\u00a032, 329\u2013340 (1997)","journal-title":"Fundamenta Informaticae"},{"key":"19_CR18","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)"},{"key":"19_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1007\/11603009_20","volume-title":"Formal Modeling and Analysis of Timed Systems","author":"W. Fokkink","year":"2005","unstructured":"Fokkink, W., Pang, J., Wijs, A.: Is timed branching bisimilarity an equivalence indeed? In: Pettersson, P., Yi, W. (eds.) FORMATS 2005. LNCS, vol.\u00a03829, pp. 258\u2013272. Springer, Heidelberg (2005)"},{"key":"19_CR20","unstructured":"Baeten, J., Middelburg, C., Reniers, M.: A new equivalence for processes with timing: With an application to protocol verification. Technical Report CSR 02-10, Eindhoven University of Technology, Department of Computer Science (2002)"},{"issue":"3","key":"19_CR21","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1016\/0020-0190(96)00034-8","volume":"58","author":"T. Basten","year":"1996","unstructured":"Basten, T.: Branching bisimilarity is an equivalence indeed! Information Processing Letters\u00a058(3), 141\u2013147 (1996)","journal-title":"Information Processing Letters"},{"key":"19_CR22","doi-asserted-by":"crossref","unstructured":"Reniers, M., van Weerdenburg, M.: Action abstraction in timed process algebra: The case for an untimed silent step. Technical Report CSR 06-32, Eindhoven University of Technology, Department of Computer Science (2006)","DOI":"10.1007\/978-3-540-75698-9_19"},{"key":"19_CR23","unstructured":"Luttik, S.: Choice Quantification in Process Algebra. PhD thesis, University of Amsterdam (April 2002)"},{"key":"19_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/11601548_15","volume-title":"Processes, Terms and Cycles: Steps on the Road to Infinity","author":"J. Baeten","year":"2005","unstructured":"Baeten, J., Mousavi, M., Reniers, M.: Timing the untimed: Terminating successfully while being conservative. In: Middeldorp, A., van Oostrom, V., van Raamsdonk, F., de Vrijer, R. (eds.) Processes, Terms and Cycles: Steps on the Road to Infinity. LNCS, vol.\u00a03838, pp. 251\u2013279. Springer, Heidelberg (2005)"},{"issue":"2","key":"19_CR25","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1016\/j.jlap.2006.08.003","volume":"70","author":"J. Baeten","year":"2007","unstructured":"Baeten, J., Reniers, M.: Duplication of constants in process algebra. Journal of Logic and Algebraic Programming\u00a070(2), 151\u2013171 (2007)","journal-title":"Journal of Logic and Algebraic Programming"},{"key":"19_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/BFb0017309","volume-title":"Theoretical Computer Science","author":"D. Park","year":"1981","unstructured":"Park, D.: Concurrency and automata on infinite sequences. In: Deussen, P. (ed.) Theoretical Computer Science. LNCS, vol.\u00a0104, pp. 167\u2013183. Springer, Heidelberg (1981)"},{"key":"19_CR27","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1145\/2455.2460","volume":"32","author":"M. Hennessy","year":"1985","unstructured":"Hennessy, M., Milner, R.: Algebraic laws for nondeterminism and concurrency. Journal of the ACM\u00a032, 137\u2013161 (1985)","journal-title":"Journal of the ACM"}],"container-title":["Lecture Notes in Computer Science","International Symposium on Fundamentals of Software Engineering"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-75698-9_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,21]],"date-time":"2025-01-21T11:28:22Z","timestamp":1737458902000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-75698-9_19"}},"subtitle":["The Case for an Untimed Silent Step"],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540756972","9783540756989"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-75698-9_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}