Relevant bibliographies by topics / Temporal logic

Academic literature on the topic 'Temporal logic'

Author: Grafiati
Published: 4 June 2021
Last updated: 16 September 2023

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

Select a source type:

Contents

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic '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.

Journal articles on the topic "Temporal logic"

1

Uckelman, Sara L., and Spencer Johnston. "John Buridan’s Sophismata and Interval Temporal Semantics." History of Philosophy and Logical Analysis 13, no. 1 (April 5, 2010): 131–47. http://dx.doi.org/10.30965/26664275-01301009.

Full text
Abstract:
In this paper we look at the suitability of modern interval-based temporal logic for modeling John Buridan’s treatment of tensed sentences in his Sophismata. Building on the paper (Øhrstrøm 1984), we develop Buridan’s analysis of temporal logic, paying particular attention to his notions of negation and the absolute/relative nature of the future and the past.We introduce a number of standard modern propositional interval temporal logics (ITLs) to illustrate where Buridan’s interval-based temporal analysis differs from the standard modern approaches. We give formal proofs of some claims in (Øhrstrøm 1984), and sketch how the standard modern systems could be defined in terms of Buridan’s proposals, showing that his logic can be taken as more basic. In diesem Aufsatz betrachten wir das Geeignetsein einer modernen intervallbasierten temporalen Logik für die Modellierung von John Buridans Behandlung zeitabhängiger Sätze in seinen Sophismata. Aufbauend auf den Aufsatz (Øhrstrøm 1984) stellen wir Buridans Analyse der temporalen Logik dar, mit besonderer Berücksichtigung seiner Begriffe der Negation und der absoluten/relativen Natur der Zukunft und der Vergangenheit. Wir führen einige standardmäßige moderne intervallbasierte temporale Aussagenlogiken (ITLs) ein, um zu illustrieren, wo Buridans intervallbasierte temporale Analyse von den standardmäßigen modernen Zugangsweisen abweicht. Wir geben formale Beweise einiger Behauptungen in (Øhrstrøm 1984) an und skizzieren, wie die standardmäßigen modernen Systeme im Sinne der Vorschläge Buridans definiert werden könnten; wir zeigen damit, dass seine Logik als die grundlegendere aufgefasst werden kann.
APA, Harvard, Vancouver, ISO, and other styles
2

Trzęsicki, Kazimierz. "Indeterministic Temporal Logic." Studies in Logic, Grammar and Rhetoric 42, no. 1 (September 1, 2015): 139–62. http://dx.doi.org/10.1515/slgr-2015-0034.

Full text
Abstract:
Abstract The questions od determinism, causality, and freedom have been the main philosophical problems debated since the beginning of temporal logic. The issue of the logical value of sentences about the future was stated by Aristotle in the famous tomorrow sea-battle passage. The question has inspired Łukasiewicz’s idea of many-valued logics and was a motive of A. N. Prior’s considerations about the logic of tenses. In the scheme of temporal logic there are different solutions to the problem. In the paper we consider indeterministic temporal logic based on the idea of temporal worlds and the relation of accessibility between them.
APA, Harvard, Vancouver, ISO, and other styles
3

Long, Derek. "A review of temporal logics." Knowledge Engineering Review 4, no. 2 (June 1989): 141–62. http://dx.doi.org/10.1017/s0269888900004896.

Full text
Abstract:
AbstractA series of temporal reasoning tasks are identified which motivate the consideration and application of temporal logics in artificial intelligence. There follows a discussion of the broad issues involved in modelling time and constructing a temporal logic. The paper then presents a detailed review of the major approaches to temporal logics: first-order logic approaches, modal temporal logics and reified temporal logics. The review considers the most significant exemplars within the various approaches, including logics due to Russell, Hayes and McCarthy, Prior, McDermott, Allen, Kowalski and Sergot. The logics are compared and contrasted, particularly in their treatments of change and action, the roles they seek to fulfil and the underlying models of time on which they rest. The paper concludes with a brief consideration of the problem of granularity—a problem of considerable significance in temporal reasoning, which has yet to be satisfactorily treated in a temporal logic.
APA, Harvard, Vancouver, ISO, and other styles
4

