Bibliographies thématiques / Linear-time Temporal Logic

Littérature scientifique sur le sujet « Linear-time Temporal Logic »

Auteur : Grafiati
Publié le 11 mars 2023

Créez une référence correcte selon les styles APA, MLA, Chicago, Harvard et plusieurs autres

Choisissez une source :

Sommaire

Consultez les listes thématiques d’articles de revues, de livres, de thèses, de rapports de conférences et d’autres sources académiques sur le sujet « Linear-time Temporal Logic ».

À côté de chaque source dans la liste de références il y a un bouton « Ajouter à la bibliographie ». Cliquez sur ce bouton, et nous générerons automatiquement la référence bibliographique pour la source choisie selon votre style de citation préféré : APA, MLA, Harvard, Vancouver, Chicago, etc.

Vous pouvez aussi télécharger le texte intégral de la publication scolaire au format pdf et consulter son résumé en ligne lorsque ces informations sont inclues dans les métadonnées.

Articles de revues sur le sujet "Linear-time Temporal Logic"

1

Henriksen, Jesper G., et P. S. Thiagarajan. « Dynamic linear time temporal logic ». Annals of Pure and Applied Logic 96, no 1-3 (mars 1999) : 187–207. http://dx.doi.org/10.1016/s0168-0072(98)00039-6.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
2

Wansing, Heinrich, et Norihiro Kamide. « Synchronized Linear-Time Temporal Logic ». Studia Logica 99, no 1-3 (31 août 2011) : 365–88. http://dx.doi.org/10.1007/s11225-011-9357-8.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
3

Kamide, Norihiro, et Heinrich Wansing. « A Paraconsistent Linear-time Temporal Logic ». Fundamenta Informaticae 106, no 1 (2011) : 1–23. http://dx.doi.org/10.3233/fi-2011-374.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
4

Frigeri, Achille, Liliana Pasquale et Paola Spoletini. « Fuzzy Time in Linear Temporal Logic ». ACM Transactions on Computational Logic 15, no 4 (août 2014) : 1–22. http://dx.doi.org/10.1145/2629606.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
5

INDRZEJCZAK, ANDRZEJ. « LINEAR TIME IN HYPERSEQUENT FRAMEWORK ». Bulletin of Symbolic Logic 22, no 1 (mars 2016) : 121–44. http://dx.doi.org/10.1017/bsl.2016.2.

Texte intégral
Résumé :
AbstractHypersequent calculus (HC), developed by A. Avron, is one of the most interesting proof systems suitable for nonclassical logics. Although HC has rather simple form, it increases significantly the expressive power of standard sequent calculi (SC). In particular, HC proved to be very useful in the field of proof theory of various nonclassical logics. It may seem surprising that it was not applied to temporal logics so far. In what follows, we discuss different approaches to formalization of logics of linear frames and provide a cut-free HC formalization ofKt4.3, the minimal temporal logic of linear frames, and some of its extensions. The novelty of our approach is that hypersequents are defined not as finite (multi)sets but as finite lists of ordinary sequents. Such a solution allows both linearity of time flow, and symmetry of past and future, to be incorporated by means of six temporal rules (three for future-necessity and three dual rules for past-necessity). Extensions of the basic calculus with simple structural rules cover logics of serial and dense frames. Completeness is proved by Schütte/Hintikka-style argument using models built from saturated hypersequents.
Styles APA, Harvard, Vancouver, ISO, etc.
6

Giero, Mariusz. « The Axiomatization of Propositional Linear Time Temporal Logic ». Formalized Mathematics 19, no 2 (1 janvier 2011) : 113–19. http://dx.doi.org/10.2478/v10037-011-0018-1.

Texte intégral
Résumé :
The Axiomatization of Propositional Linear Time Temporal Logic The article introduces propositional linear time temporal logic as a formal system. Axioms and rules of derivation are defined. Soundness Theorem and Deduction Theorem are proved [9].
Styles APA, Harvard, Vancouver, ISO, etc.
7

Shi, Jianqi, Jiawen Xiong et Yanhong Huang. « General past-time linear temporal logic specification mining ». CCF Transactions on High Performance Computing 3, no 4 (19 octobre 2021) : 393–406. http://dx.doi.org/10.1007/s42514-021-00079-4.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
8

