Computational modeling of consistent observation of asynchronous distributed computation on N–manifold

References

• Akinwunmi, A. O. , Olajubu, E. A. , & Aderounmu, G. A. (2016). A multi-agent system approach for trustworthy cloud service discovery. Cogent Engineering , 3, Taylor & Francis, UK. doi: 10.1080/23311916.2016.1256084
   Web of Science ®Google Scholar
• Armstrong, M. A. (1983). Basic topology . New York, NY: Springer-Verlag. ISBN 978-1-4757-1793-8.
   Google Scholar
• Ayara, A. , & Najjar, F. , A formal specification model of survivability for pervasive systems, In Proceedings of 2008 International Symposium on Parallel and Distributed Processing with Applications, Sydney, Australia, IEEE, 2008.
   Google Scholar
• Babaoglu, O. , & Marzullo, K. (1993).Consistent global states of distributed systems: Fundamental concepts and mechanisms. Book: Distributed systems , 2nd ). pp. 55–96 ACM Press/Addison-Wesley Publishing: New York, NY ISBN 0-201-62427-3.
   Google Scholar
• Bagchi, S. (2018). Formal analysis of control and termination of distributed computation in weaker spaces, Cogent Engineering , 5. U.K.: Taylor & Francis.
   Web of Science ®Google Scholar
• Bauer, U. , Kerber, M. , & Reininghaus, J. (2014). Distributed computation of persistent homology, In proceedings of Meeting on Algorithm Engineering and Experiments, SIAM, Oregon, USA, pp. 31–38. doi: 10.1002/jbm.b.32976
   Google Scholar
• Carson, S. D. , & Reynolds, P. F., Jr. (1987). The geometry of semaphore programs. ACM Transaction Programming Languages Systems, ACM , 9(1), 25–53. doi:10.1145/9758.9759
   Web of Science ®Google Scholar
• Conde, R. , & Rajsbaum, S. (2012). An introduction to topological theory of distributed computing with safe-consensus. Electronic Notes in Theoretical Computer Science, Elsevier , 283, 29–51. doi:10.1016/j.entcs.2012.05.004
   Google Scholar
• Edelsbrunner, H. , & Harer, J. (2010). Computational topology: An introduction . USA: American Mathematical Society.
   Google Scholar
• Fajstrup, L. , Rauben, M. , & Goubault, E. 2006. Algebraic topology and concurrency. Theoretical Computer Science 357(1–3): 241–278. Elsevier. doi:10.1016/j.tcs.2006.03.022.
   Web of Science ®Google Scholar
• Fidge, C. (1996). Fundamentals of distributed system observation. IEEE Software , 13(6), 77–83. doi:10.1109/52.542297
   Web of Science ®Google Scholar
• Garg, V. K. , Agarwal, A. , & Ogale, V. (2014). Modeling. Analyzing and Slicing Periodic Distributed Computations, Information and Computation , 234(Elsevier), 26–43.
   Google Scholar
• Goldberg, A. P. , Gopal, A. , Lowry, A. , & Strom, R. (1991). Restoring consistent global states of distributed computations, In Proceedings of the 1991 ACM/ONR Workshop on Parallel and Distributed Debugging (PADD 1991), ACM SIGPLAN, California, USA, pp. 144–154.
   Google Scholar
• Goubault, E. (2003). Some geometric perspectives in concurrency theory. Homology Homotopy Applications , 5(2), 95–136. doi:10.4310/HHA.2003.v5.n2.a5
   Google Scholar
• Gunawardena, J. (1994). Homotopy and concurrency. Bulletin of the EATCS , 54, 184–193.
   Google Scholar
• Herlihy, M. , & Rajsbaum, S. , New perspectives in distributed computing. In Proceedings of the 24th International Symp. on Mathematical Foundations of Computer Science, LNCS, Vol. 1672, Springer, Poland, 1999, pp. 170–186.
   Google Scholar
• Kuhn, F. , Lynch, N. , & Oshman, R. , Distributed computation in dynamic networks, Proceedings of the forty-second ACM symposium on Theory of computing (STOC’10), ACM, Massachusetts, USA, 2010, pp. 513–522. doi: 10.1177/1753193409357372
   Google Scholar
• Lee, J. M. (2013). Introduction to smooth manifolds. Graduate texts in mathematics 218 . New York, NY: Springer. doi: 10.1007/978-1-4419-9982-5_1
   Google Scholar
• Parlangeli, G. , & Notarstefano, G. (2012). On the reachability and observability of path and cycle graphs. IEEE Transactions on Automatic Control , 57(3), 743–748. doi:10.1109/TAC.2011.2168912
   Web of Science ®Google Scholar
• Ranga, V. , Dave, M. , & Verma, A. K. (2016). Restoration of lost connectivity of partitioned wireless sensor networks. Cogent Engineering , 3, Taylor & Francis, UK. doi: 10.1080/23311916.2016.1186263
   Web of Science ®Google Scholar
• Rhode, M. G. , Presicce, F. P. , Simeoni, M. , & Taentzer, G. ; Modeling distributed systems by modular graph transformation based on refinement via rule expressions, International Workshop on Applications of Graph Transformations with Industrial Relevance (AGTIVE), ACM, Netherlands, 1999, pp. 31–45.
   Google Scholar
• Schwarz, R. , & Mattern, F. 1994. Detecting causal relationships in distributed computations: In search of the holy grail. Distributed Computing 7(3): 149–174. Springer. doi:10.1007/BF02277859.
   Web of Science ®Google Scholar
• Sitohang, B. , Parallel execution of relational algebra operator under distributed database systems, 2002 International Conference on Information Technology: Coding and Computing, IEEE, Las Vegas, USA, 2002, pp. 207–211.
   Google Scholar
• Zomorodian, A. , & Carlsson, G. (2005). Computing persistent homology. Discrete and Computational Geometry , 33(2), 249–274. doi:10.1007/s00454-004-1146-y
   Web of Science ®Google Scholar