von KARGER, BURGHARD. "Temporal algebra." Mathematical Structures in Computer Science 8, no. 3 (June 1998): 277–320. http://dx.doi.org/10.1017/s0960129598002540.

Full text
Abstract:
We develop temporal logic from the theory of complete lattices, Galois connections and fixed points. In particular, we prove that all seventeen axioms of Manna and Pnueli's sound and complete proof system for linear temporal logic can be derived from just two postulates, namely that ([oplus ], &[ominus ]tilde;) is a Galois connection and that ([ominus ], [oplus ]) is a perfect Galois connection. We also obtain a similar result for the branching time logic CTL.A surprising insight is that most of the theory can be developed without the use of negation. In effect, we are studying intuitionistic temporal logic. Several examples of such structures occurring in computer science are given. Finally, we show temporal algebra at work in the derivation of a simple graph-theoretic algorithm.This paper is tutorial in style and there are no difficult technical results. To the experts in temporal logics, we hope to convey the simplicity and beauty of algebraic reasoning as opposed to the machine-orientedness of logical deduction. To those familiar with the calculational approach to programming, we want to show that their methods extend easily and smoothly to temporal reasoning. For anybody else, this text may serve as a gentle introduction to both areas.
APA, Harvard, Vancouver, ISO, and other styles
5

Uckelman, Sara L. "A Quantified Temporal Logic for Ampliation and Restriction." Vivarium 51, no. 1-4 (2013): 485–510. http://dx.doi.org/10.1163/15685349-12341259.

Full text
Abstract:
Abstract Temporal logic as a modern discipline is separate from classical logic; it is seen as an addition or expansion of the more basic propositional and predicate logics. This approach is in contrast with logic in the Middle Ages, which was primarily intended as a tool for the analysis of natural language. Because all natural language sentences have tensed verbs, medieval logic is inherently a temporal logic. This fact is most clearly exemplified in medieval theories of supposition. As a case study, we look at the supposition theory of Lambert of Lagny (Auxerre), extracting from it a temporal logic and providing a formalization of that logic.
APA, Harvard, Vancouver, ISO, and other styles
6

Zhang, Nan, Zhenhua Duan, and Cong Tian. "Unified temporal logic." Theoretical Computer Science 864 (April 2021): 58–69. http://dx.doi.org/10.1016/j.tcs.2021.02.007.

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

Bucheli, Samuel, Meghdad Ghari, and Thomas Studer. "Temporal Justification Logic." Electronic Proceedings in Theoretical Computer Science 243 (March 6, 2017): 59–74. http://dx.doi.org/10.4204/eptcs.243.5.

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

van Glabbeek, Rob. "Reactive Temporal Logic." Electronic Proceedings in Theoretical Computer Science 322 (August 27, 2020): 51–68. http://dx.doi.org/10.4204/eptcs.322.6.

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

Abadi, Martín, and Zohar Manna. "Temporal logic programming." Journal of Symbolic Computation 8, no. 3 (September 1989): 277–95. http://dx.doi.org/10.1016/s0747-7171(89)80070-7.

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

Garanina, Natalia Olegovna, Igor Sergeevich Anureev, Vladimir Evgenyevich Zyubin, Sergey Mikhailovich Staroletov, Tatiana Victorovna Liakh, Andrey Sergeevich Rozov, and Sergei Petrovich Gorlatch. "Temporal Logic for Programmable Logic Controllers." Modeling and Analysis of Information Systems 27, no. 4 (December 20, 2020): 412–27. http://dx.doi.org/10.18255/1818-1015-2020-4-412-427.

