Formal analysis of control and termination of distributed computation in weaker spaces
The control and termination detection of a distributed computation involving large-scale distributed database is difficult in the presence of concurrency, random network delays, and varying reliability of computing nodes. The formal modeling and analysis of controllability as well as termination det...
| Autor principal: | |
|---|---|
| Formato: | Artículo |
| Lenguaje: | English |
| Publicado: |
Taylor & Francis Group
2018-01-01
|
| Colección: | Cogent Engineering |
| Materias: | |
| Acceso en línea: | http://dx.doi.org/10.1080/23311916.2018.1475033 |