Factorizing Proofs in Timed CSP.

Davies, J and Schneider, S (1989) Factorizing Proofs in Timed CSP. In: Mathematical Foundations of Programming Semantics, ? - ?.

Full text not available from this repository.

Item Type:	Conference or Workshop Item (UNSPECIFIED)
Divisions :	Surrey research (other units)
Authors :	Name Email ORCID Davies, J Schneider, S s.schneider@surrey.ac.uk
Date :	1989
DOI :	10.1007/BFb0040256
Contributors :	Contribution Name Email ORCID Main, MG Melton, A Mislove, MW Schmidt, DA publisher Springer,
Related URLs :	Publisher
Depositing User :	Symplectic Elements
Date Deposited :	17 May 2017 11:30
Last Modified :	23 Jan 2020 16:55
URI:	http://epubs.surrey.ac.uk/id/eprint/831627

Actions (login required)

View Item

Downloads