Log in

Relevant bibliographies by topics / Modal logics; Temporal logic / Dissertations / Theses

To see the other types of publications on this topic, follow the link: Modal logics; Temporal logic.

Dissertations / Theses on the topic 'Modal logics; Temporal logic'

Author: Grafiati

Published: 4 June 2021

Last updated: 15 February 2022

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

Select a source type:

Consult the top 50 dissertations / theses for your research on the topic 'Modal logics; Temporal logic.'

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.

Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.

1

Reddy, Pamoori Venkateswara. "Tableau systems for tense logics : a constraint approach." Thesis, Imperial College London, 1995. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.283438.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Castellini, Claudio. "Automated reasoning in quantified modal and temporal logics." Thesis, University of Edinburgh, 2005. http://hdl.handle.net/1842/753.

Full text

Abstract:

This thesis is about automated reasoning in quantified modal and temporal logics, with an application to formal methods. Quantified modal and temporal logics are extensions of classical first-order logic in which the notion of truth is extended to take into account its necessity or equivalently, in the temporal setting, its persistence through time. Due to their high complexity, these logics are less widely known and studied than their propositional counterparts. Moreover, little so far is known about their mechanisability and usefulness for formal methods. The relevant contributions of this t

APA, Harvard, Vancouver, ISO, and other styles

3

Lange, Martin. "Games for modal and temporal logics." Thesis, University of Edinburgh, 2003. http://hdl.handle.net/1842/364.

Full text

Abstract:

Every logic comes with several decision problems. One of them is the model checking problem: does a given structure satisfy a given formula? Another is the satisfiability problem: for a given formula, is there a structure fulfilling it? For modal and temporal logics; tableaux, automata and games are commonly accepted as helpful techniques that solve these problems. The fact that these logics possess the tree model property makes tableau structures suitable for these tasks. On the other hand, starting with Büchi's work, intimate connections between these logics and automata have been found. A

APA, Harvard, Vancouver, ISO, and other styles

4

Pardo, Ventura Pere. "Logical planning in Temporal Defeasible and Dynamic Epistemic Logics: the case of t-DeLP and LCC." Doctoral thesis, Universitat de Barcelona, 2013. http://hdl.handle.net/10803/129620.

Full text

Abstract:

In this thesis, we study planning systems based on logics, for two particular cases: Temporal Defeasible Logic Programming t-DeLP and the Logics of Communication and Change LCC. A planning problem consists in building a course of actions, or plan, whose execution leads from a given initial state to some goal state. The motivation for the present studies, from the point of view of Logic, is to obtain systems for practical reasoning (what an agent should do) from given logics oriented to multi-agent systems. From the Artificial Intelligence point of view, the motivation consists in extending

APA, Harvard, Vancouver, ISO, and other styles

5

Borges, Rafael Vergara. "Investigações sobre raciocínio e aprendizagem temporal em modelos conexionistas." reponame:Biblioteca Digital de Teses e Dissertações da UFRGS, 2007. http://hdl.handle.net/10183/11488.

Full text

Abstract:

A inteligência computacional é considerada por diferentes autores da atualidade como o destino manifesto da Ciência da Computação. A modelagem de diversos aspectos da cognição, tais como aprendizagem e raciocínio, tem sido a motivação para o desenvolvimento dos paradigmas simbólico e conexionista da inteligência artificial e, mais recentemente, para a integração de ambos com o intuito de unificar as vantagens de cada abordagem em um modelo único. Para o desenvolvimento de sistemas inteligentes, bem como para diversas outras áreas da Ciência da Computação, o tempo é considerado como um componen

APA, Harvard, Vancouver, ISO, and other styles

6

Riveret, Régis <1979&gt. "Interactions between normative systems and software cognitive agents. A formalization in temporal modal defeasible logic and its implementation." Doctoral thesis, Alma Mater Studiorum - Università di Bologna, 2008. http://amsdottorato.unibo.it/911/.

Full text

Abstract:

Sustainable computer systems require some flexibility to adapt to environmental unpredictable changes. A solution lies in autonomous software agents which can adapt autonomously to their environments. Though autonomy allows agents to decide which behavior to adopt, a disadvantage is a lack of control, and as a side effect even untrustworthiness: we want to keep some control over such autonomous agents. How to control autonomous agents while respecting their autonomy? A solution is to regulate agents’ behavior by norms. The normative paradigm makes it possible to control autonomous agent

