Geometry.Net - Science: Temporal Logic


Home - Science - Temporal Logic

e99.com Bookstore

Images

Newsgroups

61-80 of 110 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

Temporal Logic: more books (100)

Automatic and hierarchical verification of asynchronous circuits using temporal logic by B Mishra, 1983
Temporal-logic theorem proving (Report / Stanford University. Dept. of Computer Science) by MartiÌn Abadi, 1987
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
Characterizing Kripke structures in temporal logic (Research paper. Carnegie-Mellon University. Computer Science Department) by M. C Browne, 1987
Compiling temporal logic specifications into observers =: Compiler des speÌcifications exprimeÌes en logique temporelle vers des observateurs (Rapports ... Recherche en Informatique et en Automatique) by Omar Drissi-Kaitouni, 1988
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
Gorski: Temporal Logic
Avoiding the state explosion problem in temporal logic model checking algorithms (Research paper. Carnegie Mellon University. Computer Science Dept) by E. M Clarke, 1987
Temporal logics, automata, and classical theories for defining real-time languages (Report) by T. A Henzinger, 1999
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

lists with details

(Drusinsky D., Shing M.T.) Monitoring Temporal Logic Specifications Combined Wit
get Monitoring temporal logic Specifications Combined with Time Series Constraints. Doron Drusinsky (Naval Postgraduate School and TimeRover, Inc.
http://www.jucs.org/jucs_9_11/monitoring_temporal_logic_specification
(Krebs A., Ruf J.) Optimized Temporal Logic Compilation
get Optimized temporal logic Compilation. Andreas system. Keywords verification, simulation, systemLevel, temporal logic, emulation.
http://www.jucs.org/jucs_9_2/optimized_temporal_logic_compilation

Extractions: ruf@informatik.uni-tuebingen.de Abstract: Verification and validation are the major tasks during the design of digital hardware/software systems. Often more than 70% of the development time is spent for locating and correcting errors in the design. Therefore, many techniques have been developed to support the debugging process. Recently, simulation and test methods have been accompanied by formal methods such as equivalence checking and property checking. However, their industrial applicability is currently restricted to small or medium sized designs or to a specific phase in the design process. Therefore, simulation is still the most commonly applied verification technique. In this paper, we present a method for asserting temporal properties during simulation and also during emulation of hardware prototypes. The properties under verification are efficiently translated into an intermediate language (of a virtual machine). This intermediate representation can then be interpreted during simulation. We may also produce executable checkers running in parallel to the simulation. Furthermore, we are able to translate the properties into synthesizable hardware modules which can then be used during system emulation on FPGA-based emulators or as self test components checking the functionality during the lifetime of the system.
Temporal Mosaic Decider Page
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
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.
CULT Online
Other papers online The Complexity of the temporal logic with Until over General Linear Time. Mark Reynolds Abstract. It is shown
http://www.it.murdoch.edu.au/~mark/research/online/cult.html

Extractions: Other papers online Mark Reynolds It is shown that the decision problem for the temporal logic with the strict until operator over general linear time is PSPACE-complete. This shows that it is no harder to reason with arbitrary linear orderings than with discrete linear time temporal logics. New techniques are used to give a PSPACE procedure for the logic. Postscript version 8/3/2002 A full version was first submitted May 1999. Accepted to appear in Journal of Computer and System Sciences in July 2002. author="M. Reynolds",
The Founder Of Modern Temporal Logic
The Founder of Modern temporal logic AN Prior (19141969). He revived the medieval 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
Using Temporal Logic Operators In Actions :: Actions (Stateflow)
Using temporal logic Operators in Actions. temporal logic operators are Boolean operators that operate on recurrence counts of Stateflow events.
http://www.mathworks.com/access/helpdesk/help/toolbox/stateflow/action42.html
Temporal Logic Events :: Actions (Stateflow)
temporal logic Events. Although Hence, Stateflow supports the equivalent event 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]
ESSLLI 2003 - Workshop: Workshop On Interval Temporal Logics And Duration Calcul
Language and Information ESSLLI2003 August 18-29, 2003, Vienna, Austria, http//www.logic.at/esslli03/ WORKSHOP ON INTERVAL temporal logicS AND DURATION
http://www.logic.at/esslli03/giveabs.php?43
Linear Temporal Logic
Linear temporal logic. This contribution 6166). Date July 2002. Keywords temporal logic, infinite transition systems, coinduction. Warning ! This
http://pauillac.inria.fr/coq/contribs/LTL.html

