Metric spaces as models for real-time concurrency

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 298 LNCS, Issue , 1988, Pages 331-343

  Reed, G M ^a   Roscoe, A W ^a  

^a UNIVERSITY OF OXFORD   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING LANGUAGES; CONSTRAINT SATISFACTION PROBLEMS; FIXED POINT ARITHMETIC; SEMANTICS; SET THEORY; TOPOLOGY;

BANACH FIXED-POINT THEOREM; COMPLETE METRIC SPACE; DENOTATIONAL MODELS; FAILURES MODEL; FIXED POINT THEORY; METRIC SPACES; NON-DETERMINISM; REAL TIME CONCURRENT SYSTEMS;

REAL TIME SYSTEMS;

EID: 84947901054     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-19020-1_17     Document Type: Conference Paper

References (17)

1. A. Boucher, A time-based model for occam, Oxford University D.Phil. thesis 1986.
2. S.D. Brookes, A model for communicating sequential processes, Oxford University D.Phil. thesis 1983.
3. M. Broy, Fixed point theory for communication and concurency, TC2 Working Conference on Formal Description of Programming Concepts II, Garmisch, 1982.
4. S.D. Brookes, C.A.R. Hoare and A.W. Roscoe, A theory of communicating sequential processes, JACM 31 (1894), 560-599.
5. S.D. Brookes and A.W. Roscoe, An improved failures model for communicating processes, Proceedings of the Pittsburgh Seminar on Concurrency, Springer LNCS 197 (1985).
6. J.W. de Bakker and J.I. Zucker, Processes and the denotational semantics of concurrency, Information and Control 54 (1982), 70-120.
7. W.G. Golson and W.C. Rounds, Connections between two theories of concurrency: metric spaces and synchronisation trees, Information and Control 57 (1983), 102-124.
8. C.A.R. Hoare, A model for communicating sequential processes, On the construction of programs CUP (1980), 229-248.
9. C.A.R. Hoare, Communicating sequential processes, Prentice-Hall International, 1985.
10. G. Jones, A timed model for communicating processes, Oxford University D.Phil thesis, 1982.
11. R. Koymans, R.K. Shyamasundar, W.P. de Roever, R. Gerth and S. Arun-Kumar, Compositional semantics for real-time distributed computing Faculteit der Wiskunde en Natuurwetenschappen, Katholieke Universiteit, Nijmegen, Technical report 68, 1985.
12. M. Nivat, Infinite words, infinite trees, infinite computations, Foundations of Computer Science III (Math. Centre Tracts 109, 1979), 3-52.
13. E.R. Olderog and C.A.R. Hoare, Specification-oriented semantics for communicating processes, Springer LNCS 154 (1983), 561-572.
14. I. Phillips, Refusal testing, Proceedings of ICALP'86, Springer LNCS 226 (1986), 304-313.
15. A.W. Roscoe, A mathematical theory of communicating processes, Oxford University D.Phil thesis 1982.
16. W.C. Rounds, Applications of topology to the semantics of communicating processes, Proceedings of the Pittsburgh Seminar on Concurrency, Springer LNCS 197 (1985).
17. G.M. Reed and A.W. Roscoe, A timed model for communicating sequential processes, Proceedings of ICALR'86, Springer LNCS 226 (1986), 314-323.