{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:01:03Z","timestamp":1725663663302},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540544302"},{"type":"electronic","value":"9783540383574"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1991]]},"DOI":"10.1007\/3-540-54430-5_98","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T17:48:31Z","timestamp":1330192111000},"page":"332-345","source":"Crossref","is-referenced-by-count":3,"title":["Abstract timed observation and process algebra"],"prefix":"10.1007","author":[{"given":"Alan","family":"Jeffrey","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,4]]},"reference":[{"key":"24_CR1","unstructured":"J. C. M. Baeten and J. A. Bergstra. Real space process algebra. Technical Report P9005, Programming Research Group, University of Amsterdam, 1990."},{"key":"24_CR2","doi-asserted-by":"crossref","unstructured":"J. C. M. Baeten and J. A. Bergstra. Asynchronous communication in real space process algebra. In Proc. Chalmers Workshop on Concurrency. Department of Computer Sciences, Chalmers University, 1991.","DOI":"10.1007\/3-540-55092-5_26"},{"key":"24_CR3","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1007\/BF01898401","volume":"3","author":"J. C. M. Baeten","year":"1991","unstructured":"J. C. M. Baeten and J. A. Bergstra. Real time process algebra. Formal Aspects of Computing, 3:142\u2013188, 1991.","journal-title":"Formal Aspects of Computing"},{"issue":"3","key":"24_CR4","doi-asserted-by":"crossref","first-page":"560","DOI":"10.1145\/828.833","volume":"31","author":"S. D. Brookes","year":"1984","unstructured":"S. D. Brookes, C. A. R. Hoare, and A. W. Roscoe. A theory of communicating sequential processes. JACM, 31(3):560\u2013599, July 1984.","journal-title":"JACM"},{"key":"24_CR5","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/0304-3975(85)90088-X","volume":"37","author":"J. A. Bergstra","year":"1985","unstructured":"J. A. Bergstra and J. W. Klop. Algebra of communicating processes with abstraction. Theoretical Computer Science, 37:77\u2013121, 1985.","journal-title":"Theoretical Computer Science"},{"key":"24_CR6","doi-asserted-by":"crossref","unstructured":"J. C. M. Baeten and W. P. Weijland. Process Algebra, volume 18 of Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, 1990.","DOI":"10.1017\/CBO9780511624193"},{"key":"24_CR7","unstructured":"Jim Davies and Steve Schneider. An introduction to timed CSP. Technical monograph PRG-75, Oxford University Computing Laboratory, 1989."},{"key":"24_CR8","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/0304-3975(88)90124-7","volume":"61","author":"L. Jay","year":"1988","unstructured":"Jay L. Gischer. The equational theory of pomsets. Theoretical Computer Science, 61:199\u2013224, 1988.","journal-title":"Theoretical Computer Science"},{"key":"24_CR9","unstructured":"M. Hennessy. Algebraic Theory of Processes. The MIT Press, 1988."},{"key":"24_CR10","doi-asserted-by":"crossref","unstructured":"C. A. R. Hoare. Communicating Sequential Processes. Prentice-Hall, 1985.","DOI":"10.1007\/978-3-642-82921-5_4"},{"key":"24_CR11","unstructured":"M. Hennessy and T. Regan. A temporal process algebra. Technical Report 2\/90, University of Sussex, Computer Science Department, 1990."},{"key":"24_CR12","unstructured":"Alan Jeffrey. An algebraic structure for timed observation. In Proc. Chalmers Workshop on Concurrency. Department of Computer Sciences, Chalmers University, 1991."},{"key":"24_CR13","unstructured":"Alan Jeffrey. Discrete timed CSP. PMG Memo 79, Department of Computer Sciences, Chalmers University, 1991."},{"key":"24_CR14","doi-asserted-by":"crossref","unstructured":"Alan Jeffrey. A linear time process algebra. To be presented at CAV 91, 1991.","DOI":"10.1007\/3-540-55179-4_40"},{"key":"24_CR15","doi-asserted-by":"crossref","unstructured":"Robin Milner. A Calculus of Communicating Systems. Springer-Verlag, 1980. LNCS 92.","DOI":"10.1007\/3-540-10235-3"},{"key":"24_CR16","doi-asserted-by":"crossref","unstructured":"Robin Milner. Calculi for synchrony and asynchrony. Theoretical Computer Science, pages 267\u2013310, 1983.","DOI":"10.1016\/0304-3975(83)90114-7"},{"key":"24_CR17","unstructured":"Robin Milner. Communication and Concurrency. Prentice-Hall, 1989."},{"key":"24_CR18","doi-asserted-by":"crossref","unstructured":"F. Moller and C. Tofts. A temporal calculus of communicating systems. In Proc. Concur 90, pages 401\u2013415. Springer-Verlag, 1990. LNCS 458.","DOI":"10.1007\/BFb0039073"},{"key":"24_CR19","unstructured":"David Murphy. The physics of observation: A perspective for concurrency theorists. Submitted to the Bulletin of the EATCS, 1991."},{"key":"24_CR20","doi-asserted-by":"crossref","unstructured":"David Murphy. Testing, betting and true concurrency. To be presented at Concur 91, 1991.","DOI":"10.1007\/3-540-54430-5_105"},{"key":"24_CR21","unstructured":"X. Nicollin and J. Sifakis. The algebra of timed processes ATP: Theory and application. Technical Report RT-C26, Laboratoire de G\u00e9nie Informatique de Grenoble, 1990."},{"key":"24_CR22","unstructured":"George M. Reed. A Uniform Mathematical Theory for Real-time Distributed Computing. D.Phil thesis, Oxford University, 1988."},{"key":"24_CR23","doi-asserted-by":"crossref","unstructured":"G. M. Reed and A. W. Roscoe. A timed model for communicating sequential processes. In Proc. ICALP 86, pages 314\u2013323. Springer-Verlag, 1986, LNCS 226.","DOI":"10.1007\/3-540-16761-7_81"},{"key":"24_CR24","unstructured":"Steve Schneider. An operational semantics for timed CSP. In Proc. Chalmers Workshop on Concurrency, 1991."},{"key":"24_CR25","doi-asserted-by":"crossref","unstructured":"Wang Yi. Real-time behaviour of asynchronous agents. In Proc. Concur 90, pages 502\u2013520. Springer-Verlag, 1990. LNCS 458.","DOI":"10.1007\/BFb0039080"},{"key":"24_CR26","unstructured":"Wang Yi. CCS + time = an interleaving model for real time systems. To be presented at ICALP 91, 1991."}],"container-title":["Lecture Notes in Computer Science","CONCUR '91"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-54430-5_98.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,30]],"date-time":"2021-12-30T22:47:43Z","timestamp":1640904463000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-54430-5_98"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991]]},"ISBN":["9783540544302","9783540383574"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/3-540-54430-5_98","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1991]]}}}