APA, Harvard, Vancouver, ISO, and other styles

7

Hague, Matthew. "Saturation methods for global model-checking pushdown systems." Thesis, University of Oxford, 2009. http://ora.ox.ac.uk/objects/uuid:40263ddb-312d-4e18-b774-2caf4def0e76.

Full text

Abstract:

Pushdown systems equip a finite state system with an unbounded stack memory, and are thus infinite state. By recording the call history on the stack, these systems provide a natural model for recursive procedure calls. Model-checking for pushdown systems has been well-studied. Tools implementing pushdown model-checking (e.g. Moped) are an essential back-end component of high-profile software model checkers such as SLAM, Blast and Terminator. Higher-order pushdown systems define a more complex memory structure: a higher-order stack is a stack of lower-order stacks. These systems form a robust h

APA, Harvard, Vancouver, ISO, and other styles

8

French, Timothy Noel. "Bisimulation quantifiers for modal logics." University of Western Australia. School of Computer Science and Software Engineering, 2006. http://theses.library.uwa.edu.au/adt-WU2007.0013.

Full text

Abstract:

Modal logics have found applications in many diferent contexts. For example, epistemic modal logics can be used to reason about security protocols, temporal modal logics can be used to reason about the correctness of distributed systems and propositional dynamic logic can reason about the correctness of programs. However, pure modal logic is expressively weak and cannot represent many interesting secondorder properties that are expressible, for example, in the μ-calculus. Here we investigate the extension of modal logics with propositional quantification modulo bisimulation (bisimulation quant

APA, Harvard, Vancouver, ISO, and other styles

9

Magossi, José Carlos 1963. "Uma logica modal temporal." [s.n.], 1994. http://repositorio.unicamp.br/jspui/handle/REPOSIP/278664.

Full text

Abstract:

Orientador: Jose Alexandre Durry Guerzoni<br>Dissertação (mestrado) - Universidade Estadual de Campinas, Instituto de Filosofia e Ciencias Humanas<br>Made available in DSpace on 2018-07-19T12:28:05Z (GMT). No. of bitstreams: 1 Magossi_JoseCarlos_M.pdf: 10085958 bytes, checksum: 78f696d242fe4880bc35c9334cf34e9c (MD5) Previous issue date: 1994<br>Resumo: Não informado<br>Abstract: Not informed.<br>Mestrado<br>Mestre em Lógica e Filosofia da Ciência

APA, Harvard, Vancouver, ISO, and other styles

10

Pemmaraju, Sriram V. "Modal logics of provability." Thesis, Virginia Tech, 1989. http://hdl.handle.net/10919/44652.

Full text

Abstract:

<p>Gödel proved his Incompleteness theorems for any theory 'strong' enough to represent recursive functions. In the process he showed that the provability predicate can be represented in such theories. Modal logics of provability are modal logics which attempt to express the concept of 'provability' and 'consistency' using the modal operators '[]' and '<>' respectively. This is achieved by forcing '[]' to behave like the provability predicate. GL is a modal logic which has been shown to be complete and sound with respect to arithmetic theories (theories which can represent all recursive

APA, Harvard, Vancouver, ISO, and other styles

11

Den, Heyer Molly. "The development of a Temporal Logic Model." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 2001. http://www.collectionscanada.ca/obj/s4/f2/dsk3/ftp04/MQ58333.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

12

Gore, Rajeev. "Cut-free sequent and tableau systems for propositional normal modal logics." Thesis, University of Cambridge, 1991. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.239668.

Full text

APA, Harvard, Vancouver, ISO, and other styles

13

Sheridan, Daniel. "Temporal logic encodings for SAT-based bounded model checking." Thesis, University of Edinburgh, 2006. http://hdl.handle.net/1842/1467.

Full text

Abstract:

Since its introduction in 1999, bounded model checking (BMC) has quickly become a serious and indispensable tool for the formal veriﬁcation of hardware designs and, more recently, software. By leveraging propositional satisfiability (SAT) solvers, BMC overcomes some of the shortcomings of more conventional model checking methods. In model checking we automatically verify whether a state transition system (STS) describing a design has some property, commonly expressed in linear temporal logic (LTL). BMC is the restriction to only checking the looping and non-looping runs of the system that have

APA, Harvard, Vancouver, ISO, and other styles

14

Nogueira, Vitor Beires. "Temporal reasoning in a logic programming language with modularity." Doctoral thesis, Universidade de Évora, 2008. http://hdl.handle.net/10174/11138.

Full text

Abstract:

Actualmente os Sistemas de Informação Organizacionais (SIO) lidam cada vez mais com informação que tem dependências temporais. Neste trabalho concebemos um ambiente de trabalho para construir e manter SIO Temporais. Este ambiente assenta sobre um linguagem lógica denominada Temporal Contextua) Logic Programming que integra modularidade com raciocínio temporal fazendo com que a utilização de um módulo dependa do tempo do contexto. Esta linguagem é a evolução de uma outra, também introduzida nesta tese, que combina Contextua) Logic Programming com Temporal Annotated Constraint Logic Programming,

