{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:25:51Z","timestamp":1761611151385},"reference-count":29,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[1996,3,1]],"date-time":"1996-03-01T00:00:00Z","timestamp":825638400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Form. Asp. Comput."],"published-print":{"date-parts":[[1996,3]]},"abstract":"<jats:title>Abstract<\/jats:title>\n          <jats:p>The axiom system ACP of [BeK84a] was extended with real time features in [BaB91]. Here we proceed to define a discrete time extension of ACP, along the lines of ATP [NiS94]. We present versions based on relative timing and on absolute timing. Both approaches are integrated using parametric timing. The time free ACP theory is embedded in the discrete time theory.<\/jats:p>","DOI":"10.1007\/bf01214556","type":"journal-article","created":{"date-parts":[[2005,2,25]],"date-time":"2005-02-25T15:24:32Z","timestamp":1109345072000},"page":"188-208","source":"Crossref","is-referenced-by-count":34,"title":["Discrete time process algebra"],"prefix":"10.1145","volume":"8","author":[{"given":"J. C. M.","family":"Baeten","sequence":"first","affiliation":[{"name":"Department of Computing Science, Eindhoven University of Technology, P.O. Box 513, 5600, MB Eindhoven, The Netherlands"}]},{"given":"J. A.","family":"Bergstra","sequence":"additional","affiliation":[{"name":"Programming Research Group, University of Amsterdam, Amsterdam, The Netherlands"},{"name":"Department of Philosophy, Utrecht University, Utrecht, The Netherlands"}]}],"member":"320","reference":[{"key":"e_1_2_1_2_1_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01898401"},{"key":"e_1_2_1_2_2_2","doi-asserted-by":"crossref","unstructured":"Baeten J. C. M. and Bergstra J. A.: Discrete Time Process Algebra. Extended abstract in: (ed.) Cleaveland W. R. Proc. CONCUR '92 LNCS 630 Springer-Verlag 1992 pp. 401\u2013420. (Full version: report P9208b Programming Research Group University of Amsterdam 1992 pp. 81. Available at ftp:\/\/ftp.win.tue.nl\/pub\/techreports\/josb\/discretetime.ps.Z.)","DOI":"10.1007\/BFb0084806"},{"key":"e_1_2_1_2_3_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01211247"},{"key":"e_1_2_1_2_4_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01215407"},{"key":"e_1_2_1_2_5_2","doi-asserted-by":"crossref","unstructured":"Baeten J. C. M. and Weijland W. P.: Process Algebra. Cambridge Tracts in Theor. Comp. Sci. 18 Cambridge University Press 1990.","DOI":"10.1017\/CBO9780511624193"},{"key":"e_1_2_1_2_6_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(84)80025-X"},{"key":"e_1_2_1_2_7_2","first-page":"82","volume-title":"Proceedings 11th ICALP","author":"Bergstra J. A.","year":"1984"},{"key":"e_1_2_1_2_8_2","unstructured":"Bergstra J. A. and Klint P.: The Toolbus \u2014a Component Interconnection Architecture. Report P9408 Programming Research Group University of Amsterdam 1994."},{"key":"e_1_2_1_2_9_2","doi-asserted-by":"crossref","unstructured":"Bergstra J. A. and Klint P.: The Discrete Time Toolbus. Report P9502 Programming Research Group University of Amsterdam 1995.","DOI":"10.1007\/BFb0014323"},{"key":"e_1_2_1_2_10_2","unstructured":"Bergstra J. A. and Middelburg C. A.: A Process Algebra Semantics for \u03c6SDL. Report LGPS 129 Dept. of Philosophy Utrecht University 1995."},{"key":"e_1_2_1_2_11_2","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/37.4.243"},{"key":"e_1_2_1_2_12_2","doi-asserted-by":"publisher","DOI":"10.1145\/828.833"},{"key":"e_1_2_1_2_13_2","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(94)00163-4"},{"key":"e_1_2_1_2_14_2","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/37.4.259"},{"key":"e_1_2_1_2_15_2","first-page":"261","volume-title":"Specification and Verification of Real Time Systems in ACP","author":"Groote J. F.","year":"1990"},{"key":"e_1_2_1_2_16_2","unstructured":"Gruska D. P. and Maggiolo-Schettini A.: A Timed Process Description Language Based on CCS. Report TR-9\/91 Universit\u00e9 de Pisa 1991."},{"key":"e_1_2_1_2_17_2","unstructured":"Hansson H.: Time and Probabilities in Formal Design of Distributed Systems. Ph.D. thesis report DoCS 91\/27 Uppsala University 1991."},{"key":"e_1_2_1_2_18_2","unstructured":"Hennessy M. and Regan T.: A Temporal Process Algebra. Report 2\/90 University of Sussex 1990."},{"key":"e_1_2_1_2_19_2","doi-asserted-by":"crossref","unstructured":"Hoare C. A. R.: Communicating Sequential Processes . Prentice Hall 1985.","DOI":"10.1007\/978-3-642-82921-5_4"},{"key":"e_1_2_1_2_20_2","doi-asserted-by":"publisher","DOI":"10.1145\/27651.27653"},{"key":"e_1_2_1_2_21_2","doi-asserted-by":"crossref","unstructured":"Klusener A. S.: Models and Axioms for a Fragment of Real Time Process Algebra. Ph.D. Thesis Eindhoven University of Technology 1993.","DOI":"10.1007\/BFb0031999"},{"key":"e_1_2_1_2_22_2","doi-asserted-by":"crossref","first-page":"270","DOI":"10.1145\/3318.3322","article-title":"Circal and the Representation of Communication, Concurrency and Time","volume":"7","author":"Milne G. J.","year":"1985","journal-title":"ACM TOPLAS"},{"key":"e_1_2_1_2_23_2","unstructured":"Milner R.: Communication and Concurrency Prentice-Hall 1989."},{"key":"e_1_2_1_2_24_2","unstructured":"Moller F. and Tofts C.: A Temporal Calculus of Communicating Systems. Report LFCS-89-104 University of Edinburgh 1989."},{"key":"e_1_2_1_2_25_2","first-page":"401","volume-title":"Proc. CONCUR '90","author":"Moller F.","year":"1990"},{"key":"e_1_2_1_2_26_2","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1994.1083"},{"key":"e_1_2_1_2_27_2","unstructured":"Nicollin X. Richier J.-L. Sifakis J. and Voiron J.: ATP: an Algebra for Timed Processes. In: Proc. IFIP TC2 Conf. on Programming Concepts and Methods Sea of Gallilee Israel 1990."},{"key":"e_1_2_1_2_28_2","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(88)90030-8"},{"key":"e_1_2_1_2_29_2","first-page":"433","volume-title":"Proc. CONCUR'94","author":"Verhoef C.","year":"1994"}],"container-title":["Formal Aspects of Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01214556.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01214556\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1007\/BF01214556","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,6]],"date-time":"2022-01-06T15:24:01Z","timestamp":1641482641000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1007\/BF01214556"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,3]]},"references-count":29,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1996,3]]}},"alternative-id":["10.1007\/BF01214556"],"URL":"https:\/\/doi.org\/10.1007\/bf01214556","relation":{},"ISSN":["0934-5043","1433-299X"],"issn-type":[{"value":"0934-5043","type":"print"},{"value":"1433-299X","type":"electronic"}],"subject":[],"published":{"date-parts":[[1996,3]]}}}