Khaled A.S. Abdel-Ghaffar
IEEE Trans. Inf. Theory
We study the subset of the communicating sequential processes formalism in which processes are described in terms of recursive equations that use only constant processes, deterministic choice, parallel composition, and sequential composition. Even with this limited version, the formalism is powerful enough to model a Turing machine, so that a number of important problems such as boundedness, deadlock, and reachability are undecidable. © 1990 IEEE
Khaled A.S. Abdel-Ghaffar
IEEE Trans. Inf. Theory
Oliver Bodemer
IBM J. Res. Dev
Elena Cabrio, Philipp Cimiano, et al.
CLEF 2013
Ruixiong Tian, Zhe Xiang, et al.
Qinghua Daxue Xuebao/Journal of Tsinghua University