Erich P. Stuntebeck, John S. Davis II, et al.
HotMobile 2008
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
Erich P. Stuntebeck, John S. Davis II, et al.
HotMobile 2008
Xinyi Su, Guangyu He, et al.
Dianli Xitong Zidonghua/Automation of Electric Power Systems
Raghu Krishnapuram, Krishna Kummamuru
IFSA 2003
Beomseok Nam, Henrique Andrade, et al.
ACM/IEEE SC 2006