Home  - Science - Logic Temporal

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

61-80 of 109    Back | 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

Logic Temporal:     more books (100)

Decision procedures and expressiveness in the temporal logic of branching time (Technical report. University of Texas at Austin. Dept. of Computer Sciences) by E. Allen Emerson, 1985 Temporal-logic theorem proving (Report / Stanford University. Dept. of Computer Science) by Martín Abadi, 1987 Characterizing Kripke structures in temporal logic (Research paper. Carnegie-Mellon University. Computer Science Department) by M. C Browne, 1987 Design verification of sequential machines based on a model checking algorithm of e-free regular temporal logic (Research paper. Carnegie Mellon University. Computer Science Dept) by Hiromi Hiraishi, 1988 Problems concerning fairness and temporal logic for conflict-free petri nets (Technical report. University of Texas at Austin. Dept. of Computer Sciences) by Rodney R Howell, 1987 On the eventuality operator in temporal logic (Technical report. Yale University. Dept. of Computer Science) by Aravinda Prasad Sistla, 1987 Avoiding the state explosion problem in temporal logic model checking algorithms (Research paper. Carnegie Mellon University. Computer Science Dept) by E. M Clarke, 1987 A really temporal logic (Report / Stanford University. Computer Science Dept) by Rajeev Alur, 1989 Temporal logics for abstract semantics (Technical report series. University of Manchester. Dept. of Computer Science) by Michael Fisher, 1987 Temporal logic for proof-carrying code ([Research paper] / Carnegie Mellon University. School of Computer Science) by Andrew Bernard, 2002 Synthesis of hardware elements from propositional temporal interval logic (Technical report. Pennsylvania State University. Dept. of Computer Science) by A. A Aaby, 1988 Semantics for reified temporal logic (Research paper. University of Edinburgh. Department of Artificial Intelligence) by Han Reichgelt, 1986 On parallel programming methodology in GHC: Experience in programming of a proof procedure of temporal logic (Technical report. Institute for New Generation Computing Technology) by Kazuko Takahashi, 1986 Temporal logic programming is complete and expressive (Report / Stanford University. Computer Science Dept) by Marianne Baudinet, 1988

lists with details

61. HughesNet ODP Directory Science Math Logic And Foundations
    Kono s temporal logic Related Information A collection of papers by Shinji Kono onthe Interval temporal logic. url plato.stanford.edu/entries/logictemporal/.  
    http://directory.hughesnet.net/directory/index/Science/Math/Logic_and_Foundation

62. Citations The Temporal Logic Of Programs - Pnueli (ResearchIndex)
    A. Pnueli. The temporal logic of programs. In Proc. This logic usestemporal modalities for referencing to past or future events.  
    http://citeseer.ist.psu.edu/context/18303/0

63. Citations Discovering Unexpected Patterns In Temporal Data Using
    Discovering Unexpected Patterns in temporal Data Using temporal logic. Discoveringunexpected patterns in temporal data using temporal logic.  
    http://citeseer.ist.psu.edu/context/1697852/0

64. Temporal Logic
    temporal logic. We should mention that temporal logic is by no means theonly tool used in AI for enabling reasoning about time and change.  
    http://www.rpi.edu/~brings/LOG AI/lai/node8.html

65. The Founder Of Modern Temporal Logic
    The Founder of Modern temporal logic AN Prior (19141969). He revived themedieval attempt at formulating a temporal logic for natural language.  
    http://www.kommunikation.aau.dk/prior/on_prior/founder.htm
    
    Extractions: A. N. Prior (1914-1969) Prior went to Otago University at Dunedin in 1932. He set out to study medicine, but after a short time he instead went into philosophy and psychology. In 1934 he attended Findlay's courses on ethics and logic. Through Findlay Prior became interested in the history of logic and was introduced to Prantl's textbooks. His M.A. thesis was devoted to this subject. In 1949 Prior wrote about Findlay: "I owe to his teaching, directly or indirectly, all that I know of either Logic or Ethics". Prior was brought up as a Methodist, but while he was a student he came to consider Methodistic theology too unsystematic, and he became a Presbyterian. He also became a very active member of the Student Christian Movement (SCM). In the years about 1940 he found himself in a crisis of belief. During these years he wrote the article 'Can religion be discussed?'(1942), in which he advocated an almost atheistic position. This view, however, does not seem to have lasted very long. He continued to treasure his theological library and to join the work of the SCM. Later in his life, however, he became an agnostic. In 1943 he married Mary. From 1946 to 1958 he taught philosophy at Canterbury University College in New Zealand. In 1953 he became a professor of philosophy. In 1949 his book

66. Visual Specification Of Branching Time Temporal Logic
    Talk. Visual Specification of Branching Time temporal logic.  
    http://kogs-www.informatik.uni-hamburg.de/~haarslev/vl95www/talks/T36.html

