{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T23:49:10Z","timestamp":1768002550059,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540551799","type":"print"},{"value":"9783540467632","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1992]]},"DOI":"10.1007\/3-540-55179-4_36","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T09:51:46Z","timestamp":1330249906000},"page":"376-398","source":"Crossref","is-referenced-by-count":55,"title":["An overview and synthesis on timed process algebras"],"prefix":"10.1007","author":[{"given":"Xavier","family":"Nicollin","sequence":"first","affiliation":[]},{"given":"Joseph","family":"Sifakis","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,29]]},"reference":[{"key":"36_CR1","doi-asserted-by":"crossref","unstructured":"D. Austry and G. Boudol. Alg\u00e8bre de processus et synchronisation. Theoretical Computer Science, 30, 1984.","DOI":"10.1016\/0304-3975(84)90067-7"},{"key":"36_CR2","volume-title":"Technical Report CS-R9053","author":"J. C. M. M. Baeten","year":"1990","unstructured":"J.C.M. Baeten and J.A. Bergstra. Real Time Process Algebra. Technical Report CS-R9053, Centre for Mathematics and Computer Science, Amsterdam, the Netherlands, 1990."},{"key":"36_CR3","doi-asserted-by":"crossref","unstructured":"G. Berry and L. Cosserat. The Esterel synchronous programming language and its mathematical semantics. In LNCS 197: Proceedings CMU Seminar on Concurrency, Springer-Verlag, 1985.","DOI":"10.1007\/3-540-15670-4_19"},{"key":"36_CR4","doi-asserted-by":"crossref","unstructured":"T. Bolognesi and F. Lucidi. LOTOS-like process algebra with urgent or timed interactions. In Proceedings of REX Workshop \u201cReal-Time: Theory in Practice\u201d. Mook, the Netherlands, June 1991.","DOI":"10.1016\/B978-0-444-89402-1.50027-8"},{"key":"36_CR5","doi-asserted-by":"crossref","unstructured":"P. Caspi, N. Halbwachs, D. Pilaud, and J. Plaice. Lustre: a declarative language for programming synchronous systems. In 14th Symposium on Principles of Programming Languages, Munich, January 1987.","DOI":"10.1145\/41625.41641"},{"key":"36_CR6","volume-title":"Technical Report PRG-75","author":"J. Davies","year":"1989","unstructured":"J. Davies and S. Schneider. An Introduction to Timed CSP. Technical Report PRG-75, Oxford University Computing Laboratory, UK, August 1989."},{"key":"36_CR7","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/0167-6423(87)90035-9","volume":"8\u20133","author":"D. Harel","year":"1987","unstructured":"D. Harel. StateCharts: a visual approach to complex systems. Science of Computer Programming, 8\u20133:231\u2013275, 1987.","journal-title":"Science of Computer Programming"},{"key":"36_CR8","volume-title":"Technical Report 2\/90","author":"M. Hennessy","year":"1990","unstructured":"M. Hennessy and T. Regan. A Temporal Process Algebra. Technical Report 2\/90, University of Sussex, UK, April 1990."},{"key":"36_CR9","volume-title":"Technical Report 5\/91","author":"M. Hennessy","year":"1991","unstructured":"M. Hennessy and T. Regan. A Process Algebra for Timed Systems. Technical Report 5\/91, University of Sussex, UK, April 1991."},{"key":"36_CR10","volume-title":"Technical Report CS-R9106","author":"A. S. Klusener","year":"1991","unstructured":"A.S. Klusener. Completeness in Real Time Process Algebra. Technical Report CS-R9106, Centre for Mathematics and Computer Science, Amsterdam, the Netherlands, January 1991."},{"key":"36_CR11","doi-asserted-by":"crossref","unstructured":"R. Milner. A Calculus of Communicating Systems. In LNCS 92, Springer Verlag, 1980.","DOI":"10.1007\/3-540-10235-3"},{"key":"36_CR12","doi-asserted-by":"crossref","unstructured":"R. Milner. Calculi for Synchrony and Asynchrony. Theoretical Computer Science, 25, 1983.","DOI":"10.1016\/0304-3975(83)90114-7"},{"key":"36_CR13","doi-asserted-by":"crossref","unstructured":"G. J. Milne. The Formal Description and Verification of Hardware Timing. IEEE Transactions on Computers, 40 (7), July 1991.","DOI":"10.1109\/12.83619"},{"key":"36_CR14","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1007\/BFb0039073","volume-title":"LNCS 458. Proceedings of CONCUR '90 (Theories of Concurrency: Unification and Extension)","author":"F. Moller","year":"1990","unstructured":"F. Moller and C. Tofts. A Temporal Calculus of Communicating Processes. In J.C.M. Baeten and J.W. Klop, editors, LNCS 458. Proceedings of CONCUR '90 (Theories of Concurrency: Unification and Extension), Amsterdam, the Netherlands, pages 401\u2013415, Springer-Verlag, August 1990."},{"key":"36_CR15","unstructured":"X. Nicollin, J.-L. Richier, J. Sifakis, and J. Voiron. ATP: an Algebra for Timed Processes. In Proceedings of the IFIP TC 2 Working Conference on Programming Concepts and Methods, Sea of Gallilee, Israel, April 1990."},{"key":"36_CR16","volume-title":"Technical Report RT-C26","author":"X. Nicollin","year":"1990","unstructured":"X. Nicollin and J. Sifakis. The algebra of timed processes ATP: theory and application. Technical Report RT-C26, LGI-IMAG, Grenoble, France, December 1990."},{"key":"36_CR17","doi-asserted-by":"crossref","unstructured":"X. Nicollin, J. Sifakis, and S. Yovine. From ATP to Timed Graphs and Hybrid Systems. In Proceedings of REX Workshop \u201cReal-Time: Theory in Practice\u201d. Mook, the Netherlands, June 1991.","DOI":"10.1007\/BFb0032007"},{"key":"36_CR18","volume-title":"Technical Report DAIMI FN-19","author":"G. D. Plotkin","year":"1981","unstructured":"G.D. Plotkin. A Structural Approach to Operational Semantics. Technical Report DAIMI FN-19, \u00e5rhus University. Computer Science Department, \u00e5rhus, Denmark, 1981."},{"key":"36_CR19","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 and A.W. Roscoe. A timed model for Communicating Sequential Processes. Theoretical Computer Science, 58 (pp 249\u2013261), 1988.","journal-title":"Theoretical Computer Science"},{"key":"36_CR20","volume-title":"Programming Research Group","author":"S. Schneider","year":"1991","unstructured":"S. Schneider. An Operational Semantics for Timed CSP. Programming Research Group, Oxford University, UK, February 1991."},{"key":"36_CR21","first-page":"502","volume-title":"LNCS 458","author":"Yi. Wang","year":"1990","unstructured":"Wang Yi. Real-time behaviour of asynchronous agents. In J.C.M. Baeten and J.W. Klop, editors, LNCS 458. Proceedings of CONCUR '90 (Theories of Concurrency: Unification and Extension), Amsterdam, the Netherlands, pages 502\u2013520, Springer-Verlag, August 1990."},{"key":"36_CR22","doi-asserted-by":"crossref","unstructured":"Wang Yi. CCS+Time=an Interleaving Model for Real Time Systems. In Proceedings of ICALP '91, Madrid, Spain, July 1991.","DOI":"10.1007\/3-540-54233-7_136"}],"container-title":["Lecture Notes in Computer Science","Computer Aided Verification"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-55179-4_36.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:58:00Z","timestamp":1605646680000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-55179-4_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992]]},"ISBN":["9783540551799","9783540467632"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/3-540-55179-4_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1992]]}}}