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

22. TLA - The Temporal Logic Of Actions TLA The temporal logic of Actions. TLA (the temporal logic of Actions) is alogic 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.

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

24. TLA Papers This should be the current corpus of all papers about TLA (the temporal logic ofActions) 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

25. The Starlog Project At The University Of Waikato Declarative temporal logic programming language for general purpose programming, simulation, modeling reactive systems. Starlog programs consist of 2 components a set of timed facts, a set of temporal logic rules. Somewhat like Prolog. http://www.cs.waikato.ac.nz/Research/starlog/index.html

A new Logic Programming Language The Starlog Project What is Starlog? Motivation Starlog Concepts Examples ... Department Home What is Starlog? Starlog is a pure-logic programming language designed to overcome some of the problems inherient in traditional approaches to logic programming. As a result, Starlog is designed to be a general purpose programming language, and is particularly useful for simulation, and for modelling reactive systems. Although most logic programming languages (e.g. Prolog) are query driven (i.e. are evaluated "top-down"), Starlog programs are evaluated "bottom-up". That is, as a Starlog program executes, it builds a model of all the true facts that can be derived from rules in the program. The evaluation of Starlog programs is controlled using a stratification order. Motivation Traditionally, logic programming languages have never been able to compete with the popularity of other language paradigms. We attribute this to: Most implementations of logic programs being less efficient at run time than equivalent programs from other language paradigms. The introduction of extra-logical operators that improve efficiency often break the declarative semantics of logic programs.

26. Temporal Logic temporal logic. The term temporal logic has been Modallogic approachesto temporal logic. Tense logic. Tense logic was introduced by Arthur http://setis.library.usyd.edu.au/stanford/archives/fall2001/entries/logic-tempor

This is a file in the archives of the Stanford Encyclopedia of Philosophy Stanford Encyclopedia of Philosophy A B C D ... Z 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. Modal-logic approaches to temporal logic Predicate-logic approaches to temporal logic Philosophical issues Applications ... Related Entries Modal-logic approaches to temporal logic Tense Logic The logical language of Tense Logic contains, in addition to the usual truth-functional operators, four modal operators with intended meanings as follows:

27. Homepage Of Joeri Engelfriet Vrije Universiteit Amsterdam Formal models for static and dynamic aspects of complex reasoning processes, temporal logic, and belief revision. http://www.cs.vu.nl/~joeri/

FRAMES you can access my pages from my old homepage

28. Modal Logic In deontic logic, temporal logic, and others, the analog of the truth condition (5) is clearly not appropriate us consider a future temporal logic, a logic where A reads it http://plato.stanford.edu/entries/logic-modal

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 OCT Modal Logic 1. What is Modal Logic? 2. Modal Logics 3. Deontic Logics 4. Temporal Logics ... Related Entries 1. What is Modal Logic? A list describing the best known of these logics follows. Logic Symbols Expressions Symbolized Modal Logic It is necessary that .. It is possible that .. Deontic Logic O It is obligatory that .. P It is permitted that .. F It is forbidden that .. Temporal Logic G It will always be the case that .. F It will be the case that .. H It has always been the case that .. P It was the case that.. Doxastic Logic Bx x believes that .. 2. Modal Logics Necessitation Rule: If A is a theorem of K, then so is A. Distribution Axiom: (A B) A B). The operator by letting A = ~ ~A. In K, the operators and behave very much like the quantifiers (all) and (some). For example, the definition of from mirrors the equivalence of xA with ~ x~A in predicate logic. Furthermore

29. Foundations Of Temporal Logic - The WWW-site For Prior-studies frameles.htm. http://www.hum.auc.dk/prior/index2.htm

30. TIME-ROVER temporal Rule Validation, Highlevel Runtime Verification, Knowledge Monitoring and Reasoning, Run-time Monitoring, Knowledge logic, temporal logic Requirement Simulation and Simulation Interchange. TLChart, temporal-logic, Statechart Technology. Knowledege Monitoring http://www.dbrover.com/

Home Support Papers Products Customers Contact Site Map Safety Critical Systems Ask for requirements monitoring + simulation demo! Knowledge and Intelligent Systems Ask for the knowledge and belief demo! About Time-Rover Run-time Monitoring and Verification Requirement Simulation and Simulation Interchange TLChart, Temporal-Logic, Statechart Technology Knowledege Monitoring, Reasoning and Simulation Reactive Systems Run-time Verification and Monitoring

31. Martin Fränzle, Researcher In CS, Oldenburg University, Germany Universit¤t Oldenburg Formal methods, real-time and hybrid systems, hardware synthesis and verification, and temporal logic. http://ca.informatik.uni-oldenburg.de/~fraenzle/

