{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,9]],"date-time":"2026-04-09T21:15:38Z","timestamp":1775769338967,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540631415","type":"print"},{"value":"9783540691884","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/3-540-63141-0_12","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T23:08:29Z","timestamp":1330297709000},"page":"166-180","source":"Crossref","is-referenced-by-count":12,"title":["An algebraic theory of multiple clocks"],"prefix":"10.1007","author":[{"given":"Rance","family":"Cleaveland","sequence":"first","affiliation":[]},{"given":"Gerald","family":"L\u00fcttgen","sequence":"additional","affiliation":[]},{"given":"Michael","family":"Mendler","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,7]]},"reference":[{"key":"12_CR1","doi-asserted-by":"crossref","unstructured":"H.R. Andersen and M. Mendler. An asynchronous process algebra with multiple clocks. In D. Sannella, editor, European Symposium on Programming, volume 788 of Lecture Notes in Computer Science, pages 58\u201373. Springer-Verlag, 1994.","DOI":"10.1007\/3-540-57880-3_4"},{"key":"12_CR2","doi-asserted-by":"crossref","unstructured":"H.R. Andersen and M. Mendler. Describing a signal analyzer in the process algebra PMC \u2014 A case study. In P. D. Mosses, M. Nielsen, and M. I. Schwartzbach, editors, Theory and Practice of Software Development, TAPSOFT'95, volume 915 of Lecture Notes in Computer Science, pages 620\u2013635. Springer-Verlag, 1995.","DOI":"10.1007\/3-540-59293-8_224"},{"key":"12_CR3","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/0167-6423(92)90005-V","volume":"19","author":"G. Berry","year":"1992","unstructured":"G. Berry and G. Gonthier. The ESTEREL synchronous programming language: Design, semantics, implementation. Science of Computer Programming, 19:87\u2013152, 1992.","journal-title":"Science of Computer Programming"},{"issue":"10","key":"12_CR4","doi-asserted-by":"crossref","first-page":"1251","DOI":"10.1109\/TC.1987.1676867","volume":"C-36","author":"D.M. Chapiro","year":"1987","unstructured":"D.M. Chapiro. Reliable high-speed arbitration and synchronization. IEEE Transaction on Computers, C-36(10):1251\u20131255, October 1987.","journal-title":"IEEE Transaction on Computers"},{"key":"12_CR5","doi-asserted-by":"crossref","unstructured":"R. Cleaveland, G. L\u00fcttgen, and M. Mendler. An algebraic theory of multiple clocks. Technical report, North Carolina State University, Raleigh, NC, USA, 1997. To appear.","DOI":"10.1007\/3-540-63141-0_12"},{"key":"12_CR6","series-title":"volume 1102 of Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"394","DOI":"10.1007\/3-540-61474-5_87","volume-title":"Computer Aided Verification (CAV '96)","author":"R. Cleaveland","year":"1996","unstructured":"R. Cleaveland and S. Sims. The NCSU Concurrency Workbench. In R. Alur and T. Henzinger, editors, Computer Aided Verification (CAV '96), volume 1102 of Lecture Notes in Computer Science, pages 394\u2013397, New Brunswick, New Jersey, July 1996. Springer-Verlag."},{"key":"12_CR7","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/0304-3975(84)90113-0","volume":"34","author":"R. Nicola De","year":"1983","unstructured":"R. De Nicola and M.C.B. Hennessy. Testing equivalences for processes. Theoretical Computer Science, 34:83\u2013133, 1983.","journal-title":"Theoretical Computer Science"},{"key":"12_CR8","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1007\/BF01200261","volume":"12","author":"W. Elseaidy","year":"1996","unstructured":"W. Elseaidy, J. Baugh, and R. Cleaveland. Verification of an active control system using temporal process algebra. Engineering with Computers, 12:46\u201361, 1996.","journal-title":"Engineering with Computers"},{"key":"12_CR9","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1006\/inco.1995.1041","volume":"117","author":"M. Hennessy","year":"1995","unstructured":"M. Hennessy and T. Regan. A process algebra for timed systems. Information and Computation, 117:221\u2013239, 1995.","journal-title":"Information and Computation"},{"key":"12_CR10","volume-title":"Communicating Sequential Processes","author":"C.A.R. Hoare","year":"1985","unstructured":"C.A.R. Hoare. Communicating Sequential Processes. Prentice-Hall, London, 1985."},{"key":"12_CR11","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1016\/0022-0000(84)90023-0","volume":"28","author":"R. Milner","year":"1984","unstructured":"R. Milner. A complete inference system for a class of regular behaviours. Journal of Computer and System Sciences, 28:439\u2013466, 1984.","journal-title":"Journal of Computer and System Sciences"},{"key":"12_CR12","volume-title":"Communication and Concurrency","author":"R. Milner","year":"1989","unstructured":"R. Milner. Communication and Concurrency. Prentice-Hall, London, 1989."},{"key":"12_CR13","series-title":"volume 458 of Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1007\/BFb0039073","volume-title":"CONCUR '90","author":"F. Moller","year":"1990","unstructured":"F. Moller and C. Tofts. A temporal calculus of communicating systems. In J.C.M. Baeten and J.W. Klop, edtors CONCUR '90, volume 458 of Lecture Notes in Computer Science, pages 401\u2013415, Amsterdam, August 1990. Springer-Verlag."},{"key":"12_CR14","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1006\/inco.1994.1083","volume":"114","author":"X. Nicollin","year":"1994","unstructured":"X. Nicollin and J. Sifakis. The algebra of timed processes, ATP: Theory and application. Information and Computation, 114:131\u2013178, 1994.","journal-title":"Information and Computation"},{"issue":"6","key":"12_CR15","doi-asserted-by":"crossref","first-page":"973","DOI":"10.1137\/0216062","volume":"16","author":"R. Paige","year":"1987","unstructured":"R. Paige and R.E. Tarjan. Three partition refinement algorithms. SIAM Journal of Computing, 16(6):973\u2013989, December 1987.","journal-title":"SIAM Journal of Computing"},{"key":"12_CR16","series-title":"volume 510 of Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1007\/3-540-54233-7_136","volume-title":"Automata, Languages and Programming (ICALP '91)","author":"W. Yi","year":"1991","unstructured":"W. Yi. CCS + time=an interleaving model for real time systems. In J. Leach Albert, B. Monien, and M. Rodriguez Artalejo, editors, Automata, Languages and Programming (ICALP '91), volume 510 of Lecture Notes in Computer Science, pages 217\u2013228, Madrid, July 1991. Springer-Verlag."}],"container-title":["Lecture Notes in Computer Science","CONCUR '97: Concurrency Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-63141-0_12.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:16:05Z","timestamp":1605647765000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-63141-0_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540631415","9783540691884"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-63141-0_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1997]]}}}