APA, Harvard, Vancouver, ISO, and other styles

15

Vidal, Wandelmer Amanda. "On modal expansions of t-norm based logics with rational constants." Doctoral thesis, Universitat de Barcelona, 2015. http://hdl.handle.net/10803/316575.

Full text

Abstract:

According to Zadeh, the term “fuzzy logic” has two different meanings: wide and narrow. In a narrow sense it is a logical system which aims a formalization of approximate reasoning, and so it can be considered an extension of many-valued logic. However, Zadeh also says that the agenda of fuzzy logic is quite different from that of traditional many-valued logic, as it addresses concepts like linguistic variable, fuzzy if-then rule, linguistic quantifiers etc. Hájek, in the preface of his foundational book Metamathematics of Fuzzy Logic, agrees with Zadeh’s distinction, but stressing that formal

APA, Harvard, Vancouver, ISO, and other styles

16

Wallen, Lincoln A. "Automated proof search in non-classical logics : efficient matrix proof methods for modal and intuitionistic logics." Thesis, University of Edinburgh, 1987. http://hdl.handle.net/1842/6600.

Full text

Abstract:

In this thesis we develop efficient methods for automated proof search within an important class of mathematical logics. The logics considered are the varying, cumulative and constant domain versions of the first-order modal logics K, K4, D, D4, T, S4 and S5, and first-order intuitionistic logic. The use of these non-classical logics is commonplace within Computing Science and Artificial Intelligence in applications in which efficient machine assisted proof search is essential. Traditional techniques for the design of efficient proof methods for classical logic prove to be of limited use in th

APA, Harvard, Vancouver, ISO, and other styles

17

Frittella, Sabine. "Monotone Modal Logic and Friends." Thesis, Aix-Marseille, 2014. http://www.theses.fr/2014AIXM4751/document.

Full text

Abstract:

Cette thèse étudie la théorie de la correspondance et la théorie des preuves pour la logique modale monotone et les logiques qui en sont proches.La première partie de la thèse établit une connexion formelle entre la théorie de la correspondance algorithmique et des résultats de caractérisation duale pour les treillis finis, similaire à la caractérisation par Nation d'une hiérarchie de variétés de treillis qui généralise les treillis distributifs. Cette connexion formelle est établie en utilisant la logique modale monotone. Nous adaptons l'algorithme ALBA pour la correspondance à l'environnemen

APA, Harvard, Vancouver, ISO, and other styles

18

Nair, Vineet, and n/a. "On Extending BDI Logics." Griffith University. School of Information Technology, 2003. http://www4.gu.edu.au:8080/adt-root/public/adt-QGU20030929.095254.

Full text

Abstract:

In this thesis we extend BDI logics, which are normal multimodal logics with an arbitrary set of normal modal operators, from three different perspectives. Firstly, based on some recent developments in modal logic, we examine BDI logics from a combining logic perspective and apply combination techniques like fibring/dovetailing for explaining them. The second perspective is to extend the underlying logics so as to include action constructs in an explicit way based on some recent action-related theories. The third perspective is to adopt a non-monotonic logic like defeasible logic to reason abo

APA, Harvard, Vancouver, ISO, and other styles

19

Gutkovas, Ramūnas. "Languages, Logics, Types and Tools for Concurrent System Modelling." Doctoral thesis, Uppsala universitet, Avdelningen för datalogi, 2016. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-300029.

Full text

Abstract:

A concurrent system is a computer system with components that run in parallel and interact with each other. Such systems are ubiquitous and are notably responsible for supporting the infrastructure for transport, commerce and entertainment. They are very difficult to design and implement correctly: many different modeling languages and verification techniques have been devised to reason about them and verifying their correctness. However, existing languages and techniques can only express a limited range of systems and properties. In this dissertation, we address some of the shortcomings of es

