Factorizing Proofs in Timed CSP.

Conference presentation

Factorizing Proofs in Timed CSP.

J Davies and S Schneider

MFPS 1989, Vol.LNCS 4, pp.129-159

Mathematical Foundations of Programming Semantics

1989

DOI: https://doi.org/10.1007/BFb0040256

Abstract

Files and links (1)

url

http://dx.doi.org/10.1007/BFb0040256View

Metrics

15 Record Views

Details

Title: Factorizing Proofs in Timed CSP.
Creators: J Davies
S Schneider
Contributors: MG Main
A Melton
MW Mislove
DA Schmidt
Springer (Publisher)
Publication Details: MFPS 1989, Vol.LNCS 4, pp.129-159
Conference: Mathematical Foundations of Programming Semantics
Date published: 1989
Date submitted: 17/05/2017
Identifiers: 99513601302346
Academic Unit: University of Surrey
Resource Type: Conference presentation