67. Online Encyclopedia - Temporal Logic
    Encyclopedia Entry for temporal logic. For more information, see AnthonyGalton, temporal logic in the Stanford Encyclopedia of Philosophy.  
    http://www.yourencyclopedia.net/Temporal_logic.html
    
    Extractions: In logic , the term temporal logic is used to describe any system of rules and symbolism for representing, and reasoning about, propositions qualified in terms of time. It is sometimes also used to refer to tense logic , a particular modal logic -based system of temporal logic introduced by Arthur Prior in the For more information, see: This is a stub article . You can help Wikipedia by improving it. Home Alphabetical Index See our sister sites: Find a Resume Diplomat City Your Quotations Your Lookup ... Your Dogs Content on this site is provided for informational purposes only. We do not accept responsibility for any loss, injury or inconvenience sustained by any person resulting from information published on this site.

68. Modal And Temporal Logic - Course Details - Computing - Imperial College London
    Modal and temporal logic. Lecturers Ian Hodkinson (homepage) , MarekSergot (homepage) For course notes click on the lecturers homepages.  
    http://www.doc.ic.ac.uk/teaching/coursedetails/499
    
    Extractions: Skip over navigation Quick Navigation Imperial home page A-Z of Departments Courses Research Alumni Faculty of Engineering Faculty of Life Sciences Faculty of Medicine Faculty of Physical Sciences Business School Spectrum (restricted to College users) People finder Help Note: Your browser does not support javascript or you have javascript turned off. Although this will not affect your accessibility to the content of this site, some of the advanced navigation features may not be available to you. Home Teaching Course Details Modal and Temporal Logic Note: Some of the graphical elements of this site are only visible to browsers that support accepted web standards . The content of this site is, however, accessible to any browser or Internet device. Lecturers: Ian Hodkinson homepage Marek Sergot homepage

69. 5.3.2.5 Specification By Temporal Logic
    Annex 1, 5.3.2.5 Specification by temporal logic, The Specification by temporallogic is a formal specification describing the program via temporal logic.  
    http://www.informatik.uni-bremen.de/gdpa/methods/m-stl.htm
    
    Extractions: Annex 1 5.3.2.5 Specification by Temporal Logic Spezifikation mittels temporaler Logik Contents 1 Identification/Definition of the Method 2 Brief Characteristic of the Method 3 Application of the Method in the V-Model 4 Interfaces ... 6 Literature /Kroeger, 1987/ chap. 4 The Specification by Temporal Logic is a formal specification describing the program via temporal logic. Temporal logic concerns with statements being dependent of the time. Using temporal logic statements about certain program states can be made but also about the program sequence. Every state corresponds to a discrete moment. The Specification by Temporal Logic may be applied for the description of the operation behavior on every level of abstraction. This specification also is ideal for the description of timing connections of programs. There are interfaces to DVER - Design Verification PVER - Program Verification and ACC - Analysis of Covert Channels - not applicable - /Baader, 90/

70. Using Temporal Logic Operators In Actions :: Actions (Stateflow)
    Using temporal logic Operators in Actions. temporal logic operators are Booleanoperators that operate on recurrence counts of Stateflow events.  
    http://www.mathworks.com/access/helpdesk/help/toolbox/stateflow/action42.html

