{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:28:19Z","timestamp":1761611299952},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540602491"},{"type":"electronic","value":"9783540447702"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-60249-6_38","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T17:57:30Z","timestamp":1330279050000},"page":"1-15","source":"Crossref","is-referenced-by-count":2,"title":["Discrete time process algebra with abstraction"],"prefix":"10.1007","author":[{"given":"J. C. M.","family":"Baeten","sequence":"first","affiliation":[]},{"given":"J. A.","family":"Bergstra","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,30]]},"reference":[{"issue":"2","key":"1_CR1","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1007\/BF01898401","volume":"3","author":"J.C.M. Baeten","year":"1991","unstructured":"J.C.M. Baeten & J.A. Bergstra, Real time process algebra, Formal Aspects of Computing 3 (2), 1991, pp. 142\u2013188.","journal-title":"Formal Aspects of Computing"},{"key":"1_CR2","series-title":"LNCS 630","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1007\/BFb0084806","volume-title":"Proc. CONCUR'92","author":"J.C.M. Baeten","year":"1992","unstructured":"J.C.M. Baeten & J.A. Bergstra, Discrete time process algebra (extended abstract), in: Proc. CONCUR'92, Stony Brook (W.R. Cleaveland, ed.), LNCS 630, Springer 1992, pp. 401\u2013420."},{"issue":"6","key":"1_CR3","doi-asserted-by":"crossref","first-page":"481","DOI":"10.1007\/BF01211247","volume":"5","author":"J.C.M. Baeten","year":"1993","unstructured":"J.C.M. Baeten & J.A. Bergstra, Real space process algebra, Formal Aspects of Computing 5 (6), 1993, pp. 481\u2013529.","journal-title":"Formal Aspects of Computing"},{"issue":"3","key":"1_CR4","doi-asserted-by":"crossref","first-page":"250","DOI":"10.1007\/BF01215407","volume":"6","author":"J.C.M. Baeten","year":"1994","unstructured":"J.C.M. Baeten & J.A. Bergstra, On sequential composition, action prefixes and process prefix, Formal Aspects of Computing 6 (3), 1994, pp. 250\u2013268.","journal-title":"Formal Aspects of Computing"},{"key":"1_CR5","unstructured":"J.C.M. Baeten & J.A. Bergstra, Discrete time process algebra, report P9208c, Programming Research Group, University of Amsterdam 1995. To appear in Formal Aspects of Computing."},{"key":"1_CR6","doi-asserted-by":"crossref","unstructured":"J.C.M. Baeten & W.P. Weijland, Process algebra, Cambridge Tracts in Theor. Comp. Sci. 18, Cambridge University Press 1990.","DOI":"10.1017\/CBO9780511624193"},{"issue":"1","key":"1_CR7","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/0304-3975(85)90088-X","volume":"37","author":"J.A. Bergstra","year":"1985","unstructured":"J.A. Bergstra & J.W. Klop, Algebra of communicating processes with abstraction, TCS 37 (1), 1985, pp. 77\u2013121.","journal-title":"TCS"},{"key":"1_CR8","doi-asserted-by":"crossref","unstructured":"J.A. Bergstra & J.W. Klop, Verification of an alternating bit protocol by means of process algebra, in: Math. Methods of Spec. and Synthesis of Software Systems '85 (W. Bibel & K.P. Jantke, eds.), Springer LNCS 215, 1986, pp. 9\u201323.","DOI":"10.1007\/3-540-16444-8_1"},{"key":"1_CR9","unstructured":"J.A. Bergstra & P. Klint, The toolbus \u2014 a component interconnection architecture-, report P9408, Programming Research Group, University of Amsterdam 1994."},{"key":"1_CR10","doi-asserted-by":"crossref","unstructured":"J.A. Bergstra & P. Klint, The discrete time toolbus, report P9502, Programming Research Group, University of Amsterdam 1995.","DOI":"10.1007\/BFb0014323"},{"key":"1_CR11","unstructured":"J.A. Bergstra & C.A. Middelburg, A process algebra semantics for \u03c6SDL, report LGPS 129, Dept. of Philosophy, Utrecht University 1995."},{"issue":"3","key":"1_CR12","doi-asserted-by":"publisher","first-page":"560","DOI":"10.1145\/828.833","volume":"31","author":"S.D. Brookes","year":"1984","unstructured":"S.D. Brookes, C.A.R. Hoare & A.W. Roscoe, A theory of communicating sequential processes, Journal of the ACM 31 (3), 1984, pp. 560\u2013599.","journal-title":"Journal of the ACM"},{"key":"1_CR13","unstructured":"R.J. van Glabbeek & W.P. Weijland, Branching time and abstraction in bisimulation semantics, CWI report CS-R9120, 1991."},{"key":"1_CR14","first-page":"261","volume-title":"Specification and verification of real time systems in ACP","author":"J.F. Groote","year":"1990","unstructured":"J.F. Groote, Specification and verification of real time systems in ACP, in: Proc. 10th Symp. on Protocol Specification, Testing and Verification, Ottawa (L. Logrippo, R.L. Probert & H. Ural, eds.), North-Holland, Amsterdam 1990, pp. 261\u2013274."},{"key":"1_CR15","unstructured":"M. Hennessy & T. Regan, A temporal process algebra, report 2\/90, University of Sussex 1990."},{"key":"1_CR16","doi-asserted-by":"crossref","unstructured":"A.S. Klusener, Models and axioms for a fragment of real time process algebra, Ph.D. Thesis, Eindhoven University of Technology 1993.","DOI":"10.1007\/BFb0031999"},{"key":"1_CR17","unstructured":"R. Milner, Communication and concurrency, Prentice-Hall 1989."},{"key":"1_CR18","unstructured":"F. Moller & C. Tofts, A temporal calculus of communicating systems, report LFCS-89-104, University of Edinburgh 1989."},{"key":"1_CR19","series-title":"LNCS 458","first-page":"401","volume-title":"Proc. CONCUR'90","author":"F. Moller","year":"1990","unstructured":"F. Moller & C. Tofts, A temporal calculus of communicating systems, in: Proc. CONCUR'90, Amsterdam (J.C.M. Baeten & J.W. Klop, eds.), LNCS 458, Springer 1990, pp. 401\u2013415."},{"key":"1_CR20","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1006\/inco.1994.1083","volume":"114","author":"X. Nicollin","year":"1994","unstructured":"X. Nicollin & J. Sifakis, The algebra of timed processes ATP: theory and application, Information & Computation 114, 1994, pp. 131\u2013178.","journal-title":"Information & Computation"},{"key":"1_CR21","unstructured":"X. Nicollin, J.-L. Richier, J. Sifakis & J. Voiron, ATP: an algebra for timed processes, in Proc. IFIP TC2 Conf. on Progr. Concepts & Methods, Sea of Gallilee, Israel 1990."},{"key":"1_CR22","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1016\/0304-3975(88)90030-8","volume":"58","author":"G.M. Reed","year":"1988","unstructured":"G.M. Reed & A.W. Roscoe, A timed model for communicating sequential processes, TCS 58, 1988, pp. 249\u2013261.","journal-title":"TCS"},{"key":"1_CR23","doi-asserted-by":"crossref","unstructured":"C. Verhoef, A congruence theorem for structured operational semantics with predicates and negative premises, in: Proc. CONCUR'94, Uppsala (B. Jonsson & J. Parrow, eds.), Springer LNCS 836, 1994, pp. 433\u2013448.","DOI":"10.1007\/978-3-540-48654-1_32"}],"container-title":["Lecture Notes in Computer Science","Fundamentals of Computation Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-60249-6_38.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,31]],"date-time":"2021-12-31T09:34:15Z","timestamp":1640943255000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-60249-6_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540602491","9783540447702"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/3-540-60249-6_38","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}