| |
| 1998 | ||
|---|---|---|
| 4 | Luming Lai: An Unbounded Nondeterministic Model for CSP-like Languages. IWFM 1998 | |
| 1997 | ||
| 3 | Luming Lai, Phil Watson: A Case Study in Timed CSP: The Railroad Crossing Problem. HART 1997: 69-74 | |
| 2 | Luming Lai, Jeff W. Sanders: A Refinement Calculus for Communicating Processes with State. IWFM 1997 | |
| 1995 | ||
| 1 | Luming Lai: A Unified Model for CSP-like Languages with Specifications. FORTE 1995: 159-166 | |
| 1 | Jeff W. Sanders | [2] |
| 2 | Phil Watson | [3] |