Open Access
Subscription Access
Modelling Finite and Infinite Behaviour of Cancer Stages Using Buchi and Finite Automata
Cancer is an incurable disease in which abnormal cells multiply uncontrollably and infect the surrounding tissues and organs of the body. A Buchi automaton is a finite automaton that operates on infinite input words. This article presents normal cell division and cancer progression using the finite automata and Buchi automaton respectively. It will help in understanding the intricacies of cancer, and can ultimately benefit in designing an effective treatment that can slow down the progression of cancer.
Keywords
Buchi Automaton, Cancer Progression, Cell Division, Doubling, Replication.
User
Font Size
Information
- Ribba, B., Alarcon, T., Marron, K., Maini, P. K. and Agur, Z., The use of hybrid cellular automaton models for improving cancer therapy. In Lecture Notes in Computer Science (Sloot, P. M. A., Chopard, B. and Hoekstra, A. G.), Cellular Automata. ACRI 2004. Springer, Berlin, Heidelberg, 2004, vol. 3305, pp. 444–453.
- Hanahan, D. and Weinberg, R. A., Hallmarks of cancer: the next generation. Cell, 2011, 144(5), 646–674.
- Bowles, J. K. F. and Silvina, A., Model checking cancer automata. IEEE-EMBS Int. Conf. Biomed. Health Inf. (BHI), Las Vegas, NV, USA, 2016, pp. 376–379.
- Giannakis, K. and Andronikos, T., Use of Büchi automata and randomness for the description of biological processes. Int. J. Sci. World, 2015, 3(1), 113–123.
- Loohuis, L. O., Witzel, A. and Mishra, B., Cancer hybrid automata: model, beliefs and therapy. Inform. Comput., 2014, 236, 68–86.
- Alur, R. and Dill, D. L., A theory of timed automata. Theor. Comput. Sci., 1994, 126, 183–235.
- Abbott, R. G., Forrest, S. and Pienta, K. J., Simulating the hallmarks of cancer. Artif. Life, 2006, 12(4), 617–634.
- Cohen, D. I. A., Introduction to Computer Theory, John Wiley, USA, 1996, 2nd edn.
- Hopcroft, J. E., Motwani, R. and Ullman, J. D., Introduction to Automata Theory, Languages and Computation, Pearson Education, 2005, 3rd edn.
- Huuck, R., Automata Theory 101, Lecture notes available a http://www.cse.unsw.edu.au/~cs4151/lecture2.pdf
- Zeng, B. and Tan, L., Test reactive systems with Buchi automata: acceptance condition coverage criteria and performance evaluation. In IEEE International Conference on Information Reuse and Integration (IRI), San Francisco, CA, USA, 2015, pp. 380–387.
- Piterman, N., From nondeterministic Buchi and Streett automata to deterministic parity automata. Log. Meth. Comput. Sci., 2007, 3, 1–21.
- Quaranta, V., Weaver, A. M., Cummings, P. T. and Anderson, A. R. A., Mathematical modeling of cancer: the future of prognosis and treatment. Clin. Chim. Acta, 2005, 357(2), 173–179.
Abstract Views: 387
PDF Views: 125