Extractions: This contribution contains a shallow embedding of Linear Temporal Logic (LTL) based on a co-inductive representation of program executions. Temporal operators are implemented as inductive (respectively co-inductive) types when they are least (respectively greatest) fixpoints. Several general lemmas, that correspond to LTL rules, are proved. Download (archive compatible with Coq V8.0) Author: Solange COUPET-GRIMAL Institution: Laboratoire d'Informatique Fondamentale de Marseille (LIF, UMR 6166). Date: July 2002 Keywords: temporal logic, infinite transition systems, co-induction. Warning ! This contribution is based upon the following other contributions: relations The README file of the contribution: This page was automatically generated from this description file
Online Encyclopedia - Temporal Logic
Encyclopedia Entry for temporal logic. For more information, see Anthony Galton, 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.
Interval Temporal Logic
Interval temporal logic. Interval temporal logic (ITL) is an important class of temporal 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.
Computer Science: Publication: A Tableaux Method For Interval Temporal Logic Wit
A Tableaux Method for Interval temporal logic with Projection, Howard Bowman and Simon J. Thompson, 1998, Computer Science, University of Kent at Canterbury.
http://www.cs.kent.ac.uk/pubs/1998/528/

Extractions: In TABLEAUX'98, International Conference on Analytic Tableaux and Related Methods , volume 1397 of Lecture Notes in AI , pages 108-123. Springer-Verlag, May 1998. Tableau Methods have been extensively investigated for standard (infinite) temporal logics and there has been some tableau work in the interval temporal logic setting. However, this work has not considered the important projection operator. This paper responds to this deficiency by defining just such a tableau algorithm which handles the projection operator. Download publication 91 kbytes (gzipped PostScript) Enquiries about UKC Computing Laboratory publications should be made to: Publications Officer
Temporal Logic :: Online Encyclopedia :: Information Genius
temporal logic. Online Encyclopedia temporal logic is any approach to the representation of temporal information within a logical framework.
http://www.informationgenius.com/encyclopedia/t/te/temporal_logic.html

Extractions: Temporal logic is any approach to the representation of temporal information within a logical framework. The term is also used more narrowly to refer to the modal logic approach introduced by Arthur Prior in the under the name "tense logic". This content from wikipedia is licensed under the GNU Free Documentation License Power Supplies Hardware Information Law Advice
Temporal Logic - InformationBlast
temporal logic Information Blast. temporal logic. In a temporal logic, statements can have a truth value which can vary in time.
http://www.informationblast.com/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 Temporal logic was first studied in depth by Aristotle , and his writings are filled with a crude form of first order temporal modal binary logic. Any logic which uses the existential quantifier or the universal quantifier , is said to be a first order logic . Any logic which views time as a sequence of states , is a temporal logic, and any logic which uses only two truth values, is a binary logic. Consider the statement, "I am hungry." Though its meaning is constant in time, the truth value of the statement can vary in time. Sometimes the statement is true, and sometimes the statement is false, but the statement is never true and false simultaneously. In a temporal logic, statements can have a truth value which can vary in time. Constrast this with an atemporal logic, which can only handle statements whose truth value is constant in time. The three basic temporal operators are: Always, sometimes, and never. For more information, see:
Controller Design From Temporal Logic: Undecidability Need Not Matter
Controller Design from temporal logic Undecidability Need Not Matter. by Martin Fränzle Ph.D. thesis, Technische Fakultät der
http://www.imm.dtu.dk/~mf/diss.html

