Timed CSP: Theory and practice

S. R. Blarney; J. Davies; D. M. Jackson; A. Kay; M. W. Mislove; G. M. Reed; J. N. Reed; A. W. Roscoe; B. Scattergood; S. A. Schneider; R. Stamper; S. Superville; A. Wallace

Conference Proceedings

Timed CSP: Theory and practice

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1992) 600 LNCS 640-675

DOI: 10.1007/BFb0032011

52Citations

15Readers

Get full text

Abstract

Over the past five years, G. M. Reed and A. W. Roscoe have directed a large group of research staff and graduate students at Oxford University in a comprehensive study of their theory of Timed CSP. This theory has now matured with associated proof systems, temporal logics, and refinement methods, and it has been employed in several realistic case studies. This paper presents an overview of the Oxford work on Timed CSP.

Author supplied keywords

Cite

CITATION STYLE

APA

Blarney, S. R., Davies, J., Jackson, D. M., Kay, A., Mislove, M. W., Reed, G. M., … Wallace, A. (1992). Timed CSP: Theory and practice. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 600 LNCS, pp. 640–675). Springer Verlag. https://doi.org/10.1007/BFb0032011

Timed CSP: Theory and practice

Abstract

Author supplied keywords

Cite

Register to see more suggestions