Abstract
The molecular computing has been successfully employed to solve more and more complex computation problems. However, as an important complex problem, the Computational Tree Logic (CTL) model checking is still far from resolved under the circumstance of molecular computing, since it is still a lack of method. To address this issue, an autonomous model checking method is presented for checking all the basic constructs of CTL using DNA computing and sticker automata. As a result, the CTL model checking problem under the circumstance of molecular computing is solved preliminary. The simulated experimental results demonstrate the effectiveness of the new method in molecular biology.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Clarke, E., et al.: Model Checking. MIT press, Cambridge (1999)
Pnueli, A.: The temporal logic of programs. In: Symposium on Foundations of Computer Science, Washington, DC, USA, pp. 46–57 (1977)
Benari, M., Pnueli, A., Manna, Z.: The temporal logic of branching time. Acta Informatica 20(3), 207–226 (1983)
Emerson, E., Clarke, E.: Using branching time temporal logic to synthesize synchronization skeletons. Sci. Comput. Program. 2(3), 241–266 (1982)
Adleman, L.: Molecular computation of solutions to combinatorial problems. Science 266(5187), 1021–1023 (1994)
Lipton, R.: DNA solution of hard computational problems. Science 268(5210), 542–545 (1995)
Ouyang, Q., Kaplan, P.D., Liu, S., et al.: DNA solution of the maximal clique problem. Science 278(17), 446–449 (1997)
Shapiro, E., Benenson, Y., Adar, R., et al.: Programmable and autonomous computing machine made of biomolecules. Nature 414(6862), 430–434 (2001)
Jin, X.: Probe machine. IEEE Trans. Neural Netw. Learn. Syst. 27(7), 1405–1416 (2016)
Jin, X.: Forthcoming era of biological computer. Bull. Chin. Acad. Sci. 29(1), 42–54 (2014). (in Chinese)
Emerson, E., Hager, K., Konieczka, J.: Molecular model checking. Int. J. Found. Comput. Sci. 17(04), 733–741 (2006)
Zhu, W.-J., Zhou, Q.-L., Li, Y.-L.: LTL model checking based on DNA computing. Acta Electronica Sinica 44(6), 1265–1271 (2016)
Zhu, W.-J., Zhou, Q.-L., Zhang, Q.-X.: A LTL model checking approach based on DNA computing. Chin. J. Comput. (2016)
Zimmermann, K., Ignatova, Z., Perez, M.: DNA Computing Models. Springer, New York (2008)
NUPACK (2015). http://www.nupack.org/partition/new
Acknowledgment
This work has been supported by the NSFC project under Grant U1204608, 61572444, 61272022 and 61472372.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Zhu, W., Wang, Y., Zhou, Q., Nie, K. (2016). Model Checking Computational Tree Logic Using Sticker Automata. In: Gong, M., Pan, L., Song, T., Zhang, G. (eds) Bio-inspired Computing – Theories and Applications. BIC-TA 2016. Communications in Computer and Information Science, vol 681. Springer, Singapore. https://doi.org/10.1007/978-981-10-3611-8_2
Download citation
DOI: https://doi.org/10.1007/978-981-10-3611-8_2
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-10-3610-1
Online ISBN: 978-981-10-3611-8
eBook Packages: Computer ScienceComputer Science (R0)