APA, Harvard, Vancouver, ISO, and other styles

20

Banks, Christopher Jon. "Spatio-temporal logic for the analysis of biochemical models." Thesis, University of Edinburgh, 2015. http://hdl.handle.net/1842/10512.

Full text

Abstract:

Process algebra, formal specification, and model checking are all well studied techniques in the analysis of concurrent computer systems. More recently these techniques have been applied to the analysis of biochemical systems which, at an abstract level, have similar patterns of behaviour to concurrent processes. Process algebraic models and temporal logic specifications, along with their associated model-checking techniques, have been used to analyse biochemical systems. In this thesis we develop a spatio-temporal logic, the Logic of Behaviour in Context (LBC), for the analysis of biochemical

APA, Harvard, Vancouver, ISO, and other styles

21

Lenhardt, Rastislav. "Two variable and linear temporal logic in model checking and games." Thesis, University of Oxford, 2013. http://ora.ox.ac.uk/objects/uuid:b4de8937-4a4a-4281-92e7-aa4e93283250.

Full text

Abstract:

Model checking linear-time properties expressed in first-order logic has non-elementary complexity, and thus various restricted logical languages are employed. In the first part of this dissertation we consider two such restricted specification logics on words: linear temporal logic (LTL) and two-variable first-order logic (FO2). LTL is more expressive but FO2 can be more succinct, and hence it is not clear which should be easier to verify. We take a comprehensive look at the issue, giving a comparison of verification problems for FO2, LTL, and various sublogics thereof across a wide range of

APA, Harvard, Vancouver, ISO, and other styles

22

Xu, Ying. "Model checking for a first-order temporal logic using multiway decision graphs." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1999. http://www.collectionscanada.ca/obj/s4/f2/dsk1/tape7/PQDD_0010/NQ52197.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

23

Lars, Lindemann. "Robust Model Predictive Control of Linear Systems under Signal Temporal Logic specifications." Thesis, KTH, Skolan för elektro- och systemteknik (EES), 2016. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-187710.

Full text

Abstract:

Correct-by-construction control systems that fulfill formal specifications are an active research area, especially for motion and task planning of multi-agent systems. Recent methods suffer from state explosion problems which make them inconvenient to use in practice. The framework proposed in this thesis can be seen as an alternative approach by avoiding automata representation and state explosion problems, going back to more classical continuous control theory. This thesis presents a unifying framework consisting of Signal Temporal Logic and a Model Predictive Controller to robustly control

APA, Harvard, Vancouver, ISO, and other styles

24

Nygren, Karl. "Trust Logics and Their Horn Fragments : Formalizing Socio-Cognitive Aspects of Trust." Thesis, Linköpings universitet, Matematik och tillämpad matematik, 2015. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-115251.

Full text

Abstract:

This thesis investigates logical formalizations of Castelfranchi and Falcone's (C&F) theory of trust [9, 10, 11, 12]. The C&F theory of trust defines trust as an essentially mental notion, making the theory particularly well suited for formalizations in multi-modal logics of beliefs, goals, intentions, actions, and time. Three different multi-modal logical formalisms intended for multi-agent systems are compared and evaluated along two lines of inquiry. First, I propose formal definitions of key concepts of the C&F theory of trust and prove some important properties of these defini

APA, Harvard, Vancouver, ISO, and other styles

25

Jeyaraman, Suresh. "Formalising cooperative multi-vehicle team behaviours using Kripke models, temporal logic and model checking." Thesis, Cranfield University, 2006. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.430991.

Full text

APA, Harvard, Vancouver, ISO, and other styles

26

Andrikonis, Julius. "Effective Method to Obtain Terminating Proof-Search in Transitive Multimodal Logics." Doctoral thesis, Lithuanian Academic Libraries Network (LABT), 2011. http://vddb.laba.lt/obj/LT-eLABa-0001:E.02~2011~D_20111227_091412-58067.

Full text

Abstract:

In the dissertation epistemic logics with central agent interaction axiom are analysed. The research covers multimodal logics Kn, Tn, K4n and S4n. The aim of the work is finite derivation search sequent calculi for the mentioned logics. A new method to obtain the termination of derivation search is presented in the thesis and this method is applied to the mentioned logics as well as to monomodal logics K4 and S4.<br>Disertacijoje nagrinėjamos žinių logikos su centrinio agento sąveikos aksioma. Tyrimas apima multimodalines logikas Kn, Tn, K4n ir S4n. Disertacijos tikslas – baigtinės išvedimo pa