Extractions: online Abstract: However, we claim that the impact of these findings goes much deeper than just Duration Calculus. Formal methods are intended to be mathematically rigorous design instruments, aiming at subjecting the development process to mathematical verification. Hence, the only rationale for taking idealizations in the formal representation of a design problem is that the gains in tractability of the problem may outweigh the loss of accuracy. However, if such semantic idealizations complicate rather than simplify the design problem then there is no justification for taking them. Thus, our results may be interpreted as an indication that liberating formal models of embedded control from some of the idealizations that have been imposed for smoothening the models may enhance both their accuracy and their tractability. As this implies that similar analyses of other formal models of embedded-system specification and implementation may yield similar gains, there is quite some potential for extending our results to other temporal logics or even for exploiting them in high-level hardware synthesis technologies. Last modified: Wed, Apr. 8, 1998
Reification In Temporal Logics
Key Words temporal logic, reification, logical formalism. The initial language on which McDermott s temporal logic is based is classical firstorder logic.
http://cms1.gre.ac.uk/rae/CSabstracts/aireview.htm

Extractions: Reified Temporal Logics: An Overview J. MA and B. KNIGHT University of Greenwich, London SE18 6PF, U.K. Abstract There are three main approaches to the representation of temporal information in AI literature: the so-called method of temporal arguments that simply extends functions and predicates of first-order language to include time as the additional argument; modal temporal logics which are extensions of the propositional or predicate calculus with modal temporal operators; and reified temporal logics which reify standard propositions of some initial language (e.g., the classical first-order or modal logic) as objects denoting propositional terms. The objective of this paper is to provide an overview on the temporal reified approach by looking closely at some representative existing systems featuring reified propositions, including those of Allen, McDermott, Shoham, Reichgelt, Galton, and Ma and Knight. We shall demonstrate that, although reified logics might be more complicated in expressing assertions about some given objects with respect to different times, they accord a special status to time and therefore have several distinct advantages in talking about some important issues which would be difficult (if not impossible) to express in other approaches. Key Words: temporal logic, reification, logical formalism
Www.cms.dmu.ac.uk/~cau/itlhomepage/
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://www.cms.dmu.ac.uk/~cau/itlhomepage/
Temporal Logic Innovations And Patents
temporal logic Innovations and Patents. © 2002, XQ23.COM Research (air.xq23.com). More information on temporal logic and temporal logic Research References.
http://www.air.xq23.com/energy_science_resources/Temporal_Logic.html
:: Ez2Find :: Temporal Logic
Guide temporal logic, Global Metasearch Any Language Guides, temporal logic. ez2Find Home Directory Science Math
http://ez2find.com/cgi-bin/directory/meta/search.pl/Science/Math/Logic_and_Found

Extractions: Any Language English Afrikaans Arabic Bahasa Melayu Belarusian Bulgarian Catala Chinese Simplified Chinese Traditional Cymraeg Czech Dansk Deutsch Eesti Espanol Euskara Faroese Francais Frysk Galego Greek Hebrew Hrvatski Indonesia Islenska Italiano Japanese Korean Latvian Lietuviu Lingua Latina Magyar Netherlands Norsk Polska Portugues Romana Russian Shqip Slovensko Slovensky Srpski Suomi Svenska Thai Turkce Ukrainian Vietnamese Mode
Temporal Logic
temporal logic. Branching time logics have The expressiveness of a temporal logic is a lively area of study. In branching time temporal
http://www.cs.man.ac.uk/fmethods/people/wprm/subsectionstar3_4_2.html

Extractions: Next: Process Algebras Up: Research Profile Previous: Research Direction Branching time logics have been long established as important tools for verifying finite state concurrent systems. The expressiveness of a temporal logic is a lively area of study. In branching time temporal logic a hierarchy of $CTL^*$ sub-logics has been discovered in respect of their expressive capabilities.

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 110 Back | 1 | 2 | 3 | 4 | 5 | 6 | Next 20