{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:20:09Z","timestamp":1725456009264},"publisher-location":"Berlin\/Heidelberg","reference-count":30,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"354058241X"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0013979","type":"book-chapter","created":{"date-parts":[[2005,11,23]],"date-time":"2005-11-23T07:34:32Z","timestamp":1132731272000},"page":"30-47","source":"Crossref","is-referenced-by-count":0,"title":["A real time process logic"],"prefix":"10.1007","author":[{"given":"J. C. M.","family":"Baeten","sequence":"first","affiliation":[]},{"given":"J. A.","family":"Bergstra","sequence":"additional","affiliation":[]},{"given":"R. N.","family":"Bol","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"3_CR1","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1007\/BF01898401","volume":"3","author":"J.C.M. Baeten","year":"1991","unstructured":"J.C.M. Baeten & J.A. Bergstra, Real time process algebra, Formal Aspects of Computing 3 (2), 1991, pp. 142\u2013188.","journal-title":"Formal Aspects of Computing"},{"key":"3_CR2","unstructured":"J.C.M. Baeten, J.A. Bergstra & R.N. Bol, A real time process logic, report CSN 93\/15, Dept. of Computing Science, Eindhoven University of Technology, 1993."},{"issue":"6","key":"3_CR3","doi-asserted-by":"crossref","first-page":"498","DOI":"10.1093\/comjnl\/30.6.498","volume":"30","author":"J.C.M. Baeten","year":"1987","unstructured":"J.C.M. Baeten, J.A. Bergstra & J.W. Klop, Ready trace semantics for concrete process algebra with priority operator, British Computer Journal 30 (6), 1987, pp. 498\u2013506.","journal-title":"British Computer Journal"},{"key":"3_CR4","first-page":"70","volume":"54","author":"J.W. Barker de","year":"1982","unstructured":"J.W. de Barker & J.I. Zucker, Processes and the denotational semantics of concurrency, I&C 54, 1982, pp. 70\u2013120.","journal-title":"I&C"},{"key":"3_CR5","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/S0019-9958(84)80025-X","volume":"60","author":"J.A. Bergstra","year":"1984","unstructured":"J.A. Bergstra & J.W. Klop, Process algebra for synchronous communication, Inf. & Control 60, 1984, pp. 109\u2013137.","journal-title":"Inf. & Control"},{"key":"3_CR6","unstructured":"J.A. Bergstra & J.W. Klop, A complete inference system for regular processes with silent moves, in: Proc. Logic Coll. 1986, Hull (F.R. Drake & J.K. Truss, eds.), North-Holland 1988, pp. 21\u201381."},{"key":"3_CR7","unstructured":"C.H. van Berkel, Handshake circuits: an intermediary between communicating processes and VLSI, Ph.D. Thesis, Eindhoven University of Technology 1992."},{"issue":"3","key":"3_CR8","doi-asserted-by":"publisher","first-page":"560","DOI":"10.1145\/828.833","volume":"31","author":"S.D. Brookes","year":"1984","unstructured":"S.D. Brookes, C.A.R. Hoare & A.W. Roscoe, A theory of communicating sequential processes, J. ACM 31 (3), 1984, pp. 560\u2013599.","journal-title":"J. ACM"},{"key":"3_CR9","doi-asserted-by":"crossref","unstructured":"M. Broy, Functional specification of time sensitive communication systems, NATO ASI series, series F: computer and systems sciences, Vol. 88, pp. 325\u2013367.","DOI":"10.1007\/978-3-642-77572-7_14"},{"key":"3_CR10","volume-title":"Tract 56","author":"J.C. Ebergen","year":"1989","unstructured":"J.C. Ebergen, Translating programs into delay-insensitive circuits, Tract 56, CWI Amsterdam 1989."},{"key":"3_CR11","doi-asserted-by":"crossref","unstructured":"R.J. van Glabbeek, The linear time \u2014 branching time spectrum, in: Proc. CONCUR'90, Amsterdam (J.C.M. Baeten & J.W. Klop, eds.), Springer LNCS 458, 1990, pp. 278\u2013297.","DOI":"10.1007\/BFb0039066"},{"key":"3_CR12","unstructured":"J.F. Groote, Personal communication, 1992."},{"key":"3_CR13","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1145\/79147.79161","volume":"37","author":"J.Y. Halpern","year":"1990","unstructured":"J.Y. Halpern & Y.O. Moses, Knowledge and common knowledge in a distributed environment, J. ACM 37, 1990, pp. 549\u2013587.","journal-title":"J. ACM"},{"key":"3_CR14","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/0304-3975(84)90113-0","volume":"34","author":"M. Hennessy","year":"1984","unstructured":"M. Hennessy & R. de Nicola, Testing equivalences for processes, TCS 34, 1984, pp. 83\u2013134.","journal-title":"TCS"},{"key":"3_CR15","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":"3_CR16","unstructured":"A. Kaldewaij, A formalism for concurrent processes, Ph.D. Thesis, Eindhoven University of Technology 1986."},{"key":"3_CR17","doi-asserted-by":"crossref","unstructured":"R.L.C. Koymans, Specifying message passing and time-critical systems with temporal logic, Ph.D. Thesis, Eindhoven University of Technology 1989.","DOI":"10.1007\/3-540-51803-7_28"},{"key":"3_CR18","doi-asserted-by":"crossref","unstructured":"R.L.C. Koymans, Specifying message passing systems requires extending temporal logic, in: Proc. Temporal Logic in Specification (B. Banieqbal, H. Barringer & A. Pnueli, eds.), Springer LNCS 398, 1989, pp. 213\u2013223.","DOI":"10.1007\/3-540-51803-7_28"},{"key":"3_CR19","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1016\/0304-3975(86)90045-9","volume":"45","author":"J. C. Meyer","year":"1985","unstructured":"J.-J. Ch. Meyer, Merging regular processes by means of fixed point theory, TCS 45, 1985, pp. 193\u2013260.","journal-title":"TCS"},{"key":"3_CR20","doi-asserted-by":"crossref","unstructured":"E.-R. Olderog, Nets, Terms and Formulas, Cambridge Tracts in Theor. Comp. Sci. 23, Cambridge University Press 1991.","DOI":"10.1017\/CBO9780511526589"},{"key":"3_CR21","doi-asserted-by":"crossref","unstructured":"E.-R. Olderog & C.A.R. Hoare, Specification-oriented semantics for communicating processes, in: Proc. ICALP 83 (J. D\u00edaz, ed.), Springer LNCS 154, 1983, pp. 561\u2013572.","DOI":"10.1007\/BFb0036937"},{"key":"3_CR22","unstructured":"J. Parrow, Fairness properties in process algebra \u2014 with applications in communication protocol verification, Ph.D. Thesis, Uppsala University 1985."},{"key":"3_CR23","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1016\/0304-3975(87)90117-4","volume":"50","author":"I.C.C. Philips","year":"1987","unstructured":"I.C.C. Philips, Refusal testing, TCS 50, 1987, pp. 241\u2013284.","journal-title":"TCS"},{"key":"3_CR24","doi-asserted-by":"crossref","unstructured":"A. Pnueli, Linear and branching structures in the semantics and logics of reactive systems, in: Proc. ICALP 85 (W. Brauer, ed.), Springer LNCS 194, 1985, pp. 15\u201332.","DOI":"10.1007\/BFb0015727"},{"key":"3_CR25","unstructured":"R. Reiter, On closed world databases, in: Logic and Databases (H. Gallaire and J. Minker, eds.), Plenum Press, 1978."},{"key":"3_CR26","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1016\/0304-3975(88)90030-8","volume":"58","author":"G.M. Reed","year":"1988","unstructured":"G.M. Reed & A.W. Roscoe, A timed model for communicating sequential processes, TCS 58, 1988, pp. 249\u2013261.","journal-title":"TCS"},{"key":"3_CR27","first-page":"1","volume-title":"MC Tract 159","author":"M. Rem","year":"1983","unstructured":"M. Rem, Partially ordered computations, with applications to VLSI design, in: Proc. Found. of Comp. Sci. IV.2 (J.W. de Bakker J. van Leeuwen, eds.), MC Tract 159, Math. Centre, Amsterdam 1983, pp. 1\u201344."},{"key":"3_CR28","doi-asserted-by":"crossref","unstructured":"J.L.A. van de Snepscheut, Trace theory and VLSI design, Springer LNCS 200, 1985.","DOI":"10.1007\/BFb0031414"},{"key":"3_CR29","unstructured":"J.T. Udding, Classification and composition of delay-insensitive circuits, Ph.D. Thesis, Eindhoven University of Technology 1986."},{"key":"3_CR30","volume-title":"Ph.D. Thesis","author":"E.P. Vink de","year":"1990","unstructured":"E.P. de Vink, Designing stream based semantics for uniform concurrency and logic programming, Ph.D. Thesis, Free University, Amsterdam 1990."}],"container-title":["Lecture Notes in Computer Science","Temporal Logic"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.springerlink.com\/index\/pdf\/10.1007\/BFb0013979","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,5]],"date-time":"2023-05-05T15:42:07Z","timestamp":1683301327000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0013979"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["354058241X"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/bfb0013979","relation":{},"subject":[]}}