APA, Harvard, Vancouver, ISO, and other styles

27

Feng, Yu. "Disjunction of Regular Timing Diagrams." Digital WPI, 2010. https://digitalcommons.wpi.edu/etd-theses/1059.

Full text

Abstract:

"Timing diagrams are used in industrial practice as a specification language of circuit components. They have been formalized for efficient use in model checking. This formalization is often more succinct and convenient than the use of temporal logic. We explore the relationship between timing diagrams and temporal logic formulas by showing that closure under disjunction does not hold for timing diagrams. We give an algorithm that returns a disjunction (if any) of two given timing diagrams. We also give algorithms that decide satisfiability of a timing diagram and return exact time separations

APA, Harvard, Vancouver, ISO, and other styles

28

Perez-Urbina, Hector M. "Tractable query answering for description logics via query rewriting." Thesis, University of Oxford, 2010. http://ora.ox.ac.uk/objects/uuid:cd62cd80-aa62-467b-87cd-4b9d0cfb2dbd.

Full text

Abstract:

We consider the problem of answering conjunctive queries over description logic knowledge bases via query rewriting. Given a conjunctive query Q and a TBox T, we compute a new query Q′ that incorporates the semantic consequences of T such that, for any ABox A, evaluating Q over T and A can be done by evaluating the new query Q′ over A alone. We present RQR—a novel resolution-based rewriting algorithm for the description logic ELHIO¬ that generalizes and extends existing approaches. RQR not only handles a spectrum of logics ranging from DL-Lite_core up to ELHIO¬, but it is worst-case optimal wi

APA, Harvard, Vancouver, ISO, and other styles

29

Mennicke, Roy [Verfasser], Dietrich [Akademischer Betreuer] Kuske, Paul [Akademischer Betreuer] Gastin, and Martin [Akademischer Betreuer] Leucker. "Model Checking Concurrent Systems Using Temporal Logics / Roy Mennicke. Betreuer: Dietrich Kuske. Gutachter: Paul Gastin ; Martin Leucker." Ilmenau : Universitätsbibliothek Ilmenau, 2016. http://d-nb.info/1081935383/34.

Full text

APA, Harvard, Vancouver, ISO, and other styles

30

