{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:20:16Z","timestamp":1725664816869},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540610526"},{"type":"electronic","value":"9783540499367"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-61052-9_54","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T21:12:30Z","timestamp":1330290750000},"page":"321-338","source":"Crossref","is-referenced-by-count":8,"title":["Broadcasting in time"],"prefix":"10.1007","author":[{"given":"K. V. S.","family":"Prasad","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,4]]},"reference":[{"key":"20_CR1","doi-asserted-by":"crossref","unstructured":"J\u00f6rgen Andersen, Ed Harcourt, and K.V.S. Prasad. A machine verified sorting algorithm. Preliminary version, 1995.","DOI":"10.7146\/brics.v3i4.19967"},{"key":"20_CR2","doi-asserted-by":"crossref","unstructured":"Rance Cleaveland and Matthew Hennessy. Priorities in process algebras. Information and Computation, 87, 1990.","DOI":"10.1016\/0890-5401(90)90059-Q"},{"key":"20_CR3","doi-asserted-by":"crossref","unstructured":"Juanito Camilleri and Glynn Winskel. CCS with priority choice. In Symposium on Logic in Computer Science. IEEE, 1991.","DOI":"10.1109\/LICS.1991.151649"},{"key":"20_CR4","doi-asserted-by":"crossref","unstructured":"Jens Chr. Godskesen and Kim G. Larsen. Real-time calculi and expansion theorems. In FST&TCS'92, 1992. Springer Verlag LNCS 652.","DOI":"10.1007\/3-540-56287-7_114"},{"key":"20_CR5","doi-asserted-by":"crossref","unstructured":"Matthew Hennessy. Timed process algebras: a tutorial. In Marktoberdorf Summer School on process design calculi, 1992.","DOI":"10.1007\/978-3-662-02880-3_11"},{"key":"20_CR6","unstructured":"Ed Harcourt, Pawel Paczkowski, and K.V.S. Prasad. A framework for representing value-passing parametric processes. Preliminary version, 1995."},{"key":"20_CR7","unstructured":"Matthew Hennessy and Tim Regan. A temporal process algebra. Computer Science Internal Report 2\/90, University of Sussex, 1990."},{"key":"20_CR8","unstructured":"Alan Jeffrey. Observation Spaces and Timed Processes. D.phil, Oxford University, 1992."},{"key":"20_CR9","doi-asserted-by":"crossref","unstructured":"Alan Jeffrey. Translating timed process algebra into prioritised process algebra. In Nijmegen Symposium on Real-Time and Fault-Tolerant Systems, 1992.","DOI":"10.1007\/3-540-55092-5_27"},{"key":"20_CR10","doi-asserted-by":"crossref","unstructured":"Kim Larsen and Wang Yi. Time abstracted bisimulation: Implicit specifications and decidability. In Mathematical Foundations of Programming Semantics, 1993.","DOI":"10.1007\/3-540-58027-1_8"},{"key":"20_CR11","unstructured":"Robin Milner. Communication and Concurrency. Prentice Hall, 1989."},{"key":"20_CR12","doi-asserted-by":"crossref","unstructured":"K. V. S. Prasad. Programming with broadcasts. In CONCUR, August 1993. Springer Verlag LNCS 715.","DOI":"10.1007\/3-540-57208-2_13"},{"key":"20_CR13","doi-asserted-by":"crossref","unstructured":"K. V. S. Prasad. Broadcasting with priority. In ESOP, April 1994. Springer Verlag LNCS 788.","DOI":"10.1007\/3-540-57880-3_31"},{"key":"20_CR14","doi-asserted-by":"crossref","unstructured":"K. V. S. Prasad. A calculus of broadcasting systems. Science of Computer Programming, 25, 1995.","DOI":"10.1016\/0167-6423(95)00017-8"},{"key":"20_CR15","unstructured":"C. Runciman and D. Wakeling. Profiling parallelism. Internal report, Department of Computer Science, University of York, 1993."},{"key":"20_CR16","unstructured":"Wang Yi. Real time behaviour of asynchronous agents. In CONCUR'90, 1990. Springer Verlag LNCS 458."},{"key":"20_CR17","unstructured":"Wang Yi. A Calculus of Real Time Systems. PhD thesis, Chalmers University of Technology, June 1991."}],"container-title":["Lecture Notes in Computer Science","Coordination Languages and Models"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-61052-9_54.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:03:44Z","timestamp":1605647024000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-61052-9_54"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540610526","9783540499367"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-61052-9_54","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}