Relevant bibliographies by topics / Computation Tree Logics

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers
  6. Reports

Academic literature on the topic 'Computation Tree Logics'

Author: Grafiati
Published: 6 September 2023
Last updated: 7 September 2023

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Computation Tree Logics.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Computation Tree Logics"

1

Kamide, Norihiro. "Logical foundations of hierarchical model checking." Data Technologies and Applications 52, no. 4 (2018): 539–63. http://dx.doi.org/10.1108/dta-01-2018-0002.

Full text
Abstract:
Purpose The purpose of this paper is to develop new simple logics and translations for hierarchical model checking. Hierarchical model checking is a model-checking paradigm that can appropriately verify systems with hierarchical information and structures. Design/methodology/approach In this study, logics and translations for hierarchical model checking are developed based on linear-time temporal logic (LTL), computation-tree logic (CTL) and full computation-tree logic (CTL*). A sequential linear-time temporal logic (sLTL), a sequential computation-tree logic (sCTL), and a sequential full comp
APA, Harvard, Vancouver, ISO, and other styles
2

DALLA CHIARA, MARIA LUISA, ROBERTO GIUNTINI, and ROBERTO LEPORINI. "LOGICS FROM QUANTUM COMPUTATION." International Journal of Quantum Information 03, no. 02 (2005): 293–337. http://dx.doi.org/10.1142/s0219749905000943.

Full text
Abstract:
The theory of logical gates in quantum computation has suggested new forms of quantum logic, called quantum computational logics. The basic semantic idea is the following: the meaning of a sentence is identified with a quregister (a system of qubits) or, more generally, with a mixture of quregisters (called qumix). In this framework, any sentence α of the language gives rise to a quantum tree: a kind of quantum circuit that transforms the quregister (qumix) associated to the atomic subformulas of α into the quregister (qumix) associated to α. A variant of the quantum computational semantics is
APA, Harvard, Vancouver, ISO, and other styles
3

Goranko, Valentin. "Temporal Logics with Reference Pointers and Computation Tree Logics." Journal of Applied Non-Classical Logics 10, no. 3-4 (2000): 221–42. http://dx.doi.org/10.1080/11663081.2000.10510998.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

BALTAZAR, P., R. CHADHA, and P. MATEUS. "QUANTUM COMPUTATION TREE LOGIC — MODEL CHECKING AND COMPLETE CALCULUS." International Journal of Quantum Information 06, no. 02 (2008): 219–36. http://dx.doi.org/10.1142/s0219749908003530.

Full text
Abstract:
Logics for reasoning about quantum states and their evolution have been given in the literature. In this paper, we consider quantum computation tree logic (QCTL), which adds temporal modalities to exogenous quantum propositional logic. We give a sound and complete axiomatization of QCTL and combine the standard CTL model-checking algorithm with the dEQPL model-checking algorithm to obtain a model-checking algorithm for QCTL. Finally, we illustrate the use of the logic by reasoning about the BB84 key distribution protocol.
APA, Harvard, Vancouver, ISO, and other styles
5

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 (2016): 813–27. http://dx.doi.org/10.20965/jaciii.2016.p0813.

Full text
Abstract:
Computation tree logic (CTL) is known to be one of the most useful temporal logics for verifying concurrent systems by model checking technologies. However, CTL is not sufficient for handling inconsistency-tolerant and probabilistic accounts of concurrent systems. In this paper, a paraconsistent (or inconsistency-tolerant) probabilistic computation tree logic (PpCTL) is derived from an existing probabilistic computation tree logic (pCTL) by adding a paraconsistent negation connective. A theorem for embedding PpCTL into pCTL is proven, thereby indicating that we can reuse existing pCTL-based mo
APA, Harvard, Vancouver, ISO, and other styles
6

Walker, Matt, Parssa Khazra, Anto Nanah Ji, Hongru Wang, and Franck van Breugel. "jpf-logic." ACM SIGSOFT Software Engineering Notes 48, no. 1 (2023): 32–36. http://dx.doi.org/10.1145/3573074.3573083.

Full text
Abstract:
We present jpf-logic, an extension of the model checker Java PathFinder (JPF). Our extension jpf-logic provides a framework to check properties expressed in temporal logics such as linear temporal logic (LTL) and computation tree logic (CTL). To support a logic in our framework, we (1) implement a parser for the logic, (2) develop a hierarchy of classes that represent the abstract syntax of the logic and implement a transformation from parse trees of formulas to the corresponding abstract syntax trees, and (3) implement a model checking algorithm that takes as input an abstract syntax tree of
APA, Harvard, Vancouver, ISO, and other styles
7