Full text
Abstract:
We address the formal verification of the control software of critical systems, i.e., ensuring the absence of design errors in a system with respect to requirements. Control systems are usually based on industrial controllers, also known as Programmable Logic Controllers (PLCs). A specific feature of a PLC is a scan cycle: 1) the inputs are read, 2) the PLC states change, and 3) the outputs are written. Therefore, in order to formally verify PLC, e.g., by model checking, it is necessary to describe the transition system taking into account this specificity and reason both in terms of state transitions within a cycle and in terms of larger state transitions according to the scan-cyclic semantics. We propose a formal PLC model as a hyperprocess transition system and temporal cycle-LTL logic based on LTL logic for formulating PLC property. A feature of the cycle-LTL logic is the possibility of viewing the scan cycle in two ways: as the effect of the environment (in particular, the control object) on the control system and as the effect of the control system on the environment. For both cases we introduce modified LTL temporal operators. We also define special modified LTL temporal operators to specify inside properties of scan cycles. We describe the translation of formulas of cycle-LTL into formulas of LTL, and prove its correctness. This implies the possibility ofmodel checking requirements expressed in logic cycle-LTL, by using well-known model checking tools with LTL as specification logic, e.g., Spin. We give the illustrative examples of requirements expressed in the cycle-LTL logic.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Temporal logic"

1

Sack, Joshua. "Adding temporal logic to dynamic epistemic logic." [Bloomington, Ind.] : Indiana University, 2007. http://gateway.proquest.com/openurl?url_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:dissertation&res_dat=xri:pqdiss&rft_dat=xri:pqdiss:3274928.

Full text
Abstract:
Thesis (Ph.D.)--Indiana University, Dept. of Mathematics, 2007.
Source: Dissertation Abstracts International, Volume: 68-07, Section: B, page: 4531. Adviser: Lawrence Moss. Title from dissertation home page (viewed Apr. 22, 2008).
APA, Harvard, Vancouver, ISO, and other styles
2

Gustafsson, Joakim. "Extending temporal action logic /." Linköping : Univ, 2001. http://www.bibl.liu.se/liupubl/disp/disp2001/tek689s.pdf.

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

Hale, Roger William Stephen. "Programming in temporal logic." Thesis, University of Cambridge, 1988. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.305467.

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

Oberholzer, Johannes Francois. "Agent Interval Temporal Logic." Diss., University of Pretoria, 2020. http://hdl.handle.net/2263/74826.

Full text
Abstract:
Alternating-Time Temporal Logic (ATL), introduced by Alur, Henzinger and Kupferman, is a logic involving coalitions of agents performing actions which cause a state change in a turn-based time system. There have been game theoretic ex- tensions on ATL, and they are very good at specifying systems of multiple agents cooperating or competing in a game-like situation. Unfortunately neither ATL nor its extensions are able to capture the idea of gradual change, or duration of actions or events. The concurrent game model of ATL operates like a turn based game, with sets of agents taking their turn, and then the environment changing based on their actions, before they take their next turn. The fact that some actions take longer than others, or that sometimes a state changes gradually, rather than immediately, is not representable in ATL. As an example, take a train entering a tunnel. Before the train enters the tunnel, it is outside the tunnel, after it has entered the tunnel, it is inside the tunnel, but for the few seconds it takes the train to enter the tunnel, it is neither inside nor outside the tunnel. ATL cannot represent this basic intuitive truth. A family of logics called Interval Logic (IL) use finite state sequences called “intervals”, which allow it to describe a more continuous model of time, rather than a discrete state based one such as ATL. This allows it to capture the idea of gradual change, of a train entering a tunnel, and the fact that actions and events have various durations. Most of the IL formulations do however not have any way of distinguishing multiple agents acting at the same time. Both of these logics - ATL and IL - are useful for specific things, but combining them might produce new applications which are not possible when only using the one or the other. In this dissertation we present one such possible combination, called Agent Interval Temporal Logic (AITL). AITL combines the notion of agents, coalitions and strategies from ATL with the interval based model of time from IL, thus creating a new logic which might have some powerful applications in a wide range of areas in which gradual change and multiple agents acting at the same time can both be accommodated.
Dissertation (MA)--University of Pretoria, 2020.
Centre for Artificial Intelligence Research at CSIR
Philosophy
MA
Unrestricted
APA, Harvard, Vancouver, ISO, and other styles
5

Duan, Zhenhua. "An extended interval temporal logic and a framing technique for temporal logic programming." Thesis, University of Newcastle Upon Tyne, 1996. http://hdl.handle.net/10443/2075.

Full text
Abstract:
Temporal logic programming is a paradigm for specification and verification of concurrent programs in which a program can be written, and the properties of the program can be described and verified in a same notation. However, there are many aspects of programming in temporal logics that are not well-understood. One such an aspect is concurrent programming, another is framing and the third is synchronous communication for parallel processes. This thesis extends the original Interval Temporal Logic (ITL) to include infinite models, past operators, and a new projection operator for dealing with concurrent computation, synchronous communication, and framing in the context of temporal logic programming. The thesis generalizes the original ITL to include past operators such as previous and past chop, and extends the model to include infinite intervals. A considerable collection of logic laws regarding both propositional and first order logics is formalized and proved within model theory. After that, a subset of the extended ITL is formalized as a programming language, called extended Tempura. These extensions, as in their logic basis, include infinite models, the previous operator, projection and framing constructs. A normal form for programs within the extended Tempura is demonstrated. Next, a new projection operator is introduced. In the new construct, the sub-processes are autonomous; each process has the right to specify its own interval over which it is executed. The thesis presents a framing technique for temporal logic programming, which includes the definitions of new assignments, the assignment flag and the framing operator, the formalization of algebraic properties of the framing operator, the minimal model semantics of framed programs, as well as an executable framed interpreter. The synchronous communication operator await is based directly on the proposed framing technique. It enables us to deal with concurrent computation. Based on EITL and await operator, a framed concurrent temporal logic programming language, FTLL, is formally defined within EITL. Finally, the thesis describes a framed interpreter for the extended Tempura which has been developed in SICSTUS prolog. In the new interpreter, the implementation of new assignments, the frame operator, the await operator, and the new projection operator are all included.
APA, Harvard, Vancouver, ISO, and other styles
6

Boretti, B. "Proof Analysis in Temporal Logic." Doctoral thesis, Università degli Studi di Milano, 2009. http://hdl.handle.net/2434/64477.

Full text
Abstract:
The logic of time is one of the most interesting modal logics, and its importance is widely acknowledged both for philosophical and formal reasons. In this thesis, we apply the method of internalisation of Kripke-style semantics into the syntax of sequent calculus to the proof-theoretical analysis of temporal logics. Sequent systems for different flows of time are obtained as modular extensions of a basic temporal calculus, through the addition of appropriate mathematical rules that correspond to the properties of temporal frames: a general and uniform treatment is thus achieved for a wide range of temporal logics. All the calculi enjoy remarkable structural properties, in particular are contraction and cut free. Linear discrete time is analysed by means of two infinitary calculi. The first is obtained by means of a rule with infinitely many premises, and the second through a new definition of provability which admits, under certain conditions, derivation trees with infinite branches. The first calculus enjoys the desired structural properties, but the presence of an infinitary rule is harmful for proof analysis. Two finitary systems are identified by replacing the infinitary rule with a weaker finitary rule, and by bounding the number of its premises, respectively. Corresponding, somehow complementary, conservativity results are proved with respect to adequate fragments of the original calculus. The second calculus stems from a closure algorithm which exploits the fixed-point equations for temporal operators and gives saturated sets of closure formulas from a given formula. Finitisation is obtained in the form of an upper bound to the proof-search procedure, and decidability follows as a major consequence.
APA, Harvard, Vancouver, ISO, and other styles
7

Weidner, Thomas. "Probabilistic Logic, Probabilistic Regular Expressions, and Constraint Temporal Logic." Doctoral thesis, Universitätsbibliothek Leipzig, 2016. http://nbn-resolving.de/urn:nbn:de:bsz:15-qucosa-208732.

Full text
Abstract:
The classic theorems of Büchi and Kleene state the expressive equivalence of finite automata to monadic second order logic and regular expressions, respectively. These fundamental results enjoy applications in nearly every field of theoretical computer science. Around the same time as Büchi and Kleene, Rabin investigated probabilistic finite automata. This equally well established model has applications ranging from natural language processing to probabilistic model checking. Here, we give probabilistic extensions Büchi\\\'s theorem and Kleene\\\'s theorem to the probabilistic setting. We obtain a probabilistic MSO logic by adding an expected second order quantifier. In the scope of this quantifier, membership is determined by a Bernoulli process. This approach turns out to be universal and is applicable for finite and infinite words as well as for finite trees. In order to prove the expressive equivalence of this probabilistic MSO logic to probabilistic automata, we show a Nivat-theorem, which decomposes a recognisable function into a regular language, homomorphisms, and a probability measure. For regular expressions, we build upon existing work to obtain probabilistic regular expressions on finite and infinite words. We show the expressive equivalence between these expressions and probabilistic Muller-automata. To handle Muller-acceptance conditions, we give a new construction from probabilistic regular expressions to Muller-automata. Concerning finite trees, we define probabilistic regular tree expressions using a new iteration operator, called infinity-iteration. Again, we show that these expressions are expressively equivalent to probabilistic tree automata. On a second track of our research we investigate Constraint LTL over multidimensional data words with data values from the infinite tree. Such LTL formulas are evaluated over infinite words, where every position possesses several data values from the infinite tree. Within Constraint LTL on can compare these values from different positions. We show that the model checking problem for this logic is PSPACE-complete via investigating the emptiness problem of Constraint Büchi automata.
APA, Harvard, Vancouver, ISO, and other styles
8

Lambiri, Cristian. "Temporal logic models for distributed systems." Thesis, University of Ottawa (Canada), 1995. http://hdl.handle.net/10393/10056.

Full text
Abstract:
Since the beginning of the 1980's, the way the computer systems are conceived has changed dramatically. This is a direct result of the appearance, on a large scale, of personal computers and engineering workstations. As a result, networks of independent systems have appeared. This thesis presents a formal specification framework that can be used in the design of distributed systems. The abstract models that are presented are based on a systemic view of distributed systems and discrete event systems. Two base abstract models called deterministic discrete event systems (DDES) and discrete event automaton (DEA) are presented. For the DEA the series and parallel compositions as well as feedback connection are defined. Universal algebra is employed to study the parallel composition of DEAs. From the DDES/DEA an abstract model for distributed systems is obtained. Subsequently, linear time temporal logic is modified for use with the abstract chosen model of distributed systems. The logic is described in three aspects: syntax, semantics and axiomatics. The syntax is modified by the addition of two operators. The semantics of the logic is given over the abstract models. Five axioms are added to the axiomatic system for the two new operators. A programming language called TLL, based on the theoretical framework, links the theory with practice. The syntax and semantics of the programming language are presented. Finally an example of modeling in the framework is given.
APA, Harvard, Vancouver, ISO, and other styles
9

Lacey, D. J. "Program transformation using temporal logic specifications." Thesis, University of Oxford, 2003. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.289278.

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

Karaman, Sertac. "Optimal planning with temporal logic specifications." Thesis, Massachusetts Institute of Technology, 2009. http://hdl.handle.net/1721.1/50573.

Full text
Abstract:
Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Mechanical Engineering, 2009.
Includes bibliographical references (p. 117-121).
Most of the current uninhabitated Aerial Vehicles (UAVs) are individually monitored, commanded and controlled by several operators of different expertise. However, looking forward, there has been a recent interest in multiple-UAV systems, in which the system is only provided with the high-level goals and constraints, called the "mission specifications," and asked to navigate the UAVs such that the mission specifications are fulfilled. A crucial part in designing such multiple-UAV systems is the development of coordination and planning algorithms that, given a set of high-level mission specifications as input, can synthesize provably correct and possibly optimal schedules for each of the UAVs. This thesis studies optimal planning problems in a multiple-UAV mission planning setting, where the mission specifications are given in formal languages. The problem is posed as a novel variant of the Vehicle Routing Problem (VRP), in which temporal logics and process algebra are utilized to represent a large class of mission specifications in a systematic way. The thesis is structured in two parts. In the first part, two temporal logics that are remarkably close to the natural language, namely the linear temporal logic LTL-x and the metric temporal logic (MTL), are considered for specification of a large class of temporal and logical constraints in VRPs. Mixed-integer linear programming based algorithms, which solve these variants of the VRP to optimality, are presented. In the second part, process algebra is introduced and used as a candidate for the same purpose.
(cont.) A tree search based anytime algorithm is given; this algorithm is guarranteed to find a best-first feasible solution in polynomial time and improve it to an optimal one in finite time.
by Sertac Karaman.
S.M.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Temporal logic"

1

Gabbay, Dov M., and Hans Jürgen Ohlbach, eds. Temporal Logic. Berlin, Heidelberg: Springer Berlin Heidelberg, 1994. http://dx.doi.org/10.1007/bfb0013976.

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

Øhrstrøm, Peter, and F. V. Per Hasle. Temporal Logic. Dordrecht: Springer Netherlands, 1995. http://dx.doi.org/10.1007/978-0-585-37463-5.

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

Barringer, Howard, Michael Fisher, Dov Gabbay, and Graham Gough, eds. Advances in Temporal Logic. Dordrecht: Springer Netherlands, 2000. http://dx.doi.org/10.1007/978-94-015-9586-5.

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

Kröger, Fred. Temporal Logic of Programs. Berlin, Heidelberg: Springer Berlin Heidelberg, 1987. http://dx.doi.org/10.1007/978-3-642-71549-5.

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

Banieqbal, B., H. Barringer, and A. Pnueli, eds. Temporal Logic in Specification. Berlin, Heidelberg: Springer Berlin Heidelberg, 1989. http://dx.doi.org/10.1007/3-540-51803-7.

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

Kröger, Fred. Temporal Logic of Programs. Berlin, Heidelberg: Springer Berlin Heidelberg, 1987.

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

Kröger, Fred. Temporal logic of programs. Berlin: Springer-Verlag, 1987.

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

1951-, Barringer Howard, ed. Advances in temporal logic. Dordrecht: Kluwer Academic Publishers, 2000.

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

Kröger, Fred. Temporal logic of programs. Berlin: Springer-Verlag, 1987.

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

Executing temporal logic programs. Cambridge [Cambridgeshire]: Cambridge University Press, 1986.

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

Book chapters on the topic "Temporal logic"

1

Gergely, Tamás, and László Úry. "Temporal Logic." In First-Order Programming Theories, 233–38. Berlin, Heidelberg: Springer Berlin Heidelberg, 1991. http://dx.doi.org/10.1007/978-3-642-58205-9_18.

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

Schneider, Fred B. "Temporal Logic." In On Concurrent Programming, 55–89. New York, NY: Springer New York, 1997. http://dx.doi.org/10.1007/978-1-4612-1830-2_3.

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

Wayne, Hillel. "Temporal Logic." In Practical TLA+, 97–110. Berkeley, CA: Apress, 2018. http://dx.doi.org/10.1007/978-1-4842-3829-5_6.

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

Alagar, V. S., and K. Periyasamy. "Temporal Logic." In Texts in Computer Science, 177–229. London: Springer London, 2011. http://dx.doi.org/10.1007/978-0-85729-277-3_11.

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

Bérard, Béatrice, Michel Bidoit, Alain Finkel, François Laroussinie, Antoine Petit, Laure Petrucci, Philippe Schnoebelen, and Pierre Mckenzie. "Temporal Logic." In Systems and Software Verification, 27–38. Berlin, Heidelberg: Springer Berlin Heidelberg, 2001. http://dx.doi.org/10.1007/978-3-662-04558-9_2.

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

Manna, Zohar, and Amir Pnueli. "Temporal Logic." In The Temporal Logic of Reactive and Concurrent Systems, 179–273. New York, NY: Springer New York, 1992. http://dx.doi.org/10.1007/978-1-4612-0931-7_3.

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

Wang, Jiacun, and William Tepfenhart. "Temporal Logic." In Formal Methods in Computer Science, 151–75. Boca Raton : Taylor & Francis, a CRC title, part of the Taylor & Francis imprint, a member of the Taylor & Francis Group, the academic division of T&F Informa, plc, 2019.: Chapman and Hall/CRC, 2019. http://dx.doi.org/10.1201/9780429184185-6.

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

Venema, Yde. "Temporal Logic." In The Blackwell Guide to Philosophical Logic, 203–23. Oxford, UK: Blackwell Publishing Ltd, 2017. http://dx.doi.org/10.1002/9781405164801.ch10.

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

Kontchakov, Roman, Agi Kurucz, Frank Wolter, and Michael Zakharyaschev. "Spatial Logic + Temporal Logic = ?" In Handbook of Spatial Logics, 497–564. Dordrecht: Springer Netherlands, 2007. http://dx.doi.org/10.1007/978-1-4020-5587-4_9.

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

Kröger, Fred. "Propositional Temporal Logic." In Temporal Logic of Programs, 9–23. Berlin, Heidelberg: Springer Berlin Heidelberg, 1987. http://dx.doi.org/10.1007/978-3-642-71549-5_2.

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

Conference papers on the topic "Temporal logic"

1

Belardinelli, Francesco, Alessio Lomuscio, Aniello Murano, and Sasha Rubin. "Alternating-time Temporal Logic on Finite Traces." In Twenty-Seventh International Joint Conference on Artificial Intelligence {IJCAI-18}. California: International Joint Conferences on Artificial Intelligence Organization, 2018. http://dx.doi.org/10.24963/ijcai.2018/11.

Full text
Abstract:
We develop a logic-based technique to analyse finite interactions in multi-agent systems. We introduce a semantics for Alternating-time Temporal Logic (for both perfect and imperfect recall) and its branching-time fragments in which paths are finite instead of infinite. We study validities of these logics and present optimal algorithms for their model-checking problems in the perfect recall case.
APA, Harvard, Vancouver, ISO, and other styles
2

Costa, Gabriele, and Ilaria Matteucci. "Elective temporal logic." In the joint ACM SIGSOFT conference -- QoSA and ACM SIGSOFT symposium -- ISARCS. New York, New York, USA: ACM Press, 2011. http://dx.doi.org/10.1145/2000259.2000283.

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

Benerecetti, Massimo, Fabio Mogavero, and Aniello Murano. "Substructure Temporal Logic." In 2013 Twenty-Eighth Annual IEEE/ACM Symposium on Logic in Computer Science (LICS 2013). IEEE, 2013. http://dx.doi.org/10.1109/lics.2013.43.

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

Lu, Xu, Cong Tian, and Zhenhua Duan. "Temporalising Separation Logic for Planning with Search Control Knowledge." In Twenty-Sixth International Joint Conference on Artificial Intelligence. California: International Joint Conferences on Artificial Intelligence Organization, 2017. http://dx.doi.org/10.24963/ijcai.2017/162.

Full text
Abstract:
Temporal logics are widely adopted in Artificial Intelligence (AI) planning for specifying Search Control Knowledge (SCK). However, traditional temporal logics are limited in expressive power since they are unable to express spatial constraints which are as important as temporal ones in many planning domains. To this end, we propose a two-dimensional (spatial and temporal) logic namely PPTL^SL by temporalising separation logic with Propositional Projection Temporal Logic (PPTL). The new logic is well-suited for specifying SCK containing both spatial and temporal constraints which are useful in AI planning. We show that PPTL^SL is decidable and present a decision procedure. With this basis, a planner namely S-TSolver for computing plans based on the spatio-temporal SCK expressed in PPTL^SL formulas is developed. Evaluation on some selected benchmark domains shows the effectiveness of S-TSolver.
APA, Harvard, Vancouver, ISO, and other styles
5

Gigante, Nicola, Lucía Gómez Álvarez, and Tim S. Lyon. "Standpoint Linear Temporal Logic." In 20th International Conference on Principles of Knowledge Representation and Reasoning {KR-2023}. California: International Joint Conferences on Artificial Intelligence Organization, 2023. http://dx.doi.org/10.24963/kr.2023/31.

Full text
Abstract:
Many complex scenarios require the coordination of agents holding different points of view, possibly cooperating and not necessarily agreeing. For this reason, standpoint logic (SL) has been recently introduced in the context of knowledge integration, allowing one to reason with diverse and potentially conflicting viewpoints held by different agents. Linear temporal logic (LTL) is the most widely known formalism to express temporal properties of systems and processes, both in formal methods and artificial intelligence related fields. In this paper, we present 'standpoint linear temporal logic' (SLTL), a new logic that combines the temporal features of LTL with the multi-perspective modelling capacity of SL. We define the logic SLTL, its syntax, its semantics, establish its decidability and complexity, and provide a terminating tableau calculus to automate SLTL reasoning. Conveniently, this offers a clear path to extend existing LTL reasoners to provide practical reasoning support for temporal reasoning in multi-perspective settings.
APA, Harvard, Vancouver, ISO, and other styles
6

Cotofrei, P., and K. Stoffel. "Temporal granular logic for temporal data mining." In 2005 IEEE International Conference on Granular Computing. IEEE, 2005. http://dx.doi.org/10.1109/grc.2005.1547325.

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

Katz, Shmuel, and Doron Peled. "Interleaving set temporal logic." In the sixth annual ACM Symposium. New York, New York, USA: ACM Press, 1987. http://dx.doi.org/10.1145/41840.41855.

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

Alur, R., and T. A. Henzinger. "A really temporal logic." In 30th Annual Symposium on Foundations of Computer Science. IEEE, 1989. http://dx.doi.org/10.1109/sfcs.1989.63473.

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

Rodionova, Alena, Ezio Bartocci, Dejan Nickovic, and Radu Grosu. "Temporal Logic as Filtering." In HSCC'16: 19th International Conference on Hybrid Systems: Computation and Control. New York, NY, USA: ACM, 2016. http://dx.doi.org/10.1145/2883817.2883839.

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

Morales, A., and G. Sciavicco. "Using Temporal Logic for Spatial Reasoning: Spatial Propositional Neighborhood Logic." In Thirteenth International Symposium on Temporal Representation and Reasoning (TIME'06). IEEE, 2006. http://dx.doi.org/10.1109/time.2006.34.

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

Reports on the topic "Temporal logic"

1

Wood, William G. Temporal Logic Case Study. Fort Belvoir, VA: Defense Technical Information Center, August 1989. http://dx.doi.org/10.21236/ada219019.

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

Browne, M. C., E. M. Clarke, and O. Grumberg. Characterizing Kripke Structures in Temporal Logic. Fort Belvoir, VA: Defense Technical Information Center, December 1987. http://dx.doi.org/10.21236/ada188620.

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

Baudinet, Marianne. Temporal Logic Programming is Complete and Expressive,. Fort Belvoir, VA: Defense Technical Information Center, October 1988. http://dx.doi.org/10.21236/ada326173.

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

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

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

Dinesh, Nikhil, Aravin K. Joshi, Insup Lee, and Oleg Sokolsky. A Default Temporal Logic for Regulatory Conformance Checking. Fort Belvoir, VA: Defense Technical Information Center, April 2008. http://dx.doi.org/10.21236/ada519810.

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

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

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

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

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

Lutz, Carsten, Dirk Walther, and Frank Wolter. Quantitative Temporal Logics: PSpace and below. Technische Universität Dresden, 2005. http://dx.doi.org/10.25368/2022.146.

Full text
Abstract:
Often the addition of metric operators to qualitative temporal logics leads to an increase of the complexity of satisfiability by at least one exponential. In this paper, we exhibit a number of metric extensions of qualitative temporal logics of the real line that do not lead to an increase in computational complexity. The main result states that the language obtained by extending since/until logic of the real line with the operators 'sometime within n time units', n coded in binary, is PSpace-complete even without the finite variability assumption. Without qualitative temporal operators the complexity of this language turns out to depend on whether binary or unary coding of parameters is assumed: it is still PSpace-hard under binary coding but in NP under unary coding.
APA, Harvard, Vancouver, ISO, and other styles
9

Sherman, Rivi, and Amir Pnueli. Model Checking for Linear Temporal Logic: An Efficient Implementation. Fort Belvoir, VA: Defense Technical Information Center, June 1990. http://dx.doi.org/10.21236/ada225189.

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

Baader, Franz, Anees ul Mehdi, and Hongkai Liu. Integrate Action Formalisms into Linear Temporal Description Logics. Technische Universität Dresden, 2009. http://dx.doi.org/10.25368/2022.172.

Full text
Abstract:
The verification problem for action logic programs with non-terminating behaviour is in general undecidable. In this paper, we consider a restricted setting in which the problem becomes decidable. On the one hand, we abstract from the actual execution sequences of a non-terminating program by considering infinite sequences of actions defined by a Büchi automaton. On the other hand, we assume that the logic underlying our action formalism is a decidable description logic rather than full first-order predicate logic.
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Temporal logic' for particular source types:
Journal articles Dissertations / Theses Books
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