71. Temporal Logic Events :: Actions (Stateflow)
    temporal logic Events. Although Hence, Stateflow supports the equivalentevent notation (see temporal logic Events). after(10, CLK). Note  
    http://www.mathworks.com/access/helpdesk/help/toolbox/stateflow/action49.html
    
    Extractions: Although temporal logic does not introduce any new events into a Stateflow model, it is useful to think of the change of value of a temporal logic condition as an event. For example, suppose that you want a transition to occur from state A exactly 10 clock cycles after activation of the state. One way to achieve this would be to define an event called ALARM and to broadcast this event CLK events after state A is entered. You would then use ALARM as the event that triggers the transition out of state A An easier way to achieve the same behavior is to set a temporal logic condition on the CLK event that triggers the transition out of state A. Note that this approach does not require creation of any new events. Nevertheless, conceptually it is useful to think of this expression as equivalent to creation of an implicit event that triggers the transition. Hence, Stateflow supports the equivalent event notation (see Temporal Logic Events Note that the event notation allows you to set additional constraints on the implicit temporal logic "event," for example, after(10, CLK)[temp == COLD]

72. Modal Temporal Logic
    Modal temporal logic. Research applications. We have developed an efficientexecutional model for an interval based linear modal temporal logic.  
    http://www.comp.brad.ac.uk/research/ai/temporal.html

73. Zeal.com - United States - New - Library - Sciences - Mathematics - Logic Theory
    A great resource for United States New - Library - Sciences - Mathematics - logicTheory - Disciplines Methods - temporal logic. temporal logic Preview  
    http://zeal.com/category/preview.jhtml?cid=10037580

74. TCS - Studies - T-79.146 Logic In Computer Science: Special Topics I
    Special Issue on Industrial Practice of Formal Hardware Verification Interestingbooks on modal logic, temporal logic and verification of reactive systems.  
    http://www.tcs.hut.fi/Studies/T-79.146/
    
    Extractions: Previous years: [ Spring 2003 Spring 2002 Spring 2001 Spring 2000 ... Spring 1998 This is an advanced course on logic and its applications in computer science and engineering. Subjects covered this year are: modal logics (syntax, semantics, proof theory and computational properties) and applications of temporal logic in concurrent and distributed systems. NEWS : Remember to give feedback about the course by filling out palautelomake (in Finnish) a feedback form (in English)

75. Model Theory Of Temporal Logic
    Model Theory of temporal logic. Part of this project is carried out aspart of the Graduiertenkolleg on language, information, and logics.  
    http://www.pst.informatik.uni-muenchen.de/projekte/proj-desc/modelltheorie-e.htm

76. Logic And Language Links - Temporal Logic (2)
    TOP You have selected the concept temporal logic (2) temporal logic (2)is a subclass of logic (1) subtopic of knowledge representation.  
    http://staff.science.uva.nl/~caterina/LoLaLi/Pages/167.html

77. Www.cms.dmu.ac.uk/~cau/itlhomepage/
    Quantitative temporal logics Like monadic logic, temporal logic is unfit to argue about measuringtime. An extension of the logic had to be found which nonetheless  
    http://www.cms.dmu.ac.uk/~cau/itlhomepage/

78. Interval Temporal Logic
    Interval temporal logic. Interval temporal logic (ITL) is an important class oftemporal logic which was initally devised by Ben Moskowski in the 1980 s.  
    http://www.cs.kent.ac.uk/people/staff/hb5/interval.html
    
    Extractions: Interval Temporal Logic (ITL) is an important class of temporal logic which was initally devised by Ben Moskowski in the 1980's. Standard temporal logics (see e.g. this page ) are defined over infinite state models, for example, the models for Manna and Pnueli Linear Time Temporal Logic are infinite state sequences. However, in interval temporal logic the model theory is restricted to finite state sequences, called intervals (although, supporting infinite state sequences is currently being investigated). There are a number of reasons for being interested in such logics. One reason is that interval temporal logic lends itself to execution. This is apparent from Moskowski's initial work. In addition, a number of interesting and powerful operators arise naturally from ITL. In fact, it is straightforward to derive operators very like the constructs of imperative programming (e.g. assignment, conditionals, iteration etc). This then yields the possibility that abstract specifications and concrete implementations can be realised in the same notation, with refinement mappings between. An additional aspect of interval temporal logic is that it provides a very simple real-time model in which one unit of time is past when moving from state to state. Consequently, timings can be obtained by measuring interval lengths.

79. Moshe Y. Vardi - Publications
    Enhanced Vacuity Detection in Linear temporal logic (CAV 03 paper with R.Armoni, L. Fix, A. Flaisher, O. Grumberg, N. Piterman, A. Tiemeyer).  
    http://www.cs.rice.edu/~vardi/papers/
    
    Extractions: The articles posted here consist of preliminary versions of articles that are about to be published or have been published in journals or conference proceedings. For final versions, please see cited journals or proceedings. If you'd like to be notified when new articles are posted here, click here. Regular Vacuity (Long version of CONCUR'04 Submission). GSTE Is Partitioned Model Checking (CAV'04 paper with R. Sebastiani, E. Singerman, and S. Tonetta). Verifying omega-Regular Properties of Markov Chains (CAV'04 paper with D. Bustan and S. Rubin). Search vs. Symbolic Techniques in Satisfiability Solving (SAT'04 paper with G. Pan). Complete Axiomatizations for Reasoning About Knowledge and Time (SICOMP paper with J.Y. Halpern and R. van der Meyden). The phase transition in the random 1-3-HornSAT problem (Special Volume on Computational Complexity and Statistical Physics paper with D. Demopoulos). From Complementation to Certification (TACAS'04 paper with O. Kupferman). Projection Pushing Revisited (EDBT04'04 paper with B. McMahan, G. Pan, and P. Porter).

80. Temporal Mosaic Decider Page
    This program uses mosaics to decide the satisfiability (or otherwise) of formulasin the temporal logic with Prior s F and P over the class of all linear flows  
    http://www.it.murdoch.edu.au/~mark/research/online/demos/tempmos/TempMosApplet.h
    
    Extractions: This program uses mosaics to decide the satisfiability (or otherwise) of formulas in the temporal logic with Prior's F and P over the class of all linear flows of time. Details of the idea can be found in this paper by Marx, Mikulas and Reynolds. Press the button below to run the program on your computer: it runs as a Java applet from within this page. You will need to enter the formula using the following syntax: Note that the running time is roughly exponential in the length of the formula entered. Formulas of length less than 20 are decided almost immediately. Formulas of length greater than 27 may take hours. Much longer formulas may cause all sorts of memory overflow errors. Have fun.

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

61-80 of 109    Back | 1  | 2  | 3  | 4  | 5  | 6  | Next 20