JACOBS, BART. "The temporal logic of coalgebras via Galois algebras." Mathematical Structures in Computer Science 12, no. 6 (2002): 875–903. http://dx.doi.org/10.1017/s096012950200378x.

Full text
Abstract:
This paper introduces a temporal logic for coalgebras. Nexttime and lasttime operators are defined for a coalgebra, acting on predicates on the state space. They give rise to what is called a Galois algebra. Galois algebras form models of temporal logics like Linear Temporal Logic (LTL) and Computation Tree Logic (CTL). The mapping from coalgebras to Galois algebras turns out to be functorial, yielding indexed categorical structures. This construction gives many examples, for coalgebras of polynomial functors on sets. More generally, it will be shown how ‘fuzzy’ predicates on metric spaces, an
APA, Harvard, Vancouver, ISO, and other styles
8

PENCZEK, WOJCIECH. "TEMPORAL LOGICS FOR TRACE SYSTEMS: ON AUTOMATED VERIFICATION." International Journal of Foundations of Computer Science 04, no. 01 (1993): 31–67. http://dx.doi.org/10.1142/s0129054193000043.

Full text
Abstract:
We investigate an extension of CTL (Computation Tree Logic) by past modalities, called CTL P, interpreted over Mazurkiewicz’s trace systems. The logic is powerful enough to express most of the partial order properties of distributed systems like serializability of database transactions, snapshots, parallel execution of program segments, or inevitability under concurrency fairness assumption. We show that the model checking problem for the logic is NP-hard, even if past modalities cannot be nested. Then, we give a one exponential time model checking algorithm for the logic without nested past m
APA, Harvard, Vancouver, ISO, and other styles
9

Latte, Markus. "Branching-time logics and fairness, revisited." Mathematical Structures in Computer Science 31, no. 9 (2021): 1135–44. http://dx.doi.org/10.1017/s0960129521000475.

Full text
Abstract:
AbstractEmerson and Halpern (1986, Journal of the Association for Computing Machinery33, 151–178) prove that the Computation Tree Logic (CTL) cannot express the existence of a path on which a proposition holds infinitely often (fairness for short).The scope is widened from CTL to a general branching-time logic. A path quantifier is followed by a language with temporal descriptions. In this extended setting, the said inexpressiveness is strengthened in two aspects. First, universal path quantifiers are unrestricted. In this way, they are relieved of any temporal quantifiers such as of those in
APA, Harvard, Vancouver, ISO, and other styles
10

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.

Full text
Abstract:
This paper deals with issue of properties specification for software verifications and translation between formal languages. Through this paper, the unique framework of property specifications including most kinds of formal specifications logics, automatic methods are shown by a property specifications guided system and PVSL(The Pattern based Visual property Specification Language).Additionally, a properties to specify and structures, Interconnection of them are also described by property charts. In this study, the pattern based visual property specification language (PVSL) is defined and prop
APA, Harvard, Vancouver, ISO, and other styles

Dissertations / Theses on the topic "Computation Tree Logics"

1

Wagner, Daniel. "Finite-state abstractions for probabilistic computation tree logic." Thesis, Imperial College London, 2011. http://hdl.handle.net/10044/1/6348.

Full text
Abstract:
Probabilistic Computation Tree Logic (PCTL) is the established temporal logic for probabilistic verification of discrete-time Markov chains. Probabilistic model checking is a technique that verifies or refutes whether a property specified in this logic holds in a Markov chain. But Markov chains are often infinite or too large for this technique to apply. A standard solution to this problem is to convert the Markov chain to an abstract model and to model check that abstract model. The problem this thesis therefore studies is whether or when such finite abstractions of Markov chains for model ch
APA, Harvard, Vancouver, ISO, and other styles
2

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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

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.

Full text
Abstract:
<p>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
APA, Harvard, Vancouver, ISO, and other styles
4

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/.

Full text
Abstract:
Verificação de modelos é uma das mais eficientes técnicas de verificação automática de sistemas. No entanto, apesar de poder lidar com verificações complexas, as ferramentas de verificação de modelos usualmente não fornecem informação alguma sobre como reparar inconsistências nestes modelos. Nesta dissertação, mostramos que abordagens desenvolvidas para a atualização de modelos CTL inconsistentes não são capazes de lidar com todos os tipos de alterações em modelos. Introduzimos então o conceito de revisão de modelos: uma abordagem baseada em revisão de crenças para o reparo de modelos inconsis
APA, Harvard, Vancouver, ISO, and other styles
5

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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Ye, Xin. "Model checking self modifying code." Thesis, Université de Paris (2019-....), 2019. http://www.theses.fr/2019UNIP7010.