Dr. Position: Till July 2002, I have been senior research assistant at the Computer Science Department of the , Germany. In August 2002, I have moved to the Technical University of Denmark as an associate professor. Please consult my new homepage for more recent information. Research interests: Real-time and hybrid control systems: high-level modelling, formal methods for analysis, specification and design, automatic verification. Temporal logic: semantics of metric-time variants, Semantic models of embedded systems and VLSI New address: Informatics and Mathematical Modelling The Technical University of Denmark Richard Petersens Plads, Bldg. 322 DK-2800 Kgs. Lyngby Denmark Tel: Fax: Last modified: Aug. 20, 2002

32. Citations: Temporal Logic Programming Language Tokio - Aoyagi, Fujita, Moto-oka T. Aoyagi, M. Fujita, and T. Motooka. temporal logic programming language Tokio. In E. Wada, editor, logic Programming'85, volume 221 of LNCS, pages 138147. SpringerVerlag, 1986. http://citeseer.nj.nec.com/context/158106/0

12 citations found. Retrieving documents... Aoyagi, T. et al (1986). Temporal logic programming language Tokio . In E. Wada editor, Logic Programming'85, Lecture Notes in Computer Science 221, 138147. Home/Search Document Not in Database Summary Related Articles Check This paper is cited in the following contexts: An Operational Semantics of Starlog - Lu, Cleary (1999) (1 citation) (Correct) ....language. Starlog uses the syntax of the constraint logic programs (CLP hereafter) 21] Starlog is a CLP language with arithmetic constraints over integers and equality disequality constraints over terms. This is different from other TLP languages that are based on a particular temporal logic Unlike other CLP languages such as CLP(R) 22] and BNR Prolog [33] Starlog programs are executed bottom up. This is suitable for its intended applications which often use the specification of a real world system to construct a temporal model of the system. Over the past decade, a working .... ....semantics for Starlog. Its correctness and completeness with respect to its model semantics are given. The operational semantics is a bottom up execution mechanism which deals with negative literals in the same way as positive ones.

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

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

35. ANGELO MONTANARI WEB PAGE University of Udine logical specifications of real-time systems, temporal and object-oriented databases, deductive databases, temporal representation and reasoning, modal and temporal logic, set theory. http://www.dimi.uniud.it/~montana/index.html

This page has been created to be displayed by a browser supporting frames. This text is displayed if your browser does not support frames.

36. Shmuel Katz's Home Page The Technion Language constructs for distributed programming (superimposition, multiparty interactions, reconciliations), tools for design and programming of distributed systems (debugging, domain archetypes), interleaving set temporal logic (including for cache consistency), self-stabilization and fault-tolerance, formal specification methods. http://www.cs.technion.ac.il/~katz/

CS home page Shmuel Katz's Home Page a photograph Department of Computer Science The Technion Haifa 32000, Israel +972-4-829-4322 (voice) +972-4-822-1128 or -829-4353 (fax) katz@cs.technion.ac.il Research Interests: Formal specification methods and connections among them, including issues of translations among specification notations and their effects on properties of models, Verification using convenient executions, including semi-automatic proofs built over a PVS proof environment, Language constructs for distributed programming (superimposition, multiparty interactions, reconciliations), Tools for design and programming of distributed systems(debugging, domain archetypes) Interleaving set temporal logicISTL (including for cache consistency), Self-stabilization and fault-tolerance. A list of publications For copies of most of the papers, please send me an email request. However, a postscript copy of the paper "A Mechanized proof Environment for the Convenient Computations proof Method" by Marcelo Glusman and myself, to appear in the journal Formal Methods in System Design, is available here . The article "Superimpositions and Aspect-Oriented Programming" by Marcelo Sihman and myself, to appear in the BCS Computer Journal, is available

37. Science/Math/Logic And Foundations/Nonstandard Logics And Extensions/Temporal Lo eInfo! Science Math logic and Foundations Nonstandard logics and Extensionstemporal logic url plato.stanford.edu/entries/logictemporal/. http://www.ebroadcast-info.com/information/Science/Math/Logic_and_Foundations/No

HOME WEBSEARCH SHOPPING ENTERTAINMENT ... Australian TV Guide NEW! Australian Movie Guide eCars.com.au Car Buyer/Seller AAMI Insurance Quotes Web categories Entertainment Lifestyle Reference Regional ... Nonstandard Logics and Extensions : Temporal Logic the entire directory only in Temporal Logic Categories Prior, Arthur Related categories Reference: Time Recommended websites Efficient Symbolic Tools A BDD based tool for the formal verification of concurrent systems using a propositional branching-time temporal logic: action computation tree logic (ACTL). It runs under different OS, including Linux and Windows 95/98/NT. url: www.el.feri.uni-mb.si/est/ Ground Temporal Logic: A Logic for Hardware Verification A temporal logic designed to specify properties of hardware at the register transfer level. url: www.csl.sri.com/reports/html/cav94.html Interval Temporal Logic A flexible notation for both propositional and first-order reasoning about periods of time found in descriptions of hardware and software systems. Includes table of contents, abstracts and pdf downloads. url: link.springer.de/link/service/journals/00165/bibs/...