Tonetta, Stefano. « Linear-time Temporal Logic with Event Freezing Functions ». Electronic Proceedings in Theoretical Computer Science 256 (6 septembre 2017) : 195–209. http://dx.doi.org/10.4204/eptcs.256.14.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
9

Fisher, Michael. « A model checker for linear time temporal logic ». Formal Aspects of Computing 4, no 3 (mai 1992) : 299–319. http://dx.doi.org/10.1007/bf01212306.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
10

Jonsson, Bengt, et Tsay Yih-Kuen. « Assumption/guarantee specifications in linear-time temporal logic ». Theoretical Computer Science 167, no 1-2 (1996) : 47–72. http://dx.doi.org/10.1016/0304-3975(96)00069-2.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
Plus de sources

Thèses sur le sujet "Linear-time Temporal Logic"

1

Magnago, Enrico. « Facing infinity in model checking expressive specification languages ». Doctoral thesis, Università degli studi di Trento, 2022. https://hdl.handle.net/11572/356869.

Texte intégral
Résumé :
Society relies on increasingly complex software and hardware systems, hence techniques capable of proving that they behave as expected are of great and growing interest. Formal verification procedures employ mathematically sound reasoning to address this need. This thesis proposes novel techniques for the verification and falsification of expressive specifications on timed and infinite-state systems. An expressive specification language allows the description of the intended behaviour of a system via compact formal statements written at an abstraction level that eases the review process. Falsifying a specification corresponds to identifying an execution of the system that violates the property (i.e. a witness). The capability of identifying witnesses is a key feature in the iterative refinement of the design of a system, since it provides a description of how a certain error can occur. The designer can analyse the witness and take correcting actions by refining either the description of the system or its specification. The contribution of this thesis is twofold. First, we propose a semantics for Metric Temporal Logic that considers four different models of time (discrete, dense, super-discrete and super-dense). We reduce its verification problem to finding an infinite fair execution (witness) for an infinite-state system with discrete time. Second, we define a novel SMT-based algorithm to identify such witnesses. The algorithm employs a general representation of such executions that is both informative to the designer and provides sufficient structure to automate the search of a witness. We apply the proposed techniques to benchmarks taken from software, infinite-state, timed and hybrid systems. The experimental results highlight that the proposed approaches compete and often outperform specific (application tailored) techniques currently used in the state of the art.
Styles APA, Harvard, Vancouver, ISO, etc.
2

Sečkařová, Petra. « Ověřování temporálních vlastností konečných běhů programů ». Master's thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2019. http://www.nusl.cz/ntk/nusl-403176.

Texte intégral
Résumé :
Correct behavior of programs can be defined by their temporal properties. One of the options for formal specification of such properties is  linear temporal logic - LTL . This master's thesis describes design and implementation of a tool for automatic checking of temporal properties of programs, that are specified using Past-Time LTL formulae. The trace of a given program is analyzed in run-time and any violation of given formulae is reported in details to help to find the code location with a root cause of the bug.
Styles APA, Harvard, Vancouver, ISO, etc.
3

Soden, Michael. « Dynamische Modellanalyse von Metamodellen mit operationaler Semantik ». Doctoral thesis, Humboldt-Universität zu Berlin, Mathematisch-Naturwissenschaftliche Fakultät II, 2015. http://dx.doi.org/10.18452/17168.