Full text
Abstract:
Le code auto-modifiant est un code qui modifie ses propres instructions pendant le temps d'exécution. Il est aujourd'hui largement utilisé, notamment dans les logiciels malveillants pour rendre le code difficile à analyser et à été détecté par les anti-virus. Ainsi, l'analyse de tels programmes d'auto-modifiant est un grand défi. Pushdown System(PDSs) est un modèle naturel qui est largement utilisé pour l'analyse des programmes séquentiels car il permet de modéliser précisément les appels de procédures et de simuler la pile du programme. Dans cette thèse, nous proposons d'étendre le modèle du
APA, Harvard, Vancouver, ISO, and other styles
7

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.

Full text
Abstract:
Die steigende Nachfrage an immer komplexeren Systemen in verschiedensten wirtschaftlichen Bereichen, erfordert Strategien, die Wartbarkeit und Wiederverwendbarkeit unterstützen. An diesem Punkt setzen service-orientierte Architekturen (SOAn) an. Dieses Paradigma fordert die Aufspaltung von Funktionalität in Services, die komponiert werden können, um eine gewünschte, komplexe Funktionalität zu erreichen. Besonders in sicherheitskritischen Bereichen, kann eine fehlerbehaftete Komposition jedoch zu hohen finanziellen Einbußen oder sogar zu lebensbedrohlichen Situationen führen. Um die Korrektheit
APA, Harvard, Vancouver, ISO, and other styles
8

Kommineni, Vasanta Lakshmi. "Model Checking Temporal Properties of Presburger Counter Systems." Thesis, 2018. https://etd.iisc.ac.in/handle/2005/4388.

Full text
Abstract:
Counter systems are a well-known and powerful modeling notation for specifying infnite state systems. In this thesis we target the problem of checking temporal properties of counter systems. We address three predominant families of temporal property specifications, namely Computation Tree Logics (CTL and CTL*) and Linear Temporal Logic (LTL). We provide two novel techniques to model check LTL and CTL properties of counter systems. We then provide a third technique to model check CTL temporal properties, which uses our LTL model checking technique as a sub-routine and is a modified version
APA, Harvard, Vancouver, ISO, and other styles
9

王常餘. "Application of computation tree logic methodon railway signaling system testing." Thesis, 2003. http://ndltd.ncl.edu.tw/handle/37566064529019320893.

Full text
Abstract:
碩士<br>國立臺灣科技大學<br>電機工程系<br>91<br>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
APA, Harvard, Vancouver, ISO, and other styles
10

Kelly, Michael A. "The tree-like local model update with domain constraints." Thesis, 2011. http://handle.uws.edu.au:8081/1959.7/512105.

Full text
Abstract:
Model update is the logical extension of model checking, allowing automated modification to models found not to satisfy a given property in the checking process. In local model update, counterexamples are derived from model checking sessions where some ACTL formula has been found unsatisfied. By updating the localised models to satisfy the underlying property, we may derive modifications to the original global model. Constraints also play an essential role in describing allowable system behaviour. Variable and action constraints can be defined which describe allowable updates on a counterexamp
APA, Harvard, Vancouver, ISO, and other styles

Books on the topic "Computation Tree Logics"

1

1954-, Kolb Hans-Peter, and Mönnich Uwe 1939-, eds. The mathematics of syntactic structure: Trees and their logics. M. de Gruyter, 1999.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

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.

Full text
Abstract:
The chapter examines the various propositional and predicate many-valued logics that were studied prior to the emergence of the concept of a fuzzy set in the mid-1960s, which led to the genesis of fuzzy logic in broad and narrow senses. Early ideas regarding formal systems of fuzzy logic allowed for deduction from partially true premises to partially true consequences, as suggested first by Goguen in the 1960s and further developed by Pavelka in the 1970s, and these ideas were developed from the 1990s onward. The systematic development of fuzzy logics based on t-norms and their residua, pursue
APA, Harvard, Vancouver, ISO, and other styles
3

Anderson, James A. The Brain Works by Logic. Oxford University Press, 2018. http://dx.doi.org/10.1093/acprof:oso/9780199357789.003.0007.

Full text
Abstract:
Brains and computers were twins separated at birth. In 1943, it was known that action potentials were all or none, approximating TRUE or FALSE. In that year, Walter Pitts and Warren McCulloch wrote a paper suggesting that neurons were computing logic functions and that networks of such neurons could compute any finite logic function. This was a bold and exciting large-scale theory of brain function. Around the same time, the first digital computer, the ENIAC, was being built. The McCulloch-Pitts work was well known to the scientists building ENIAC. The connection between them appeared explicit
APA, Harvard, Vancouver, ISO, and other styles
4