38. Simin Nadjm-Tehrani Link¶ping University Formal methods in verification of real-time and embedded systems, including discrete and hybrid models, applications of temporal logic, symbolic model checking, automata-based decompositional proof techniques. http://www.ida.liu.se/~snt/

Linköpings universitet Department of Computer and Information Science Real-Time Systems Lab Email: simin@ida.liu.se Phone: Fax: Office: Building B, First floor, Room 3B:442-444 Real-time Systems Laboratory (RTSLAB) Department of Computer and Information Science Simin Nadjm-Tehrani is the Director of Real-time Systems Laboratory (RTSLAB) since January 2000. formal analysis of safety and fault-tolerance in safety-critical systems system availability: support for fault-tolerance in middleware survivability in critical infrastructures using self-healing agents formal verification of hybrid (discrete-continuous) models Her main interests within the field of education are: curriculum design problem-based learning (PBL) authentic examination forms women in computer science Details of current activities and publications can be found on the RTSLAB web pages Last modified on Friday January 24, 2003 by Simin Nadjm-Tehrani

39. LINGUIST List 10.1581: Modal Logic/Temporal Logic, Cognitive Typology LINGUIST List 10.1581. Thu Oct 21 1999. Calls Modal logic/temporal logic, CognitiveTypology. Editor for this issue Jody Huellmantel jody@linguistlist.org . http://www.linguistlist.org/issues/10/10-1581.html

LINGUIST List 10.1581 Thu Oct 21 1999 Calls: Modal Logic/Temporal Logic, Cognitive Typology Editor for this issue: jody@linguistlist.org As a matter of policy, LINGUIST discourages the use of abbreviations or acronyms in conference announcements unless they are explained in the text. Directory Maarten de Rijke, AiML-ICTL 2000: First Call for Papers Jan.Nuyts, International Cognitive Typology Conference Message 1: AiML-ICTL 2000: First Call for Papers Date: Thu, 21 Oct 1999 22:15:25 +0200 (MET DST) From: mdr@wins.uva.nl Subject: AiML-ICTL 2000: First Call for Papers wansing@Rcs1.urz.tu-dresden.de wolter@informatik.uni-leipzig.de http://www.illc.uva.nl/~mdr/AiML/ Mail to author ... Top of issue Message 2: International Cognitive Typology Conference Date: Thu, 21 Oct 1999 09:34:06 +0200 (MET DST) From: nuyts@uia.ua.ac.be Subject: International Cognitive Typology Conference nuyts@uia.ua.ac.be nuyts@uia.ua.ac.be Universiteitsplein 1 B-2610 Wilrijk - Belgium Mail to author Respond to list Read more issues LINGUIST home page ... Top of issue

40. LINGUIST List 11.215: Logic/Language, Modal/Temporal Logic theory of modal and temporal logic, representation of time in natural language semantics,nonmonotonic modal logics, provability logic, temporal databases. http://www.linguistlist.org/issues/11/11-215.html

LINGUIST List 11.215 Wed Feb 2 2000 Calls: Logic/Language, Modal/Temporal Logic Editor for this issue: lydia@linguistlist.org As a matter of policy, LINGUIST discourages the use of abbreviations or acronyms in conference announcements unless they are explained in the text. Directory Carlos Areces, Logic/Lang: Second International Workshop on Hybrid Logic/ HyLo 2000 Advances in Modal Logic, Logic: Advances in Modal/Temporal Logic: AiML-ICTL 2000 Message 1: Logic/Lang: Second International Workshop on Hybrid Logic/ HyLo 2000 Date: Tue, 1 Feb 2000 22:39:57 +0100 From: carlos@wins.uva.nl Subject: Logic/Lang: Second International Workshop on Hybrid Logic/ HyLo 2000 http://www.illc.uva.nl/~carlos/hybrid And do not hesitate to contact the workshop organisers for more information. We'd be delighted to tell you more. Contact details are give below. SUBMISSIONS: We invite the contribution of research papers to the workshop. Please send electronically an extended abstract of up to 10 A4 size pages, in PostScript format to: carlos@wins.uva.nl

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 2     21-40 of 109    Back | 1  | 2  | 3  | 4  | 5  | 6  | Next 20