A Unified Model for CSP-like Languages with Specifications. - Luming Lai (FORTE, 1995)

A Case Study in Timed CSP: The Railroad Crossing Problem. - Luming Lai; Phil Watson (HART, 1997)

A Refinement Calculus for Communicating Processes with State. - Luming Lai; Jeff W. Sanders (IWFM, 1997)

An Unbounded Nondeterministic Model for CSP-like Languages. - Luming Lai (IWFM, 1998)