(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.

Find full text
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Computation Tree Logics"

1

Mogavero, Fabio. "Graded Computation Tree Logic." In Logics in Computer Science. Atlantis Press, 2013. http://dx.doi.org/10.2991/978-94-91216-95-4_1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Mansutti, Alessio. "An Auxiliary Logic on Trees: on the Tower-Hardness of Logics Featuring Reachability and Submodel Reasoning." In Lecture Notes in Computer Science. Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-45231-5_24.

Full text
Abstract:
AbstractWe describe a set of simple features that are sufficient in order to make the satisfiability problem of logics interpreted on trees Tower-hard. We exhibit these features through an Auxiliary Logic on Trees (), a modal logic that essentially deals with reachability of a fixed node inside a forest and features modalities from sabotage modal logic to reason on submodels. After showing that admits a Tower-complete satisfiability problem, we prove that this logic is captured by four other logics that were independently found to be Tower-complete: two-variables separation logic, quantified computation tree logic, modal logic of heaps and modal separation logic. As a by-product of establishing these connections, we discover strict fragments of these logics that are still non-elementary.
APA, Harvard, Vancouver, ISO, and other styles
3

Konikowska, Beata, and Wojciech Penczek. "Model Checking for Multi-valued Computation Tree Logics." In Beyond Two: Theory and Applications of Multiple-Valued Logic. Physica-Verlag HD, 2003. http://dx.doi.org/10.1007/978-3-7908-1769-0_8.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Thomas, Wolfgang. "Computation tree logic and regular ω-languages." In Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency. Springer Berlin Heidelberg, 1989. http://dx.doi.org/10.1007/bfb0013041.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Bednarczyk, Bartosz, and Oskar Fiuk. "Presburger Büchi Tree Automata with Applications to Logics with Expressive Counting." In Logic, Language, Information, and Computation. Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-031-15298-6_19.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Axelsson, Roland, Matthew Hague, Stephan Kreutzer, Martin Lange, and Markus Latte. "Extended Computation Tree Logic." In Logic for Programming, Artificial Intelligence, and Reasoning. Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-16242-8_6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Nayak, Satya Prakash, Daniel Neider, Rajarshi Roy, and Martin Zimmermann. "Robust Computation Tree Logic." In Lecture Notes in Computer Science. Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-031-06773-0_29.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Ciesinski, Frank, and Marcus Größer. "On Probabilistic Computation Tree Logic." In Lecture Notes in Computer Science. Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/978-3-540-24611-4_5.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Kaivola, Roope. "Axiomatising extended computation tree logic." In Trees in Algebra and Programming — CAAP '96. Springer Berlin Heidelberg, 1996. http://dx.doi.org/10.1007/3-540-61064-2_31.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Rensink, Arend. "Model Checking Quantified Computation Tree Logic." In CONCUR 2006 – Concurrency Theory. Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11817949_8.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Computation Tree Logics"

1

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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

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.

Full text
Abstract:
Abstract Computation Tree Measurement Language (CTML) is a newly developed formal language that offers simultaneous model verification and performance evaluation measures. While the theory behind CTML has been established, the language has yet to be tested on a practical example. In this work, we wish to demonstrate the utility of CTML when applied to a real-world application based in manufacturing. Mobile manipulators may enable more flexible, dynamic workflows within industry. Therefore, an artifact-based performance measurement test method for mobile manipulator robots developed at the Nati
APA, Harvard, Vancouver, ISO, and other styles
4

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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

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.

Full text
Abstract:
This paper explores a parallel discrete event simulator that simulates a programmable fat tree network. The programmable networks can be programmed to perform application specific tasks. The task explored in our research is a time management functionality offloaded to the network switches. Specifically, the network switches used for constructing the fat tree run Greatest Available Logical Time (GALT) computation. In this paper, this switch-based GALT computation is compared against two node-based GALT computations using the simulator developed.
APA, Harvard, Vancouver, ISO, and other styles
6

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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

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.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Computation Tree Logics"

1

Lutz, Carsten. PDL with Intersection and Converse is Decidable. Technische Universität Dresden, 2005. http://dx.doi.org/10.25368/2022.148.

Full text
Abstract:
In its many guises and variations, propositional dynamic logic (PDL) plays an important role in various areas of computer science such as databases, artificial intelligence, and computer linguistics. One relevant and powerful variation is ICPDL, the extension of PDL with intersection and converse. Although ICPDL has several interesting applications, its computational properties have never been investigated. In this paper, we prove that ICPDL is decidable by developing a translation to the monadic second order logic of infinite trees. Our result has applications in information logic, descriptio
APA, Harvard, Vancouver, ISO, and other styles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography