1. Temporal Logic last substantive content change DEC 11 2003. temporal logic. The 1. Modallogic approaches to temporal logic. 1.1 Tense Logic. Tense http://plato.stanford.edu/entries/logic-temporal/

version history HOW TO CITE THIS ENTRY Stanford Encyclopedia of Philosophy A B C D ... Z This document uses XHTML-1/Unicode to format the display. Older browsers and/or operating systems may not display the formatting correctly. last substantive content change DEC Temporal Logic The term Temporal Logic has been broadly used to cover all approaches to the representation of temporal information within a logical framework, and also more narrowly to refer specifically to the modal-logic type of approach introduced around 1960 by Arthur Prior under the name of Tense Logic and subsequently developed further by logicians and computer scientists. Applications of Temporal Logic include its use as a formalism for clarifying philosophical issues about time, as a framework within which to define the semantics of temporal expressions in natural language, as a language for encoding temporal knowledge in artificial intelligence, and as a tool for handling the temporal aspects of the execution of computer programs. 1. Modal-logic approaches to temporal logic 2. Predicate-logic approaches to temporal logic 3. Philosophical issues 4. Applications ... Related Entries 1. Modal-logic approaches to temporal logic 1.1 Tense Logic

2. Temporal Logic Case Study A case study applying temporal logic to specify the operation of a bank of identical elevators servicing a number of floors in a building. http://www.sei.cmu.edu/publications/documents/89.reports/89.tr.024.html

Welcome Search SEI Reports Lists of SEI Reports Recent Reports Annual Report Books news@sei Featured Articles Publications File Formats Paper Copies of SEI Reports FAQ Temporal Logic Case Study Technical Report Wood, W. This report is a case study applying temporal logic to specify the operation of a bank of identical elevators servicing a number of floors in a building. The goal of the study was to understand the application of temporal logic in a problem domain that is appropriate for the method, and to determine some of the strengths and weaknesses of temporal logic in this domain. The case study uses a finite state machine language to build a model of the system specification, and verifies that the temporal logic specifications are consistent using this model. The specification aspires to be complete, consistent, and unambiguous. CMU/SEI-89-TR-024 download the PDF file download the PostScript file The Software Engineering Institute (SEI) is a federally funded research and development center sponsored by the U.S. Department of Defense and operated by Carnegie Mellon University. by Carnegie Mellon University URL: http://www.sei.cmu.edu/publications/documents/89.reports/89.tr.024.html

3. Marking Up Temporal Logic Marking up temporal logic. To wwwmath@w3.org. Subject Marking up temporal logic. From Warren Searle ucabwas@ucl.ac.uk http://lists.w3.org/Archives/Public/www-math/msg00496.html

[Prev] [Next] [Index] [Thread] Marking up Temporal Logic To www-math@w3.org Subject : Marking up Temporal Logic From ucabwas@ucl.ac.uk Date : Thu, 02 Sep 1999 14:47:43 +0100 From www-math-request@tux.w3.org Thu Sep 2 09 Organization : University College London I was hoping someone might be able to advise me on how I can quickly markup some basic first-order temporal logic equations to be included on a web document. I guess I need to use the character codes for the operators I need but is there an easy way to find these out (I don't think it matters was character encoding standard I use) Thank you loads! Warren Follow-Ups Re: Marking up Temporal Logic From Re: Marking up Temporal Logic From Prev: Re: Marking up Temporal Logic Next: Index: Message index of www-math@w3.org mailing list Thread: Thread index of www-math@w3.org mailing list

4. Kono's Temporal Logic Related Information A collection of papers by Shinji Kono on the Interval temporal logic. http://rananim.ie.u-ryukyu.ac.jp/~kono/temporal-logic-e.html

Interval Temporal Logic Projects and papers on Interval Temporal Logic Japanese Page is here Projects Tokio-9.94 Programming Tools for Interval Temporal Logic Tokio Programming Language RTL-Tokio Piplelined CPU verification tool LITE Intervale Temporal Logic Verifier Papers TEMPORAL LOGIC PROGRAMMING LANGUAGE Tokio Shinji Kono, Tatsuya Aoyagi, Masahiro Fujita, Hidehiko Tanaka, Tatsuhiko Moto-oka September 1984 Logic Programming Conference Tokio: Logic Programming Language Based on Temporal Logic and Its compilation to Prolog Masahiro Fujita, Shinji Kono, Hidehiko Tanaka, Tatsuhiko Moto-oka September 1986 Internatinal Conference on Logic Programming Automatic Verification of Interval Temporal Logic Shinji Kono TM-92-007, SONYCSL March 1992 8th British Colloquium For Theoretical Computer Science October Synthesis of Contrllers from Interval Temporal Loigc Specification Masahiro Fujita Shinji Kono TR-93-11, SONYCSL October May, 1993 International Workshop on Logic Synthesis A Combination of Clasual and Non Clausal Temporal Logic Program Shinji Kono TR-93-12, SONYCSL October Aug, 1993 IJCAI-93 Workshop on Executable Modal and Temporal Logics

5. Foundations Of Temporal Logic – The WWW-site For Prior-studies Devoted to the life and work of the founding father of temporal logic. Includes bibliography, interview with Mary Prior, and information on the Prior papers at the Bodleian Library. http://www.hum.auc.dk/prior/

The WWW-site for Prior-studies You'll be redirected in 10 seconds. Or you can click below... Enter here Optimized for a minimum screen resolution of 800x600 pixels. Browser version 4 or later

6. Temporal Logic Definition of temporal logic, possibly with links to more information and implementations. temporal logic. ( definition) Definition A logic with a notion of time included structures, which http://www.nist.gov/dads/HTML/temporllogic.html

temporal logic (definition) Definition: A logic with a notion of time included. The formulas can express facts about past, present, and future states. The formulas are interpreted over Kripke structures, which can model computation; hence temporal logic is very useful in formal verification Author: SKS Implementation The SMV model checker. Go to the Dictionary of Algorithms and Data Structures home page. If you have suggestions, corrections, or comments, please get in touch with Paul E. Black (paul.black@nist.gov). Entry modified Sat Sep 4 16:48:17 1999. HTML page formatted Thu Jan 15 16:38:44 2004. This page's URL is http://www.nist.gov/dads/HTML/temporllogic.html

7. Temporal Logic temporal logic. As a basis for describing the genetic algorithm we will use a combination of classical firstorder logic, temporal logic 116 , and probabilistic logic 106 . http://www.uwasa.fi/cs/publications/2NWGA/node285.html

Next: Probabilistic Logic Up: Temporal Probabilistic Logic Previous: Temporal Probabilistic Logic Temporal Logic As a basis for describing the genetic algorithm we will use a combination of classical first-order logic, temporal logic [ , and probabilistic logic [ As far as temporal logic is concerned, our logic is based on temporal intervals, typically denoted I . Intervals may be used in expressions in various ways, using the following operators (table Given an interval I we have the following two operations on intervals. In order to reason within our logic we need to define some basic operators, in addition to the standard first-order logic with its boolean operators (disjunction), (conjunction), (negation), (implication) and (equivalence). We also have the first order operators (existence), and (universality). Following Manna and Pnueli [ , the temporal operators in table are sufficient for our purposes. Table: operators. p and q are general propositions. for intervals. Note that some of these operators are `weak' versions: wait-for is a weak version of the until operator which allows for the possibility that q never occurs and, then

8. SRI International - Computer Science Laboratory - Ground Temporal Logic: A Logic Computer Science Laboratory. Jobs. Publications. Ground temporal logic A Logic for Hardware Verification. by David Cyrluk and Paliath Narendran. Lecture Notes in Computer Science, Volume 818. From http://www.csl.sri.com/reports/html/cav94.html

Computing Sciences Computer Science Laboratory Contact People ... Jobs Publications Ground Temporal Logic: A Logic for Hardware Verification by David Cyrluk and Paliath Narendran Lecture Notes in Computer Science, Volume 818. From Computer-Aided Verification (CAV '94) Edited by David Dill. Springer-Verlag, Stanford, CA. June, 1994. Abstract: We present a new temporal logic, GTL, appropriate for specifying properties of hardware at the register transfer level. We argue that this logic represents an improvement over model checking for some natural hardware verification problems. We show that the validity problem for this logic is Pi 1-1 complete. We then identify a fragment of the logic that is decidable. We show that in this fragment we are still able to encode many interesting problems, including the correctness of pipelined microprocessors. BibT E X entry: http://www.csl.sri.com/papers/cav94/ Download: cav94.ps.gz Compressed PostScript Home About Us Working with SRI Careers ... News

9. Temporal Logic Propositional temporal logic. Back to the tutorial pages. Lineartime temporal logic. temporal logic is a convenient formalism for specifying and verifying properties of reactive systems, as first pointed out by Pnueli in 1977. A formula of temporal logic describes the set of infinite sequences for http://www-step.stanford.edu/tutorial/temporal-logic/temporal-logic.html

If you see this then your browser does not support FRAMES . We recommend you upgrade your browser to OR if you are using MicroSoft explorer then upgrade it to some newer version step@cs.stanford.edu Last modified: Wed Jul 1 09:21:20 PDT 1998

10. BRICS Lecture Series, Abstracts, 1997 temporal logic in Information Systems. November 1997. viii+42 pp. Abstract temporal logic is obtained by adding temporal connectives to a logic language. http://www.brics.dk/LS/97/Abs/BRICS-LS-97-Abs/

BRICS Lecture Series, Abstracts, 1997 March 24, 1999 This document is also available as PostScript DVI Text References LS-97-1 PostScript PDF DVI Jan Chomicki and David Toman. Temporal Logic in Information Systems November 1997. viii+42 pp. Full version to appear in: Logics for Database and Information Systems, Chomicki and Saake (eds.), Kluwer Academic Publishers, 1998. Abstract: Temporal logic is obtained by adding temporal connectives to a logic language. Explicit references to time are hidden inside the temporal connectives. Different variants of temporal logic use different sets of such connectives. In this chapter, we survey the fundamental varieties of temporal logic and describe their applications in information systems. Several features of temporal logic make it especially attractive as a query and integrity constraint language for temporal databases. First, because the references to time are hidden, queries and integrity constraints are formulated in an abstract, representation-independent way. Second, temporal logic is amenable to efficient implementation. Temporal logic queries can be translated to an algebraic language. Temporal logic constraints can be efficiently enforced using auxiliary stored information. More general languages, with explicit references to time, do not share these properties. Recent research has proposed various implementation techniques to make temporal logic practically useful in database applications. Also, the relationships between different varieties of temporal logic and between temporal logic and other temporal languages have been clarified. We report on these developments and outline some of the remaining open research problems.

11. TLA - The Temporal Logic Of Actions TLA The temporal logic of Actions. TLA (the temporal logic of Actions) is a logic for specifying and reasoning about concurrent and reactive systems. http://research.microsoft.com/users/lamport/tla/tla.html

TLA - The Temporal Logic of Actions Last modified 9 February 2004 The TLA+ book is available here The TLA+ tools are available here What is TLA? TLA (the Temporal Logic of Actions) is a logic for specifying and reasoning about concurrent and reactive systems. It is the basis for TLA+, a complete specification language. This Web page will be updated to reflect new work on TLA. I hope that all work on TLA and TLA tools will be accessible from here. If you want to be notified of changes to this page, or if you want your work to be represented here, please send e-mail to Leslie Lamport About TLA and TLA+ Introduction to TLA Leslie Lamport 16 December 1994 A short (7-page) introduction to what TLA formulas mean. It should allow you to understand TLA specifications. A Summary of TLA+ This is a 7-page "cheat sheet" that briefly describes all the constructs and built-in operators of TLA+ and the operators defined in the common standard modules, and that lists the user-definable operator symbols and the ascii representations of symbols. Postscript (300K) Compressed Postscript (170K) PDF (120K) PODC 2000 Tutorial Handout This is the handout from the TLA+ tutorial at PODC 2000. It will be meaningful only to people who attended the tutorial.

12. Temporal Logic Specification IS Verification. Automatic verification of protocols and Reactive systems using temporal logic temporal logic. temporal logic. Metric temporal logic temporal logic with real time http://www.dbrover.com/tl.html

Temporal Logic: Time is of the Essence Temporal Logic Temporal Logic Metric Temporal Logic : Temporal Logic with real time constraint specification Regular Expressions vs. Temporal Logic Java assertions vs. Temporal Logic Counting Operators Temporal Data Assertions : incorporating time series constraints into Temporal Logic. Specification patterns Remote LTL/MTL/MTLD DBRover monitor: highlights. Article Applications of Temporal Logic Commercial Temporal Rule Checking Specification based Exception Handling Knowledge Reasoning Knowledge and Belief in Temporal Logic

13. TLA Papers This should be the current corpus of all papers about TLA (the temporal logic of Actions) by Leslie Lamport and friends, but it hasn t been updated in quite a http://research.microsoft.com/users/lamport/tla/papers.html

TLA PAPERS Last modified 16 March 2004 This should be the current corpus of all papers about TLA (the Temporal Logic of Actions) by Leslie Lamport and friends, but it hasn't been updated in quite a while. Lamport's more recent papers can be found on his publications page Table of Contents The Temporal Logic of Actions Introduction to TLA Specifying Concurrent Systems with TLA+ A Summary of TLA+ ... TLA Notes The Temporal Logic of Actions Leslie Lamport 30 April 1994 This is the basic TLA reference, introducing the logic and proof rules. Abstract : The temporal logic of actions (TLA) is a logic for specifying and reasoning about concurrent systems. Systems and their properties are represented in the same logic, so the assertion that a system meets its specification and the assertion that one system implements another are both expressed by logical implication. TLA is very simple; its syntax and complete formal semantics are summarized in about a page. Yet, TLA is not just a logician's toy; it is extremely powerful, both in principle and in practice. This report introduces TLA and describes how it is used to specify and verify concurrent algorithms. The use of TLA to specify and reason about open systems will be described elsewhere. (51 pages) Appeared in ACM Toplas 16, 3 (May 1994) 872-923

14. Welcome To Software Technology Research Laboratory De Montfort University Formal methods, verification, reactive systems, semantics, compositionality, interval temporal logic, executable specification, re-engineering. http://www.cse.dmu.ac.uk/~cau/

Dr. rer. nat., ir. Antonio Cau Software Technology Research Laboratory De Montfort University Hawthorn Building, The Gateway Leicester LE1 9BH, England Telephone ++44 (0)116 257 7937 Fax ++44 (0)116 257 7936 E-mail: cau at dmu.ac.uk May 5 2004 Research Publications Projects ITL home ... FME course

15. TLA - The Temporal Logic Of Actions TLA The temporal logic of Actions. Last modified 9 February 2004. The TLA+ book is available here. The TLA+ tools are available here. What is TLA? TLA (the temporal logic of Actions) is a logic http://www.research.digital.com/SRC/personal/Leslie_Lamport/tla/tla.html

TLA - The Temporal Logic of Actions Last modified 9 February 2004 The TLA+ book is available here The TLA+ tools are available here What is TLA? TLA (the Temporal Logic of Actions) is a logic for specifying and reasoning about concurrent and reactive systems. It is the basis for TLA+, a complete specification language. This Web page will be updated to reflect new work on TLA. I hope that all work on TLA and TLA tools will be accessible from here. If you want to be notified of changes to this page, or if you want your work to be represented here, please send e-mail to Leslie Lamport About TLA and TLA+ Introduction to TLA Leslie Lamport 16 December 1994 A short (7-page) introduction to what TLA formulas mean. It should allow you to understand TLA specifications. A Summary of TLA+ This is a 7-page "cheat sheet" that briefly describes all the constructs and built-in operators of TLA+ and the operators defined in the common standard modules, and that lists the user-definable operator symbols and the ascii representations of symbols. Postscript (300K) Compressed Postscript (170K) PDF (120K) PODC 2000 Tutorial Handout This is the handout from the TLA+ tutorial at PODC 2000. It will be meaningful only to people who attended the tutorial.

16. Temporal Logic Automatic verification of protocols and Reactive systems using temporal logic. temporal logic Time is of the Essence. temporal logic. http://www.time-rover.com/tl.html

Temporal Logic: Time is of the Essence Temporal Logic Temporal Logic Metric Temporal Logic : Temporal Logic with real time constraint specification Regular Expressions vs. Temporal Logic Java assertions vs. Temporal Logic Counting Operators Temporal Data Assertions : incorporating time series constraints into Temporal Logic. Specification patterns Remote LTL/MTL/MTLD DBRover monitor: highlights. Article Applications of Temporal Logic Commercial Temporal Rule Checking Specification based Exception Handling Knowledge Reasoning Knowledge and Belief in Temporal Logic

17. Temporal Logic Automatic verification of protocols and Reactive systems using temporal logic. temporal logic Time is of the Essence. Safety properties in temporal logic. http://www.time-rover.com/ltl.html

Temporal Logic: Time is of the Essence Temporal logic is an extension of conventional (propositional) logic which incorporates special operators that cater for time. With Temporal Logic one can specify (and verify, using the TemporalRover) how components, protocols, objects, modules, procedures and functions behave as time progresses. The specification is done with (Temporal) logic statements that make assertions about properties and relationships in the past, present, and the future. Temporal Logic has been used extensively in award winning verification projects, such as done by the 1996 Turing award winner, Prof. Amir Pnueli. Temporal Logic is especially effective for the specification of Reactive (sub)systems and protocols , where indeed Time is of the Essence General Temporal-Logic Examples The Temporal Logic language of the TemporalRover Counting Operators Temporal Data Assertions : Incorporating data into Temporal Logic Metric Temporal Logic Safety properties in Temporal Logic Liveness properties in Temporal Logic Past time in Temporal Logic ... Article Links Formal Methods IBM Article The Temporal Logic language of the TemporalRover The TemporalRover allows designers, programmers, and testers to expand their existing design/programming language to support Temporal-Logic. The TemporalRover will translate those Temporal-Logic statements into executable code in the language being used.

18. Interval Temporal Logic Interval temporal logic. http://www.cse.dmu.ac.uk/~cau/itlhomepage/

Next: Syntax Interval Temporal Logic Antonio Cau Ben Moszkowski and Hussein Zedan Software Technology Research Laboratory Pdf version of the ITL home page Abstract: Interval Temporal Logic (ITL) is a flexible notation for both propositional and first-order reasoning about periods of time found in descriptions of hardware and software systems. Unlike most temporal logics, ITL can handle both sequential and parallel composition and offers powerful and extensible specification and proof techniques for reasoning about properties involving safety, liveness and projected time[ ]. Timing constraints are expressible and furthermore most imperative programming constructs can be viewed as formulas in a slightly modified version of ITL [ ]. Tempura provides an executable framework for developing and experimenting with suitable ITL specifications. In addition, ITL and its mature executable subset Tempura [ ] have been extensively used to specify the properties of real-time systems where the primitive circuits can directly be represented by a set of simple temporal formulae. In addition, various researchers have applied Tempura to hardware simulation and other areas where timing is important. Syntax Semantics Frequently used abbreviations Propositional proof system ... About this document ...

19. SpringerLink - Article A flexible notation for both propositional and firstorder reasoning about periods of time found in descriptions of hardware and software systems. Includes table of contents, abstracts and pdf downloads. http://link.springer.de/link/service/journals/00165/bibs/0012001/00120052.htm

Articles Publications Publishers Home Publication Issue Article Formal Aspects of Computing Publisher: Springer-Verlag London Ltd ISSN: 0934-5043 (Paper) 1433-299X (Online) DOI: 10.1007/s001650070036 Issue: Volume 12, Number 1 Date: October 2000 Pages: 52 - 70 Composing and Refining Dense Temporal Logic Specifications Antonio Cau Software Technology Research Laboratory, Science and Engineering Research Centre, De Montfort University, Leicester, UK Abstract: Abstract. A dense temporal logic development method for the specification, refinement, composition and verification of reactive systems is introduced. A reactive system is specified by a pair consisting of a machine and a condition that indicate the valid computations of this machine. Compositionality is achieved by indicating whether each step is an environment step, a system step, or a communication step. Refinement can be expressed straightforwardly in the logic because the stutter problem is elegantly solved by using the dense structure of the logic. Compositionality enables us to break refinement between complex systems into refinement between small and simple systems. The latter can then be verified by existing proof rules for refinement which are reformulated in our formalism. Keywords: Keywords: Temporal logic; Compositionality; Refinement

20. Fahiem Bacchus University of Toronto. Planning systems, temporal logic, constraint satisfaction problems and formal models. http://www.cs.toronto.edu/~fbacchus/

Fahiem Bacchus (Professor). BSc (Alberta '79), MSc (Toronto '83), PhD (Alberta '88). fbacchus@cs.toronto.edu My research interests revolve around the application of formal models to solve practical and theoretical problems in AI. The main formal tools my work employs include logic, probability theory, algorithm analysis and design, and to some extent statistics. My early work was mainly distinguished by the combined applications of logic and probability to problems in representation and reasoning, especially non-monotonic reasoning. More recently my work has focused on more "algorithmic" problems, and I have worked on algorithms for planning and CSPs (Constraint Satisfaction Problems). On Line Papers . Available in gzipped postscript, mail me if you need another format. TLPlan By using Temporal Logic to specify domain-specific control strategies, we obtain a planner that runs orders of magnitude faster than most other AI planning systems! TLPlan won the AIPS2002 planning competition. For more information click on the link above. 2clseq is a DPLL SAT solver that employs much more extensive reasoning at each node of the search tree. It displays performance that is very competitive with the best state of the art (2002) SAT solvers, all of which eschew reasoning beyond simple unit propagation. For more information click on the link above.

A  B  C  D  E  F  G  H  I  J  K  L  M  N  O  P  Q  R  S  T  U  V  W  X  Y  Z

Page 1     1-20 of 110    1  | 2  | 3  | 4  | 5  | 6  | Next 20