Texte intégral
Résumé :
Metamodellierung im Sinne der Meta Object Facility (MOF) stellt eine Methode für die strukturelle Definition der abstrakten Syntax von Modellierungssprachen und Modellen im Softwareentwicklungsprozess dar. Um Modellsimulation und dynamische Analysen für metamodellbasierte Sprachen zu unterstützen, fehlt es an einem Kalkül zur operationalen Semantik. In dieser Arbeit wird ausgehend von MOF die Aktionssemantik MActions entwickelt, die die Definition von operationaler Semantik als Verhalten in Metamodellen ermöglicht. Diese Erweiterung geht einher mit der Beschreibung von Laufzeitmodellen sowie Zuständen und Parallelitätseigenschaften, so dass eine Verifikation von dynamischen Eigenschaften möglich wird. Zu diesem Zweck wird mit der Linear Temporal Object Constraint Language (LT-OCL) exemplarisch eine prädikatenlogische Temporallogik entwickelt, die eine metamodellunabhängige Analyse für ausführbare Modelle erlaubt. Dabei ist die Semantik von temporalen Ausdrücken über Zuständsänderungen von (aufgezeichneten) Ausführungsläufen beschrieben, wobei eine Linearisierung parallele Änderungen zusammenführt. Als weiteren Anwendungsfall der dynamischen Analyse untersuchen wir die Relation zum Verhaltensvergleich im Sinne der Bisimulationstheorie. Metamodelle, Aktionssemantik und Temporallogik werden mittels einer erweiterten Abstract State Machine (ASM) formal beschrieben und kommen in zwei Fallstudien zur Anwendung (Timed Automata und C#).
Object-oriented metamodelling as defined by the Meta Object Facility (MOF) provide a means to describe the structure of models and the abstract syntax of modelling languages at various stages in a software development process. However, MOF lacks concepts for the definition of operational semantics and there is no support for dynamic model analysis based on the semantics and abstract states of a language definition. This thesis investigates on extending the metamodelling framework with an action semantics - the MActions - to support the definition of operational semantics in metamodels and enable simulation as well as verification of dynamic properties. For this purpose, runtime models are incorporated with semantics for states, time, and properties of parallelism that allow a generic analysis solely bound to a certain metamodel definition. Furthermore, we develop the Linear Temporal Object Constraint Language (LT-OCL) to perform a dynamic analysis of execution runs based on the executable models. The semantics of this temporal predicate logic is bound to state changes of (recorded) execution traces that are linearizations of parallel changes of the runtimes model. This establishes the link to the theory of bisimulation as a second application case of dynamic analysis. Abstract State Machines (ASM) have been used to formally define the action language in conjunction with metamodels and the temporal logic. As proof of concept of the whole approach, the framework has been implemented and applied to two languages as case studies (namely Timed Automata and C#).
Styles APA, Harvard, Vancouver, ISO, etc.
4

BARBOSA, Ana Emília Victor. « Detecção automática de violações de propriedades de sistemas concorrentes em tempo de execução ». Universidade Federal de Campina Grande, 2007. http://dspace.sti.ufcg.edu.br:8080/jspui/handle/riufcg/1532.

Texte intégral
Résumé :
Submitted by Johnny Rodrigues (johnnyrodrigues@ufcg.edu.br) on 2018-08-22T19:52:23Z No. of bitstreams: 1 ANA EMÍLIA VICTOR BARBOSA - DISSERTAÇÃO PPGCC 2007..pdf: 1669761 bytes, checksum: f47054507fe9200c8d1d56d2848ae276 (MD5)
Made available in DSpace on 2018-08-22T19:52:23Z (GMT). No. of bitstreams: 1 ANA EMÍLIA VICTOR BARBOSA - DISSERTAÇÃO PPGCC 2007..pdf: 1669761 bytes, checksum: f47054507fe9200c8d1d56d2848ae276 (MD5) Previous issue date: 2007-04-20
Capes
Neste trabalho propomos uma técnica que visa detectar violações de propriedades comportamentais automaticamente durante a execução de sistema de software concorrentes. A técnica foi inspirada na metodologia de desenvolvimento Design by Contract (DbC). DbC permite que os desenvolvedores adicionem aos programas asserções para que sejam verificadas em tempo de execução. O uso de asserções para expressar propriedades de programas concorrentes (multithreaded)eparalelos, entretanto,não ésuficiente. Nesses sistemas,muitas das propriedades comportamentais de interesse, como vivacidade e segurança, não podem ser expressas apenas com asserções. Essas propriedades requerem o uso de operadores temporais. Neste trabalho, utilizamos Lógica Linear Temporal (Linear Time Logic - LTL) para expressar o comportamento desejado. Para dar suporte a checagem do comportamento dos programas em tempo de execução, propomos uma técnica baseada em Programação Orientada a Aspectos, que permite que o programa seja continuamente monitorado (o comportamento é checado através do uso de autômatos que permite a deteção de comportamentos inesperados). Associada a cada propriedade comportamental existe um conjunto de pontos de interesse do código-fonte que devem obedece-la. Esses pontos são então monitorados durante a execução do sistema através do uso de aspectos. Entre outros benefícios, a técnica permite que o sistema de software alvo seja instrumentado de maneira não intrusiva, sem alterar o código-fonte — particulamente, nenhum código do software alvo deve ser modificado para execução da monitoração. Para validar este trabalho, desenvolvemos como prova de conceitos um protótipo que implementa a técnica e permite a monitoração de programas Java multi-threaded, chamado DesignMonitor. Essa ferramenta é apresentada e discutida através de um estudo de caso para demonstrar a aplicação da técnica
In this work we propose and develop a technique that allows to detect the violation of behavior properties of concurrent systems. The technique was inspired by the Design by Contract (DbC) programming methodology, which proposes the use of assertions and their evaluation at runtime to check programs behavior. The use of simple assertions to express properties of concurrent and parallel programs, however, is not sufficient. Many of the relevant properties of those systems,s uch as liveness and security, can not be expressed with simple assertions. Thesepropertiesrequiretheuseof temporal operators. In our work, we used Linear Time Logic (LTL) to specify the expected behavior. To support the runtime checking of the program against the expected behavior, we propose a technique, based on Aspect-Oriented Programming, that allows the program to be continuously monitored (behavior is checked against automata that allows the detection of unexpected behaviors). Each property is mapped to a set of points of interest in the target program. Those points are then monitored during the system execution through aspects. Among other benefits, the technique allows the instrumentation of the target software to be performed automatically and in a non-intrusive way — in particular, no code must be changed toturn monitoring on or off. To validate the work, we developed a proof of concept prototype tool that implements the technique and allows the monitoring of multi-threaded Java programs, called DesignMonitor. The tool was used in case study that has allowed the evaluation and the discussion of practical issues related with the technique.
Styles APA, Harvard, Vancouver, ISO, etc.
5

Ludwig, Michel. « Resolution-based methods for linear-time temporal logics : with applications to formal verification ». Thesis, University of Liverpool, 2010. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.533985.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
6

Kyrilov, Angelo. « Tableau-based decision procedure for linear time temporal logic : implementation, testing, performance analysis and optimisation ». Thesis, 2011. http://hdl.handle.net/10539/10075.

Texte intégral
Résumé :
This thesis reports on the implementation and experimental analysis of an incremental multi-pass tableau-based procedure a la Wolper for testing satis- ability in the linear time temporal logic LTL, based on a breadth- rst search strategy. I describe the implementation and discuss the performance of the tool on several series of pattern formulae, as well as on some random test sets, and compare its performance with an implementation of Schwendimann's one- pass tableaux by Widmann and Gor e on several representative series of pattern formulae, including eventualities and safety patterns. The experiments have established that Schwendimann's algorithm consistently, and sometimes dra- matically, outperforms the incremental tableaux, despite the fact that the the- oretical worst-case upper-bound of Schwendimann's algorithm, 2EXPTIME, is worse than that of Wolper's algorithm, which is EXPTIME. This shows, once again, that theoretically established worst-case complexity results do not always re ect truly the practical e ciency, at least when comparing decision procedures.
Styles APA, Harvard, Vancouver, ISO, etc.
7

Haydar, May. « A formal framework for run-time verification of Web applications : an approach supported by ccope-extended linear temporal logic ». Thèse, 2007. http://hdl.handle.net/1866/17888.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.

Livres sur le sujet "Linear-time Temporal Logic"

1

Stirling, Colin. Comparing linear and branching time temporal logics. Edinburgh : University of Edinburgh, Laboratory for Foundations in Computer Science, 1987.

Trouver le texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.

Chapitres de livres sur le sujet "Linear-time Temporal Logic"

1

Stirling, Colin. « Comparing linear and branching time temporal logics ». Dans Temporal Logic in Specification, 1–20. Berlin, Heidelberg : Springer Berlin Heidelberg, 1989. http://dx.doi.org/10.1007/3-540-51803-7_19.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
2

Emerson, E. Allen, et Jai Srinivasan. « Branching time temporal logic ». Dans Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, 123–72. Berlin, Heidelberg : Springer Berlin Heidelberg, 1989. http://dx.doi.org/10.1007/bfb0013022.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
3

Kuiper, Ruurd. « Enforcing nondeterminism via linear time temporal logic specifications using hiding ». Dans Temporal Logic in Specification, 295–303. Berlin, Heidelberg : Springer Berlin Heidelberg, 1989. http://dx.doi.org/10.1007/3-540-51803-7_31.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
4

Leucker, Martin. « Runtime Verification for Linear-Time Temporal Logic ». Dans Engineering Trustworthy Software Systems, 151–94. Cham : Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-56841-6_5.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
5

Finkbeiner, Bernd, et Hazem Torfah. « Counting Models of Linear-Time Temporal Logic ». Dans Language and Automata Theory and Applications, 360–71. Cham : Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-04921-2_29.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
6

Tsay, Yih-Kuen. « Compositional Verification in Linear-Time Temporal Logic ». Dans Lecture Notes in Computer Science, 344–58. Berlin, Heidelberg : Springer Berlin Heidelberg, 2000. http://dx.doi.org/10.1007/3-540-46432-8_23.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
7

Bolotov, Alexander, Artie Basukoski, Oleg Grigoriev et Vasilyi Shangin. « Natural Deduction Calculus for Linear-Time Temporal Logic ». Dans Logics in Artificial Intelligence, 56–68. Berlin, Heidelberg : Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11853886_7.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
8

Kaivola, Roope. « Compositional model checking for linear-time temporal logic ». Dans Computer Aided Verification, 248–59. Berlin, Heidelberg : Springer Berlin Heidelberg, 1993. http://dx.doi.org/10.1007/3-540-56496-9_20.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
9

Bian, Ji, Tim French et Mark Reynolds. « An Efficient Tableau for Linear Time Temporal Logic ». Dans Lecture Notes in Computer Science, 289–300. Cham : Springer International Publishing, 2013. http://dx.doi.org/10.1007/978-3-319-03680-9_31.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
10

Schmitt, Peter H., et Jean Goubault-Larrecq. « A tableau system for linear-TIME temporal logic ». Dans Tools and Algorithms for the Construction and Analysis of Systems, 130–44. Berlin, Heidelberg : Springer Berlin Heidelberg, 1997. http://dx.doi.org/10.1007/bfb0035385.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.

Actes de conférences sur le sujet "Linear-time Temporal Logic"

1

Leucker, Martin, et Cesar Sanchez. « Regular Linear-Time Temporal Logic ». Dans 2010 17th International Symposium on Temporal Representation and Reasoning (TIME). IEEE, 2010. http://dx.doi.org/10.1109/time.2010.29.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
2

Bollig, Benedikt, Normann Decker et Martin Leucker. « Frequency Linear-time Temporal Logic ». Dans 2012 Sixth International Symposium on Theoretical Aspects of Software Engineering (TASE). IEEE, 2012. http://dx.doi.org/10.1109/tase.2012.43.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
3

Meng, Ruijie, Zhen Dong, Jialin Li, Ivan Beschastnikh et Abhik Roychoudhury. « Linear-time temporal logic guided greybox fuzzing ». Dans ICSE '22 : 44th International Conference on Software Engineering. New York, NY, USA : ACM, 2022. http://dx.doi.org/10.1145/3510003.3510082.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
4

Bolotov, Alexander, Oleg Grigoriev et Vasilyi Shangin. « Automated Natural Deduction for Propositional Linear-Time Temporal Logic ». Dans 14th International Symposium on Temporal Representation and Reasoning (TIME'07). IEEE, 2007. http://dx.doi.org/10.1109/time.2007.41.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
5

Mikulas, Szabolcs, Mark Reynolds et Tim French. « Axiomatizations for Temporal Epistemic Logic with Perfect Recall over Linear Time ». Dans 2009 16th International Symposium on Temporal Representation and Reasoning (TIME). IEEE, 2009. http://dx.doi.org/10.1109/time.2009.18.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
6

Giordano, L., et A. Martelli. « On-the-fly automata construction for dynamic linear time temporal logic ». Dans Proceedings. 11th International Symposium on Temporal Representation and Reasoning, 2004. TIME 2004. IEEE, 2004. http://dx.doi.org/10.1109/time.2004.1314430.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
7

« ACTIVE MONITORING USING REAL-TIME METRIC LINEAR TEMPORAL LOGIC SPECIFICATIONS ». Dans International Conference on Health Informatics. SciTePress - Science and and Technology Publications, 2012. http://dx.doi.org/10.5220/0003768703700373.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
8

Rungger, Matthias, Manuel Mazo et Paulo Tabuada. « Specification-guided controller synthesis for linear systems and safe linear-time temporal logic ». Dans the 16th international conference. New York, New York, USA : ACM Press, 2013. http://dx.doi.org/10.1145/2461328.2461378.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
9

Lesire, Charles, Stephanie Roussel, David Doose et Christophe Grand. « Synthesis of Real-Time Observers from Past-Time Linear Temporal Logic and Timed Specification ». Dans 2019 International Conference on Robotics and Automation (ICRA). IEEE, 2019. http://dx.doi.org/10.1109/icra.2019.8793754.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
10

Wikatama, Muhammad Fikri Suyudi, Muhammad Arzaki et Yanti Rusmawati. « Verifying Vaccine Supply Chain System in Indonesia Using Linear-Time Temporal Logic ». Dans 2018 6th International Conference on Information and Communication Technology (ICoICT). IEEE, 2018. http://dx.doi.org/10.1109/icoict.2018.8528743.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.

Rapports d'organisations sur le sujet "Linear-time Temporal Logic"

1

Borgwardt, Stefan, Marcel Lippmann et Veronika Thost. Reasoning with Temporal Properties over Axioms of DL-Lite. Technische Universität Dresden, 2014. http://dx.doi.org/10.25368/2022.208.

Texte intégral
Résumé :
Recently, a lot of research has combined description logics (DLs) of the DL-Lite family with temporal formalisms. Such logics are proposed to be used for situation recognition and temporalized ontology-based data access. In this report, we consider DL-Lite-LTL, in which axioms formulated in a member of the DL-Lite family are combined using the operators of propositional linear-time temporal logic (LTL). We consider the satisfiability problem of this logic in the presence of so-called rigid symbols whose interpretation does not change over time. In contrast to more expressive temporalized DLs, the computational complexity of this problem is the same as for LTL, even w.r.t. rigid symbols.
Styles APA, Harvard, Vancouver, ISO, etc.
2

Baader, Franz, Silvio Ghilardi et Carsten Lutz. LTL over Description Logic Axioms. Technische Universität Dresden, 2008. http://dx.doi.org/10.25368/2022.164.

Texte intégral
Résumé :
Most of the research on temporalized Description Logics (DLs) has concentrated on the case where temporal operators can occur within DL concept descriptions. In this setting, reasoning usually becomes quite hard if rigid roles, i.e., roles whose interpretation does not change over time, are available. In this paper, we consider the case where temporal operators are allowed to occur only in front of DL axioms (i.e., ABox assertions and general concept inclusion axioms), but not inside of concepts descriptions. As the temporal component, we use linear temporal logic (LTL) and in the DL component we consider the basic DL ALC. We show that reasoning in the presence of rigid roles becomes considerably simpler in this setting.
Styles APA, Harvard, Vancouver, ISO, etc.
3

Baader, Franz, et Marcel Lippmann. Runtime Verification Using a Temporal Description Logic Revisited. Technische Universität Dresden, 2014. http://dx.doi.org/10.25368/2022.203.

Texte intégral
Résumé :
Formulae of linear temporal logic (LTL) can be used to specify (wanted or unwanted) properties of a dynamical system. In model checking, the system’s behaviour is described by a transition system, and one needs to check whether all possible traces of this transition system satisfy the formula. In runtime verification, one observes the actual system behaviour, which at any point in time yields a finite prefix of a trace. The task is then to check whether all continuations of this prefix to a trace satisfy (violate) the formula. More precisely, one wants to construct a monitor, i.e., a finite automaton that receives the finite prefix as input and then gives the right answer based on the state currently reached. In this paper, we extend the known approaches to LTL runtime verification in two directions. First, instead of propositional LTL we use the more expressive temporal logic ALC-LTL, which can use axioms of the Description Logic (DL) ALC instead of propositional variables to describe properties of single states of the system. Second, instead of assuming that the observed system behaviour provides us with complete information about the states of the system, we assume that states are described in an incomplete way by ALC-knowledge bases. We show that also in this setting monitors can effectively be constructed. The (double-exponential) size of the constructed monitors is in fact optimal, and not higher than in the propositional case. As an auxiliary result, we show how to construct Büchi automata for ALC-LTL-formulae, which yields alternative proofs for the known upper bounds of deciding satisfiability in ALC-LTL.
Styles APA, Harvard, Vancouver, ISO, etc.
4

Bourgaux, Camille, et Anni-Yasmin Turhan. Temporal Query Answering in DL-Lite over Inconsistent Data. Technische Universität Dresden, 2017. http://dx.doi.org/10.25368/2022.236.

Texte intégral
Résumé :
In ontology-based systems that process data stemming from different sources and that is received over time, as in context-aware systems, reasoning needs to cope with the temporal dimension and should be resilient against inconsistencies in the data. Motivated by such settings, this paper addresses the problem of handling inconsistent data in a temporal version of ontology-based query answering. We consider a recently proposed temporal query language that combines conjunctive queries with operators of propositional linear temporal logic and extend to this setting three inconsistency-tolerant semantics that have been introduced for querying inconsistent description logic knowledge bases. We investigate their complexity for DL-LiteR temporal knowledge bases, and furthermore complete the picture for the consistent case.
Styles APA, Harvard, Vancouver, ISO, etc.
5

Thost, Veronika, Jan Holste et Özgür Özçep. On Implementing Temporal Query Answering in DL-Lite. Technische Universität Dresden, 2015. http://dx.doi.org/10.25368/2022.218.

Texte intégral
Résumé :
Ontology-based data access augments classical query answering over fact bases by adopting the open-world assumption and by including domain knowledge provided by an ontology. We implemented temporal query answering w.r.t. ontologies formulated in the Description Logic DL-Lite. Focusing on temporal conjunctive queries (TCQs), which combine conjunctive queries via the operators of propositional linear temporal logic, we regard three approaches for answering them: an iterative algorithm that considers all data available; a window-based algorithm; and a rewriting approach, which translates the TCQs to be answered into SQL queries. Since the relevant ontological knowledge is already encoded into the latter queries, they can be answered by a standard database system. Our evaluation especially shows that implementations of both the iterative and the window-based algorithm answer TCQs within a few milliseconds, and that the former achieves a constant performance, even if data is growing over time.
Styles APA, Harvard, Vancouver, ISO, etc.
6

Baader, Franz, Stefan Borgwardt, Patrick Koopmann, Ana Ozaki et Veronika Thost. Metric Temporal Description Logics with Interval-Rigid Names (Extended Version). Technische Universität Dresden, 2017. http://dx.doi.org/10.25368/2022.233.

Texte intégral
Résumé :
In contrast to qualitative linear temporal logics, which can be used to state that some property will eventually be satisfied, metric temporal logics allow to formulate constraints on how long it may take until the property is satisfied. While most of the work on combining Description Logics (DLs) with temporal logics has concentrated on qualitative temporal logics, there has recently been a growing interest in extending this work to the quantitative case. In this paper, we complement existing results on the combination of DLs with metric temporal logics over the natural numbers by introducing interval-rigid names. This allows to state that elements in the extension of certain names stay in this extension for at least some specified amount of time.
Styles APA, Harvard, Vancouver, ISO, etc.
Vous pouvez également être intéressé par les bibliographies sur le sujet « Linear-time Temporal Logic » pour d’autres types de sources :
Articles de revues
Nous offrons des réductions sur tous les plans premium pour les auteurs dont les œuvres sont incluses dans des sélections littéraires thématiques. Contactez-nous pour obtenir un code promo unique!

Vers la bibliographie