Добірка наукової літератури з теми "Computation Tree Logics"
Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями
Ознайомтеся зі списками актуальних статей, книг, дисертацій, тез та інших наукових джерел на тему "Computation Tree Logics".
Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.
Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.
Статті в журналах з теми "Computation Tree Logics"
Kamide, Norihiro. "Logical foundations of hierarchical model checking." Data Technologies and Applications 52, no. 4 (September 4, 2018): 539–63. http://dx.doi.org/10.1108/dta-01-2018-0002.
Повний текст джерелаDALLA CHIARA, MARIA LUISA, ROBERTO GIUNTINI, and ROBERTO LEPORINI. "LOGICS FROM QUANTUM COMPUTATION." International Journal of Quantum Information 03, no. 02 (June 2005): 293–337. http://dx.doi.org/10.1142/s0219749905000943.
Повний текст джерелаGoranko, Valentin. "Temporal Logics with Reference Pointers and Computation Tree Logics." Journal of Applied Non-Classical Logics 10, no. 3-4 (January 2000): 221–42. http://dx.doi.org/10.1080/11663081.2000.10510998.
Повний текст джерелаBALTAZAR, P., R. CHADHA, and P. MATEUS. "QUANTUM COMPUTATION TREE LOGIC — MODEL CHECKING AND COMPLETE CALCULUS." International Journal of Quantum Information 06, no. 02 (April 2008): 219–36. http://dx.doi.org/10.1142/s0219749908003530.
Повний текст джерелаKamide, Norihiro, and Daiki Koizumi. "Method for Combining Paraconsistency and Probability in Temporal Reasoning." Journal of Advanced Computational Intelligence and Intelligent Informatics 20, no. 5 (September 20, 2016): 813–27. http://dx.doi.org/10.20965/jaciii.2016.p0813.
Повний текст джерелаWalker, Matt, Parssa Khazra, Anto Nanah Ji, Hongru Wang, and Franck van Breugel. "jpf-logic." ACM SIGSOFT Software Engineering Notes 48, no. 1 (January 10, 2023): 32–36. http://dx.doi.org/10.1145/3573074.3573083.
Повний текст джерелаJACOBS, BART. "The temporal logic of coalgebras via Galois algebras." Mathematical Structures in Computer Science 12, no. 6 (December 2002): 875–903. http://dx.doi.org/10.1017/s096012950200378x.
Повний текст джерелаPENCZEK, WOJCIECH. "TEMPORAL LOGICS FOR TRACE SYSTEMS: ON AUTOMATED VERIFICATION." International Journal of Foundations of Computer Science 04, no. 01 (March 1993): 31–67. http://dx.doi.org/10.1142/s0129054193000043.
Повний текст джерелаLatte, Markus. "Branching-time logics and fairness, revisited." Mathematical Structures in Computer Science 31, no. 9 (October 2021): 1135–44. http://dx.doi.org/10.1017/s0960129521000475.
Повний текст джерелаChun, Seung Su. "The Pattern Based Visual Property Specification Language and Supporting System for Software Verifications." Applied Mechanics and Materials 752-753 (April 2015): 1090–96. http://dx.doi.org/10.4028/www.scientific.net/amm.752-753.1090.
Повний текст джерелаДисертації з теми "Computation Tree Logics"
Wagner, Daniel. "Finite-state abstractions for probabilistic computation tree logic." Thesis, Imperial College London, 2011. http://hdl.handle.net/10044/1/6348.
Повний текст джерелаDoczkal, Christian [Verfasser], and Gert [Akademischer Betreuer] Smolka. "A machine-checked constructive metatheory of computation tree logic / Christian Doczkal. Betreuer: Gert Smolka." Saarbrücken : Saarländische Universitäts- und Landesbibliothek, 2016. http://d-nb.info/1097263258/34.
Повний текст джерелаRahpeymai, Neda. "Data Mining with Decision Trees in the Gene Logic Database : A Breast Cancer Study." Thesis, University of Skövde, Department of Computer Science, 2002. http://urn.kb.se/resolve?urn=urn:nbn:se:his:diva-710.
Повний текст джерелаData mining approaches have been increasingly used in recent years in order to find patterns and regularities in large databases. In this study, the C4.5 decision tree approach was used for mining of Gene Logic database, containing biological data. The decision tree approach was used in order to identify the most relevant genes and risk factors involved in breast cancer, in order to separate healthy patients from breast cancer patients in the data sets used. Four different tests were performed for this purpose. Cross validation was performed, for each of the four tests, in order to evaluate the capacity of the decision tree approaches in correctly classifying ‘new’ samples. In the first test, the expression of 108 breast related genes, shown in appendix A, for 75 patients were used as input to the C4.5 algorithm. This test resulted in a decision tree containing only four genes considered to be the most relevant in order to correctly classify patients. Cross validation indicates an average accuracy of 89% in classifying ‘new’ samples. In the second test, risk factor data was used as input. The cross validation result shows an average accuracy of 87% in classifying ‘new’ samples. In the third test, both gene expression data and risk factor data were put together as one input. The cross validation procedure for this approach again indicates an average accuracy of 87% in classifying ‘new’ samples. In the final test, the C4.5 algorithm was used in order to indicate possible signalling pathways involving the four genes identified by the decision tree based on only gene expression data. In some of cases, the C4.5 algorithm found trees suggesting pathways which are supported by the breast cancer literature. Since not all pathways involving the four putative breast cancer genes are known yet, the other suggested pathways should be further analyzed in order to increase their credibility.
In summary, this study demonstrates the application of decision tree approaches for the identification of genes and risk factors relevant for the classification of breast cancer patients
Oliveira, Paulo de Tarso Guerra. "Revisão de modelos CTL." Universidade de São Paulo, 2010. http://www.teses.usp.br/teses/disponiveis/45/45134/tde-25032014-092409/.
Повний текст джерелаModel checking is one of the most robust techniques in automated system verification. But, although this technique can handle complex verifications, model checking tools usually do not give any information on how to repair inconsistent system models. In this dissertation, we show that approaches developed for CTL model update cannot deal with all kinds of model changes. We introduce the concept of CTL model revision: an approach based on belief revision to handle system inconsistency in a static context. We relate our proposal to classical works on belief revision. We define an operator for model revision and we show that it obeys the classical rationality postulates of belief revision. We propose an algorithm for model revision based on the algorithm used by the model update approach. We discuss problems and limitations of our proposed algorithm and show that this strategy of adaptation is not an appropriate solution.
Amein, Hussein Aly Abbass. "Computational intelligence techniques for decision making : with applications to the dairy industry." Thesis, Queensland University of Technology, 2000. https://eprints.qut.edu.au/36867/1/36867_Digitised%20Thesis.pdf.
Повний текст джерелаYe, Xin. "Model checking self modifying code." Thesis, Université de Paris (2019-....), 2019. http://www.theses.fr/2019UNIP7010.
Повний текст джерелаA Self modifying code is code that modifies its own instructions during execution time. It is nowadays widely used, especially in malware to make the code hard to analyse and to detect by anti-viruses. Thus, the analysis of such self modifying programs is a big challenge. Pushdown Systems (PDSs) is a natural model that is extensively used for the analysis of sequential programs because it allows to accurately model procedure calls and mimic the program’s stack. In this thesis, we propose to extend the PushDown System model with self-modifying rules. We call the new model Self-Modifying PushDown System (SM-PDS). A SM-PDS is a PDS that can modify its own set of transitions during execution. First, we show how SM-PDSs can be used to naturally represent self-modifying programs and provide efficient algorithms to compute the backward and forward reachable configurations of SM-PDSs. Then, we consider the LTL model-checking problem of self-modifying code. We reduce this problem to the emptiness problem of Self-modifying Büchi Pushdown Systems (SM-BPDSs). We also consider the CTL model-checking problem of self-modifying code. We reduce this problem to the emptiness problem of Self-modifying Alternating Büchi Pushdown Systems (SM-ABPDSs). We implement our techniques in a tool called SMODIC. We obtained encouraging results. In particular, our tool was able to detect several self-modifying malwares; it could even detect several malwares that well-known anti-viruses such as McAfee, Norman, BitDefender, Kinsoft, Avira, eScan, Kaspersky, Qihoo-360, Avast and Symantec failed to detect
Bathelt-Tok, Franziska. "Controller-Synthese für Services mit Daten." Doctoral thesis, Humboldt-Universität zu Berlin, 2017. http://dx.doi.org/10.18452/18605.
Повний текст джерелаThe continuously increasing demand for more complex systems in various economical domains requires a strategy that supports maintainability and reusability. This is addressed by the service-oriented architecture (SOA)}-paradigm that encourages the encapsulation of functionality into services. To achieve a specific functionality, services can be composed. Especially in safety-critical systems, an incorrect composition of various components can lead to high financial losses or even life threatening situations. To ensure the correctness, composition methods must particularly be able to guarantee pre-specified requirements and to overcome interface incompatibilities, which result from the independent development of the single services. However, current approaches for automated service composition via controller synthesis do not support a formal data-treatment and do not cope with data-dependent behavior. In this thesis, we overcome this problem by providing an approach for the automated synthesis of data-dependent service controllers that are correct-by-construction. The core idea is to synthesize such a controller directly from given requirements and the behavior of the services. Based on the assumptions that the requirements are specified using a subset of Computational Tree Logic (CTL), called RCTL, and that the services are given as algebraic Petri Nets (APNs), our novel synthesis process unifies the two formalisms and enables a reliable extraction of the controller behavior. Especially due to the use of APNs, our approach supports a formal data-treatment and enables a consideration of data-dependent behavior. With our synthesis process, which is based on a successive combination of requirements and services, we provide a practical applicable approach that works fully automatically. We show the applicability of our approach using three case studies in which medical devices interact with each other.
Kommineni, Vasanta Lakshmi. "Model Checking Temporal Properties of Presburger Counter Systems." Thesis, 2018. https://etd.iisc.ac.in/handle/2005/4388.
Повний текст джерела王常餘. "Application of computation tree logic methodon railway signaling system testing." Thesis, 2003. http://ndltd.ncl.edu.tw/handle/37566064529019320893.
Повний текст джерела國立臺灣科技大學
電機工程系
91
The application of the computation tree logic method on railway signaling system testing is studied in this thesis. The function of the railway signaling system is to ensure transportation safety, and to increase traffic efficiency and density. The traditional design and maintenance of the interlocking mechanism of the signaling system mostly depend on the experiences of engineers. Much time and high human cost are needed in the processing of design and maintenance. Thus, the computation tree logic is proposed to test the interlocking mechanism of the signaling system such that the development and maintenance cost can be reduced. First, the principle of the signaling system is analyzed in this thesis. Then, the software tool, LabVIEW, is used to design the railway signaling system simulator. Meantime, wireless network is adopted as the communication media in the railway signaling system simulator. Finally, a look-up table and the computation tree logic method are used to test the interlocking mechanism of railway signaling system. The experimental results show that the elapsed time of using the computation tree logic method is less then that of using look-up table method. That is, objective to shorten the design and maintenance time of the interlocking mechanism can be achieved through the use of the computation tree logic method.
Kelly, Michael A. "The tree-like local model update with domain constraints." Thesis, 2011. http://handle.uws.edu.au:8081/1959.7/512105.
Повний текст джерелаКниги з теми "Computation Tree Logics"
1954-, Kolb Hans-Peter, and Mönnich Uwe 1939-, eds. The mathematics of syntactic structure: Trees and their logics. Berlin: M. de Gruyter, 1999.
Знайти повний текст джерелаBělohlávek, Radim, Joseph W. Dauben, and George J. Klir. Fuzzy Logic in the Narrow Sense. Oxford University Press, 2017. http://dx.doi.org/10.1093/oso/9780190200015.003.0004.
Повний текст джерелаAnderson, James A. The Brain Works by Logic. Oxford University Press, 2018. http://dx.doi.org/10.1093/acprof:oso/9780199357789.003.0007.
Повний текст джерела(Editor), Hans-Peter Kolb, and Uwe Monnich (Editor), eds. The Mathematics of Syntactic Structure: Trees and Their Logics (Studies in Generative Grammar, 44) (Studies in Generative Grammar). Mouton de Gruyter, 1999.
Знайти повний текст джерелаЧастини книг з теми "Computation Tree Logics"
Mogavero, Fabio. "Graded Computation Tree Logic." In Logics in Computer Science, 3–62. Paris: Atlantis Press, 2013. http://dx.doi.org/10.2991/978-94-91216-95-4_1.
Повний текст джерелаMansutti, Alessio. "An Auxiliary Logic on Trees: on the Tower-Hardness of Logics Featuring Reachability and Submodel Reasoning." In Lecture Notes in Computer Science, 462–81. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-45231-5_24.
Повний текст джерелаKonikowska, Beata, and Wojciech Penczek. "Model Checking for Multi-valued Computation Tree Logics." In Beyond Two: Theory and Applications of Multiple-Valued Logic, 193–210. Heidelberg: Physica-Verlag HD, 2003. http://dx.doi.org/10.1007/978-3-7908-1769-0_8.
Повний текст джерелаThomas, Wolfgang. "Computation tree logic and regular ω-languages." In Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, 690–713. Berlin, Heidelberg: Springer Berlin Heidelberg, 1989. http://dx.doi.org/10.1007/bfb0013041.
Повний текст джерелаBednarczyk, Bartosz, and Oskar Fiuk. "Presburger Büchi Tree Automata with Applications to Logics with Expressive Counting." In Logic, Language, Information, and Computation, 295–308. Cham: Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-031-15298-6_19.
Повний текст джерелаAxelsson, Roland, Matthew Hague, Stephan Kreutzer, Martin Lange, and Markus Latte. "Extended Computation Tree Logic." In Logic for Programming, Artificial Intelligence, and Reasoning, 67–81. Berlin, Heidelberg: Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-16242-8_6.
Повний текст джерелаNayak, Satya Prakash, Daniel Neider, Rajarshi Roy, and Martin Zimmermann. "Robust Computation Tree Logic." In Lecture Notes in Computer Science, 538–56. Cham: Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-031-06773-0_29.
Повний текст джерелаCiesinski, Frank, and Marcus Größer. "On Probabilistic Computation Tree Logic." In Lecture Notes in Computer Science, 147–88. Berlin, Heidelberg: Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/978-3-540-24611-4_5.
Повний текст джерелаKaivola, Roope. "Axiomatising extended computation tree logic." In Trees in Algebra and Programming — CAAP '96, 87–101. Berlin, Heidelberg: Springer Berlin Heidelberg, 1996. http://dx.doi.org/10.1007/3-540-61064-2_31.
Повний текст джерелаRensink, Arend. "Model Checking Quantified Computation Tree Logic." In CONCUR 2006 – Concurrency Theory, 110–25. Berlin, Heidelberg: Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11817949_8.
Повний текст джерелаТези доповідей конференцій з теми "Computation Tree Logics"
McCabe-Dansted, John Christopher, and Mark Reynolds. "Verification of Rewrite Rules for Computation Tree Logics." In 2014 21st International Symposium on Temporal Representation and Reasoning (TIME). IEEE, 2014. http://dx.doi.org/10.1109/time.2014.25.
Повний текст джерелаBianco, Alessandro, Fabio Mogavero, and Aniello Murano. "Graded Computation Tree Logic." In 2009 24th Annual IEEE Symposium on Logic In Computer Science (LICS). IEEE, 2009. http://dx.doi.org/10.1109/lics.2009.28.
Повний текст джерелаAboul-Enein, Omar, Yaping Jing, and Roger Bostelman. "Formalizing Performance Evaluation of Mobile Manipulator Robots Using CTML." In ASME 2020 International Mechanical Engineering Congress and Exposition. American Society of Mechanical Engineers, 2020. http://dx.doi.org/10.1115/imece2020-23234.
Повний текст джерелаBolotov, Alexander, Oleg Grigoriev, and Vasilyi Shangin. "Natural Deduction Calculus for Computation Tree Logic." In IEEE John Vincent Atanasoff 2006 International Symposium on Modern Computing (JVA'06). IEEE, 2006. http://dx.doi.org/10.1109/jva.2006.34.
Повний текст джерелаImre, Kayhan. "Simulating the Programmable Networks for HLA Compatible High-Performance Simulators." In 36th ECMS International Conference on Modelling and Simulation. ECMS, 2022. http://dx.doi.org/10.7148/2022-0291.
Повний текст джерелаMatas, Petr, Eva Dokladalova, Mohamed Akil, Vjaceslav Georgiev, and Martin Poupa. "Parallel Hardware Implementation of Connected Component Tree Computation." In 2010 International Conference on Field Programmable Logic and Applications (FPL). IEEE, 2010. http://dx.doi.org/10.1109/fpl.2010.23.
Повний текст джерелаLiu, Yuxin, Ziyuan Zhu, Yusha Zhang, Zhongkai Tong, Wenjing Cai, and Dan Meng. "Analysis of DRAM Vulnerability Using Computation Tree Logic." In ICC 2022 - IEEE International Conference on Communications. IEEE, 2022. http://dx.doi.org/10.1109/icc45855.2022.9839097.
Повний текст джерелаKernberger, Daniel, and Martin Lange. "Model Checking for the Full Hybrid Computation Tree Logic." In 2016 23rd International Symposium on Temporal Representation and Reasoning (TIME). IEEE, 2016. http://dx.doi.org/10.1109/time.2016.11.
Повний текст джерелаQian, Li, and Jing Liu. "Safe Reinforcement Learning via Probabilistic Timed Computation Tree Logic." In 2020 International Joint Conference on Neural Networks (IJCNN). IEEE, 2020. http://dx.doi.org/10.1109/ijcnn48605.2020.9207384.
Повний текст джерелаLukács, Gábor, and Tamás Bartha. "Transformation domain requirements specification into computation tree logic language." In 2022 IEEE 1st International Conference on Cognitive Mobility (CogMob). IEEE, 2022. http://dx.doi.org/10.1109/cogmob55547.2022.10117911.
Повний текст джерелаЗвіти організацій з теми "Computation Tree Logics"
Lutz, Carsten. PDL with Intersection and Converse is Decidable. Technische Universität Dresden, 2005. http://dx.doi.org/10.25368/2022.148.
Повний текст джерела