Home  - Science - Temporal Logic

Books Baby Camera Phones Computers Games DVD Electronics Kitchen Magazines Music Garden Software Tools Toys Video Apparel & Accessories Jewelry & Watches Musical Instruments Health & Personal Care Beauty Sports & Outdoors Office Products

e99.com Bookstore

Images

Newsgroups

1-20 of 104    1  | 2  | 3  | 4  | 5  | 6  | Next 20

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

Temporal Logic:     more books (100)

The Temporal Logic of Reactive and Concurrent Systems: Specification by Zohar Manna, Amir Pnueli, 1991-12-18 Temporal Logic: From Ancient Ideas to Artificial Intelligence (Studies in Linguistics and Philosophy) by Peter Øhrstrøm, P. Hasle, 1995-09-30 Specifying Message Passing and Time-Critical Systems with Temporal Logic (Lecture Notes in Computer Science) by Ron Koymans, 1992-12-17 Temporal Logic: First International Conference, ICTL '94, Bonn, Germany, July 11 - 14, 1994. Proceedings (Lecture Notes in Computer Science) Temporal Logic and State Systems (Texts in Theoretical Computer Science. An EATCS Series) by Fred Kröger, Stephan Merz, 2008-04 Practical Formal Methods Using Temporal Logic by Michael Fisher, 2008-07-08 Temporal Logics and Their Applications Mathematical Logic for Computer Science by Mordechai Ben-Ari, 2008-02 Representing Musical Time: A Temporal-Logic Approach (Studies on New Music Research, 4) by Alan Marsden, 2000-01-01 Temporal Logic (Library of exact philosophy) by Nicholas Rescher, 1971-06 Temporal Logic: Mathematical Foundations and Computational Aspects: Volume 2 by Dov. M. Gabbay, Mark A. Reynolds, et all 2000-05-15 Verifying Concurrent Processes Using Temporal Logic (Lecture Notes in Computer Science) by Brent T. Hailpern, 1982-07 Temporal Logic: First International Conference, Ictl '94 Bonn, Germany, July 11-14, 1994 : Proceedings (Lecture Notes in Computer Science) by Dov M. Gabbay, 1994-06 Integrating Functional and Temporal Domains in Logic Design:: The False Path Problem and Its Implications (The Springer International Series in Engineering and Computer Science) by Patrick C. McGeer, Robert K. Brayton, 1991-05-31

lists with details

1. Temporal Logic
   The Stanford Encyclopedia of Philosophy entry on the subject, with a detailed description, application Category Science Math temporal logictemporal logic. The term temporal logic has been Modallogic approachesto temporal logic. Tense Logic. Tense Logic was introduced by Arthur  
   http://plato.stanford.edu/entries/logic-temporal/
   
   Extractions: NOV 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. The logical language of Tense Logic contains, in addition to the usual truth-functional operators, four modal operators with intended meanings as follows:

2. 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 Category Society Philosophy Philosophers Prior, Arthur NormanFoundations of temporal logic – The WWWsite for Prior-studies. You'llbe redirected in 10 seconds. Or you can click below Enter here.  
   http://www.hum.auc.dk/prior/

3. 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
   
   Extractions: 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.

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

5. Temporal Logic
   temporal logic  
   http://www-step.stanford.edu/tutorial/temporal-logic/temporal-logic.html

6. Marking Up Temporal Logic
   First in a series of posts to the www-math mailing list on using TL operators in web pages. Clicking Category Science Math temporal logicPrevNextIndexThread 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
   
   Extractions: [Prev] [Next] [Index] [Thread] 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 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

7. BRICS Lecture Series, Abstracts, 1997
   A survey of the field by Jan Chomicki and David Toman. From the 1997 BRICS Lecture Series.Category Science Math temporal logic temporal logic in Information Systems. November 1997. viii+42 pp. Abstract Temporallogic is obtained by adding temporal connectives to a logic language.  
   http://www.brics.dk/LS/97/Abs/BRICS-LS-97-Abs/
   
   Extractions: 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.

8. Springer LINK: Formal Aspects Of Computing - Abstract Volume 12 Issue 1 (2000) P
   A flexible notation for both propositional and firstorder reasoning about periods of time found in Category Science Math temporal logic Composing and Refining Dense temporal logic Specifications. Antonio Cau. Keywordstemporal logic; Compositionality; Refinement. Article in PDF format (206 KB).  
   http://link.springer.de/link/service/journals/00165/bibs/0012001/00120052.htm
   
   Extractions: Received January 1997 / Accepted in revised form April 2000 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: Temporal logic; Compositionality; Refinement