Mennicke, Roy Verfasser], Dietrich [Akademischer Betreuer] [Kuske, Paul [Akademischer Betreuer] Gastin, and Martin [Akademischer Betreuer] Leucker. "Model Checking Concurrent Systems Using Temporal Logics / Roy Mennicke. Betreuer: Dietrich Kuske. Gutachter: Paul Gastin ; Martin Leucker." Ilmenau : Universitätsbibliothek Ilmenau, 2016. http://nbn-resolving.de/urn:nbn:de:gbv:ilm1-2015000448.

Full text

APA, Harvard, Vancouver, ISO, and other styles

31

Gutierrez, Julian. "On bisimulation and model-checking for concurrent systems with partial order semantics." Thesis, University of Edinburgh, 2011. http://hdl.handle.net/1842/5281.

Full text

Abstract:

In concurrency theory—the branch of (theoretical) computer science that studies the logical and mathematical foundations of parallel computation—there are two main formal ways of modelling the behaviour of systems where multiple actions or events can happen independently and at the same time: either with interleaving or with partial order semantics. On the one hand, the interleaving semantics approach proposes to reduce concurrency to the nondeterministic, sequential computation of the events the system can perform independently. On the other hand, partial order semantics represent concurrency

APA, Harvard, Vancouver, ISO, and other styles

32

Decker, Normann [Verfasser], Martin [Akademischer Betreuer] Leucker, and Javier [Akademischer Betreuer] Esparza. "Model checking for flat systems and temporal logic with counting / Normann Decker ; Akademische Betreuer: Martin Leucker, Javier Esparza." Lübeck : Zentrale Hochschulbibliothek Lübeck, 2021. http://d-nb.info/1225576393/34.

Full text

APA, Harvard, Vancouver, ISO, and other styles

33

Traynard, Pauline. "Model Building by Temporal Logic Constraint Solving : Investigation of the Coupling between the Cell Cycle and the Circadian Clock." Sorbonne Paris Cité, 2016. http://www.theses.fr/2016USPCC087.

Full text

Abstract:

Cette dissertation explore l'utilisation de la logique temporelle et de la vérification de modèle en biologie des systèmes. Nous soutenons que la logique temporalle constitue un outil puissant pour formaliser des propriétés dynamiques à la fois complexes et imprécises permettant de caractériser un système biologique. Cet outil peut être utilisé pour partiellement automatiser la construction de modèle, comme une résolution d'un problème de satisfaction de contraintes. Tout d'abord, nous étudions l'emploi de la logique arborecente (Computation Tree Logic) pour vérifier des propriétés dynamiques

APA, Harvard, Vancouver, ISO, and other styles

34

Huang, Zhongdong. "RULES BASED MODELING OF DISCRETE EVENT SYSTEMS WITH FAULTS AND THEIR DIAGNOSIS." UKnowledge, 2003. http://uknowledge.uky.edu/gradschool_diss/340.

Full text

Abstract:

Failure diagnosis in large and complex systems is a critical task. In the realm of discrete event systems, Sampath et al. proposed a language based failure diagnosis approach. They introduced the diagnosability for discrete event systems and gave a method for testing the diagnosability by first constructing a diagnoser for the system. The complexity of this method of testing diagnosability is exponential in the number of states of the system and doubly exponential in the number of failure types. In this thesis, we give an algorithm for testing diagnosability that does not construct a diagnoser

APA, Harvard, Vancouver, ISO, and other styles

35

Reker, Hilverd Geert. "Tableau-based reasoning for decidable fragments of first-order logic." Thesis, University of Manchester, 2012. https://www.research.manchester.ac.uk/portal/en/theses/tableaubased-reasoning-for-decidable-fragments-of-firstorder-logic(f47e0c7d-399d-48c9-8745-a907c5475f7d).html.

Full text

Abstract:

Automated deduction procedures for modal logics, and related decidable fragments of first-order logic, are used in many real-world applications. A popular way of obtaining decision procedures for these logics is to base them on semantic tableau calculi. We focus on calculi that use unification, instead of the more widely employed approach of generating ground instantiations over the course of a derivation. The most common type of tableaux with unification are so-called free-variable tableaux, where variables are treated as global to the entire tableau. A long-standing open problem for procedur

APA, Harvard, Vancouver, ISO, and other styles

36

To, Anthony Widjaja. "Model checking infinite-state systems : generic and specific approaches." Thesis, University of Edinburgh, 2010. http://hdl.handle.net/1842/4671.

Full text

Abstract:

Model checking is a fully-automatic formal verification method that has been extremely successful in validating and verifying safety-critical systems in the past three decades. In the past fifteen years, there has been a lot of work in extending many model checking algorithms over finite-state systems to finitely representable infinitestate systems. Unlike in the case of finite systems, decidability can easily become a problem in the case of infinite-state model checking. In this thesis, we present generic and specific techniques that can be used to derive decidability with near-optimal comput

APA, Harvard, Vancouver, ISO, and other styles

37

Benghabrit, Walid. "A formal model for accountability." Thesis, Ecole nationale supérieure Mines-Télécom Atlantique Bretagne Pays de la Loire, 2017. http://www.theses.fr/2017IMTA0043/document.

Full text

Abstract:

Nous assistons à la démocratisation des services ducloud et de plus en plus d’utilisateurs (individuels ouentreprises) utilisent ces services dans la vie de tous lesjours. Dans ces scénarios, les données personnellestransitent généralement entre plusieurs entités.L’utilisateur final se doit d’être informé de la collecte, dutraitement et de la rétention de ses donnéespersonnelles, mais il doit aussi pouvoir tenir pourresponsable le fournisseur de service en cas d’atteinte àsa vie privée. La responsabilisation (ou accountability)désigne le fait qu’un système ou une personne estresponsable de ses

APA, Harvard, Vancouver, ISO, and other styles

38

George, Dileep. "How the brain might work : a hierarchical and temporal model for learning and recognition /." May be available electronically:, 2008. http://proquest.umi.com/login?COPT=REJTPTU1MTUmSU5UPTAmVkVSPTI=&clientId=12498.

Full text

APA, Harvard, Vancouver, ISO, and other styles

39

Kimmel, Pierre. "Extensions modales des logiques de ressources : expressivité et calculs." Thesis, Université de Lorraine, 2018. http://www.theses.fr/2018LORR0299/document.

Full text

Abstract:

Le développement de nouveaux formalismes logiques est au cœur de nombreuses problématiques de méthodes formelles. Ces formalismes doivent répondre à la fois à des impératifs de modélisation (ils doivent permettre de décrire certains systèmes) et de calcul (ils doivent fournir des méthodes de calcul correctes et complètes). Dans ce contexte, nous nous intéressons aux logiques de ressources, en particulier les logiques BI et BBI qui traitent du partage et de la séparation de ressources et qui ont conduit aux diverses logiques de séparation dont les applications à la vérification de programmes se

APA, Harvard, Vancouver, ISO, and other styles

40

Ribeiro, Samuel Xavier. "Uma introdução às lógicas clássica e modal e alguns métodos de dedução." reponame:Repositório Institucional da UFABC, 2015.

Find full text

Abstract:

Orientador: Prof. Dr. Vinícius Cifú Lopes<br>Dissertação (mestrado) - Universidade Federal do ABC, Programa de Pós-Graduação em Mestrado Profissional em Matemática em Rede Nacional, 2015.<br>Iniciamos esse trabalho com uma breve introdução histórica para que o leitor tenha uma noção de quando e por que houve interesse em sistematizar os raciocínios lógicos desde Aristóteles até nossos dias. A seguir, apresentamos noções de linguagens, com seus símbolos e regras de formação, sintaxe dos cálculos proposicional e de predicados, funções e operações envolvendo o cálculo de predicados e aplicações (

APA, Harvard, Vancouver, ISO, and other styles

41

Thost, Veronika. "Using Ontology-Based Data Access to Enable Context Recognition in the Presence of Incomplete Information." Doctoral thesis, Saechsische Landesbibliothek- Staats- und Universitaetsbibliothek Dresden, 2017. http://nbn-resolving.de/urn:nbn:de:bsz:14-qucosa-227633.

Full text

Abstract:

Ontology-based data access (OBDA) augments classical query answering in databases by including domain knowledge provided by an ontology. An ontology captures the terminology of an application domain and describes domain knowledge in a machine-processable way. Formal ontology languages additionally provide semantics to these specifications. Systems for OBDA thus may apply logical reasoning to answer queries; they use the ontological knowledge to infer new information, which is only implicitly given in the data. Moreover, they usually employ the open-world assumption, which means that knowledge

APA, Harvard, Vancouver, ISO, and other styles

42

Jha, Sumit Kumar. "Model Validation and Discovery for Complex Stochastic Systems." Research Showcase @ CMU, 2010. http://repository.cmu.edu/dissertations/10.

Full text

Abstract:

In this thesis, we study two fundamental problems that arise in the modeling of stochastic systems: (i) Validation of stochastic models against behavioral specifications such as temporal logics, and (ii) Discovery of kinetic parameters of stochastic biochemical models from behavioral specifications. We present a new Bayesian algorithm for Statistical Model Checking of stochastic systems based on a sequential version of Jeffreys’ Bayes Factor test. We argue that the Bayesian approach is more suited for application do- mains like systems biology modeling, where distributions on nuisance paramete

APA, Harvard, Vancouver, ISO, and other styles

43

Kumar, Rahul. "Using Live Sequence Chart Specifications for Formal Verification." BYU ScholarsArchive, 2008. https://scholarsarchive.byu.edu/etd/1500.

Full text

Abstract:

Formal methods play an important part in the development as well as testing stages of software and hardware systems. A significant and often overlooked part of the process is the development of specifications and correctness requirements for the system under test. Traditionally, English has been used as the specification language, which has resulted in verbose and difficult to use specification documents that are usually abandoned during product development. This research focuses on investigating the use of Live Sequence Charts (LSCs), a graphical and intuitive language directly suited for exp

APA, Harvard, Vancouver, ISO, and other styles

44

Bundala, Daniel. "Algorithmic verification problems in automata-theoretic settings." Thesis, University of Oxford, 2014. https://ora.ox.ac.uk/objects/uuid:60b2d507-153f-4119-a888-56ccd47c3752.

Full text

Abstract:

Problems in formal verification are often stated in terms of finite automata and extensions thereof. In this thesis we investigate several such algorithmic problems. In the first part of the thesis we develop a theory of completeness thresholds in Bounded Model Checking. A completeness threshold for a given model M and a specification φ is a bound k such that, if no counterexample to φ of length k or less can be found in M, then M in fact satisfies φ. We settle a problem of Kroening et al. [KOS<sup>+</sup>11] in the affirmative, by showing that the linearity problem for both regula

APA, Harvard, Vancouver, ISO, and other styles

45

Bakhtiarinoodeh, Zeinab. "The Dynamics of Incomplete and Inconsistent Information : Applications of logic, algebra and coalgebra." Thesis, Université de Lorraine, 2017. http://www.theses.fr/2017LORR0208/document.

Full text

Abstract:

Cette thèse est structurée autour de deux axes d’études : (1) développer des logiques épistémiques formalisant la prise en compte de nouvelles données en présence d'informations incomplètes ou incohérentes ; (2) caractériser les notions de bisimulation sur les modèles de ces nouvelles logiques. Les logiques modales utilisées pour formaliser des raisonnements dans le cadre d’informations incomplètes et incohérentes, telle que la logique modale de contingence, sont généralement plus faibles que les logiques modales standards. Nos travaux se basent sur des méthodes logiques, algébriques et co-alg

APA, Harvard, Vancouver, ISO, and other styles

46

Ho, Hsi-Ming. "Topics in monitoring and planning for embedded real-time systems." Thesis, University of Oxford, 2015. http://ora.ox.ac.uk/objects/uuid:f507756d-8bdc-4b1f-8bbf-214c9997f9c5.

Full text

Abstract:

The verification of real-time systems has gained much interest in the formal verification community during the past two decades. In this thesis, we investigate two real-time verification problems that benefit from the techniques normally used in untimed verification. The first part of this thesis is concerned with the monitoring of real-time specifications. We study the expressiveness of metric temporal logics over timed words, a problem that dates back to early 1990s. We show that the logic obtained by extending Metric Temporal Logic (MTL) with two families of new modalities is expressively c

APA, Harvard, Vancouver, ISO, and other styles

47

Boudou, Joseph. "Procédures de décision pour des logiques modales d'actions, de ressources et de concurrence." Thesis, Toulouse 3, 2016. http://www.theses.fr/2016TOU30145/document.

Full text

Abstract:

Les concepts d'action et de ressource sont omniprésents en informatique. La caractéristique principale d'une action est de changer l'état actuel du système modélisé. Une action peut ainsi être l'exécution d'une instruction dans un programme, l'apprentissage d'un fait nouveau, l'acte concret d'un agent autonome, l'énoncé d'un mot ou encore une tâche planifiée. La caractéristique principale d'une ressource est de pouvoir être divisée, par exemple pour être partagée. Il peut s'agir des cases de la mémoire d'un ordinateur, d'un ensemble d'agents, des différent sens d'une expression, d'intervalles

APA, Harvard, Vancouver, ISO, and other styles

48

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

49

Maquet, Nicolas. "New algorithms and data structures for the emptiness problem of alternating automata." Doctoral thesis, Universite Libre de Bruxelles, 2011. http://hdl.handle.net/2013/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/209961.

Full text

Abstract:

This work studies new algorithms and data structures that are useful in the context of program verification. As computers have become more and more ubiquitous in our modern societies, an increasingly large number of computer-based systems are considered safety-critical. Such systems are characterized by the fact that a failure or a bug (computer error in the computing jargon) could potentially cause large damage, whether in loss of life, environmental damage, or economic damage. For safety-critical systems, the industrial software engineering community increasingly calls for using techniques w

APA, Harvard, Vancouver, ISO, and other styles

50

Gonçalves, Monteiro Pedro Tiago. "Towards an integrative approach for the modeling and formal verification of biological regulatory networks." Thesis, Lyon 1, 2010. http://www.theses.fr/2010LYO10239/document.

Full text

Abstract:

L'étude des grands modèles de réseaux biologiques par l'utilisation d'outils d'analyse et de simulation conduit à un grand nombre de prédictions. Cela soulève la question de savoir comment identifier les prédictions intéressantes de nouveaux phénomènes, qui peuvent être confrontés à des données expérimentales. Les techniques de vérification formelle basées sur le model checking constituent une technologie puissante pour faire face à cette augmentation d'échelle et de complexité pour l'analyse de ces réseaux. L'application de ces techniques est par contre difficile, pour plusieurs raisons. Prem

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!