9. 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
   
   Extractions: Last modified 13 January 2003 THE TLA+ BOOK IS NOW AVAILABLE. Click Here THE NEW TLA+ TOOLS ARE NOW AVAILABLE. Click Here 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 Introduction to TLA 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.

10. TLA - The Temporal Logic Of ActionsTLA - The Temporal Logic Of Actions Last Modi
    Specification IS Verification. Automatic verification of protocols and Reactive systems using temporal logic temporal logic Time is of the Essence. temporal logic. temporal logic. Metric temporal logic temporal logic with real  
    http://www.research.digital.com/SRC/personal/Leslie_Lamport/tla/tla.html
    
    Extractions: Last modified 13 January 2003 THE TLA+ BOOK IS NOW AVAILABLE. Click Here THE NEW TLA+ TOOLS ARE NOW AVAILABLE. Click Here 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 Introduction to TLA 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.

11. 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/

12. Foundations Of Temporal Logic - The WWW-site For Prior-studies
    Foundations of temporal logic – The WWWsite for Prior-studies.This WWW-site is devoted to the Life and Work of Arthur Norman  
    http://www.hum.auc.dk/prior/index2.htm

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

14. Starlog At Waikato Department Of Computer Science
    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
    
    Extractions: Search Home People Research ... Facilities John Cleary Roger Clayton Bernhard Pfahringer Mark Utting Starlog is a declarative temporal logic programming language for general purpose programming, for simulation, and for modelling reactive systems. A Starlog program consists of two components: a set of timed facts describing a history of the Starlog world up to this point, and a set of temporal logic rules describing how to compute a new state of the world from facts true in the previous and current states of the world. For example, here are some rules that compute prime numbers. When this program is executed, the rules generate facts like prime@2, prime@3, mult@4, prime@5, and so on. prime@N = 2, not(mult@N). mult@I*J = I. Starlog repeatedly applies the program rules to the current history of the world, thereby generating a new history of the world, which gets fed back into the next iteration of the loop. The history of the world includes facts corresponding to I/O operations and to the values of program variables of conventional programming languages. As a result, Starlog programs have a natural, declarative specification of I/O and destructive update.

15. 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
    
    Extractions: 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 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.

16. Julian Bradfield's Home Page
    University of Edinburgh Verification using temporal logics, computer-aided verification of potentially infinite systems, logics for true concurrency.  
    http://www.dcs.ed.ac.uk/~jcb/
    
    Extractions: I am a Lecturer in Computer Science here at the University of Edinburgh. My first degree was in Mathematics, from Cambridge, and after doing the conversion Diploma in Computer Science, I came to Edinburgh for my Ph.D. After completing this, I was a postdoc for a couple of years, and since 1992 I've been a lecturer. From 1997 to 2002, I was an EPSRC Advanced Research Fellow. I was Programme Chair for Computer Science Logic 2002. If you're looking for archived information, here is the CSL'02 home page If you're interested in my research, please go to my research page In 2002-3, I am lecturing: If you're looking for the TolkLang archive, please go to

17. 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/

18. Re: Marking Up Temporal Logic
    PrevNextIndexThread Re Marking up temporal logic. Warren, What operatorsdo you need? I am unfamiliar with first order temporal logic.  
    http://lists.w3.org/Archives/Public/www-math/msg00499.html
    
    Extractions: [Prev] [Next] [Index] [Thread] http://www.webeq.com , and make your images. (Unless temporal logic uses unusual operators...) Also, Mathematica 3.0 and higher can be used as high-quality equation editor to make GIFs if you have it available to you. Back in the TeX world, there is the venerable LaTeX2HTML program, but unless you have it installed and are familiar with it, it is definitely not a *quick* way of making a couple of equation images. another interesting alternative if you want to stick with TeX, but don't want to mess with images or a mess of software installation, is TeX2HTML, which uses a combination of HTML hacks and symbol fonts to fake equations in pure HTML. It usually turns out pretty well, and you can try it free for 21 days. I think you can even send in your HTML files with embedded TeX by email and get your processed files back by email. The URL is http://www.tex2html.com

19. 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/
    
    Extractions: 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: Temporal logic: Semantic models of embedded systems and VLSI New address: Informatics and Mathematical Modelling

20. 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/
    
    Extractions: CS 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 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

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

1-20 of 104    1  | 2  | 3  | 4  | 5  | 6  | Next 20