Geometry.Net - Science: Temporal Logic

Temporal Logic And Semidirect Products: An Effective Characterization Of The Unt
temporal logic and Semidirect Products An Effective Characterizationof the Until Hierarchy. Denis Thérien, Thomas Wilke. Abstract.
http://epubs.siam.org/sam-bin/dbq/article/32277

Extractions: pp. 777-798 Abstract. We reveal an intimate connection between semidirect products of finite semigroups and substitution of formulas in linear temporal logic. We use this connection to obtain an algebraic characterization of the until hierarchy of linear temporal logic. (The k th level of that hierarchy is comprised of all temporal properties that are expressible by a formula of nesting depth k in the until operator.) Applying deep results from finite semigroup theory we are able to prove that each level of the until hierarchy is decidable. By means of EhrenfeuchtFraissé games, we extend the results from linear temporal logic over finite sequences to linear temporal logic over infinite sequences. Key words. linear temporal logic, until hierarchy, substitution, finite semigroups, pseudovarieties of semigroups, aperiodic semigroups, semidirect products AMS Subject Classifications PII Retrieve PostScript document ( 32277.ps
People In Temporal Logic
People in temporal logic. A list of Personal WWW pages of researchesin temporal logic. This is my personal collection of links to
http://www.doc.mmu.ac.uk/STAFF/A.Bolotov/LINKS/people.html
499 Modal & Temporal Logic
499 Modal and temporal logic. 4th year/MAC course. Lecturers Michael Huthand Marek Sergot. Michael Huth gives the first half of the course.
http://www-lp.doc.ic.ac.uk/UserPages/staff/mjs/teaching/499.html
Temporal Logic Resources
temporal logic Resources. Appeared in Volume 6/2, May 1993 Keywords temporal. Sometimeago, I asked can anyone point me to a very good text on temporal logic?
http://www-lp.doc.ic.ac.uk/UserPages/staff/ft/alp/net/exts/temporal.html

Extractions: 27th January 1993 Sometime ago, I asked: can anyone point me to a very good text on temporal logic? Does anyone know of a temporal logic interpreter? Something along the lines of Prolog, or an extension? This is a summary of the responses I received. From: cmenzel@kbssun1.tamu.edu (Chris Menzel) J. van Bentham, The Logic of Time, Reidel, 1983 A model-theoretic investigation into the varieties of temporal ontologies and their logics. kono@csl.sony.co.jp Robert Goldblatt, CSLI Lecture Notes, Logic of Time and Computation, CSLI, Vol. 7, 1987 There are many temporal logic interpreters: 1.Tokio, based on interval temporal logic, which I wrote. It is supported by both an interpreter and a compiler. It is close to Tempura, but supports non-deterministic execution. M. Fujita and S. Kono and H. Tanaka, Tokio: LP Language based on Temporal Logic and its compilation to Prolog, Proc. of Int. Conf. on LP, London, July 1986 2. Temporal Prolog.
Temporal Logic As A Programming Language
temporal logic as a Programming Language. The framework developed for propositionaltemporal logic is extended to firstorder temporal logic.
http://siskin.pst.informatik.uni-muenchen.de/~merz/papers/diss.html
Efficiently Executable Temporal Logic Programs
Efficiently executable temporal logic programs. Abstract We identifya subset of firstorder LTL (temporal logic of linear time) that
http://siskin.pst.informatik.uni-muenchen.de/~merz/papers/IJCAI93.html
AIDAM Special Issue: Temporal Logic In Engineering
CALL FOR PAPERS. Special Issue on temporal logic in Engineering. GuestEditors Brian Knight and Ephraim Nissan Deputy Guest Editor Jixin Ma.
http://www.gre.ac.uk/~E.Nissan/call.aiedam.temporal.logic.html

Extractions: ENGINEERING DESIGN, ANALYSIS AND MANUFACTURING. Temporal logic within AI is now a mature paradigm, with an extensive literature on theory, and a considerable panoply of published applications. Paper submissions are solicited for a special issue on applications of temporal logic to any branch of engineering. Papers should make a substantial contribution to the application domain, to provide insights other than rote on temporal logic itself, and to appeal to a scholarly readership of engineers or computer scientists. Refereeing will evaluate the quality of submissions in respect of both the application domain, and computer science. AIEDAM: Artificial Intelligence for Engineering Design, Analysis and Manufacturing is an archival research journal that is intended to reach two audiences: engineers and designers who see AI technologies as powerful means for solving difficult engineering problems; and researchers in AI and computer science who are interested in applications of AI and in the theoretical issues that arise from such applications. Original articles are specifically sought by AIEDAM, that develop new and interesting applications based on the most up-to-date research in all branches and phases of engineering, including analysis, synthesis and design; manufacturing and assembly; and concurrent engineering. The journal is interested in the use of AI in planning, design, analysis, simulation, spatial reasoning and graphics, manufacturing, assembly, process planning, scheduling, numerical analysis, and optimization. reas of special interest include: knowledge-based (expert) systems for engineering, including knowledge acquisition and representation, control, and system architectures; theo- retical work on the modeling of engineering problem-solving and design processes; the integration of AI-based techniques with numerical analysis tools, graphics and solid modeling packages, and engineering databases; and engineering applications of knowledge-based vision and of natural language processing.
QSL: Temporal Logic
temporal logic. December 10, 2002. 11h00, Break, 11h20, temporal logic with ForgettablePast François Laroussinie, LSV, Ecole Normale Supérieure, Cachan
http://www.loria.fr/~merz/events/qsl021012/

Extractions: directions Organizers: and Stephan Merz The logic of time has its roots in philosophy and linguistics. Its application to specification and reasoning about computer-based systems is mainly due to Amir Pnueli's insight (published in his FOCS 1977 paper "The temporal logic of programs") that it provides relevant abstractions to describe runs of computer programs, and in particular of reactive systems . One of the practically most relevant discoveries has been the decidability of the model checking problem of standard propositional temporal logics over finite-state Kripke structures, leading to important advancements in the field of automatic verification and debugging of reactive systems, now routinely used in the herdware and telecommunication industries. This seminar is intended to review and discuss some recent developments as well as lessons learnt at the interface of theory and practice. Registration expired Welcome Automata and Games for Synthesis
On The Expressive Power Of Temporal Logic For Finite Words
Translate this page On the expressive power of temporal logic for finite words. J. COHEN,D. PERRIN et JE PIN. Résumé On étudie le pouvoir d'expression
http://www.liafa.jussieu.fr/~jep/Resumes/CohenPerrinPin.html

Extractions: On the expressive power of temporal logic for finite words n Abstract : We study the expressive power of linear propositional temporal logic interpreted on finite sequences or words. We first give a transparent proof of the fact that a formal language is expressible in this logic if and only if its syntactic semigroup is finite and aperiodic. This gives an effective algorithm to decide whether a given rational language is expressible. Our main result states a similar condition for the "restricted" temporal logic (RTL), obtained by discarding the until operator. A formal language is RTL-expressible if and only if its syntactic semigroup is finite and satisfies a certain simple algebraic condition. This leads to a polynomial time algorithm to check whether the formal language accepted by an n -state deterministic automaton is RTL-expressible. The PostScript file compressed with gzip
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
Linear Temporal Logic
Linear temporal logic. This contribution 6166). Date July 2002. Keywords temporallogic, infinite transition systems, coinduction. Warning ! This
http://coq.inria.fr/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 V7.4) 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
Temporal Logic
Previous temporal database Next Tempura. temporal logic. There aretwo types of temporal logic used branching time and linear time.
http://burks.brighton.ac.uk/burks/foldoc/33/116.htm

Extractions: The Free Online Dictionary of Computing ( http://foldoc.doc.ic.ac.uk/ dbh@doc.ic.ac.uk Previous: temporal database Next: Tempura logic predicate calculus which includes notation for arguing about *when* statements are true. Time is discrete and extends indefinitely into the future. Three prefix operators, represented by a circle, square and diamond mean "is true at the next time instant", "is true from now on" and "is eventually true". x U y means x is true until y is true. x P y means x precedes y. There are two types of formula: "state formulae" about things true at one point in time, and "path formulae" about things true for a sequence of steps. An example of a path formula is "x U y", and example of a state formula is "next x" or a simple atomic formula such at "waiting". "true until" in this context means that a state formula holds at every point in time up to a point when another formula holds. "x U y" is the "strong until" and implies that there is a time when y is true. "x W y" is the "weak until" in which it is not necessary that y holds eventually. There are two types of temporal logic used: branching time and linear time. The basic propositional temporal logic cannot differentiate between the two, though. Linear time considers only one possible future, in branching time you have several alternative futures. In branching temporal logic you have the extra operators "A" (for "all futures") and "E" (for "some future"). For example, "A(work U go_home)" means "I will work until I go home" and "E(work U go_home)" means "I may work until I go home".
Ian Hodkinson: Temporal Logic
Modal/temporal logic. Go to home page My logic. I jointly authored (withGabbay and Reynolds) a research monograph on temporal logic.
http://www.doc.ic.ac.uk/~imh/frames_website/TL.html

Extractions: My research in this area is in expressiveness, axiomatisations (completeness theorems), decidability (of predicate temporal logics), complexity, and some work on fixed-point temporal logic. I jointly authored (with Gabbay and Reynolds) a research monograph on temporal logic Talk at AiML 2002 (Toulouse) (.pdf file of slides) (4 to a page; if it appears upside down, please rotate it in your viewer)
Ian Hodkinson: Temporal Logic Book
temporal logic Mathematical foundations and computational aspects. Volume1. I contributed chapter 2 to this volume (temporal logic and automata).
http://www.doc.ic.ac.uk/~imh/frames_website/TLbook.html
Temporal Logic
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. Modallogic approaches to temporal logic.
http://cd1.fisher.su.oz.au/stanford/entries/logic-temporal/
OUP USA: Temporal Logic
by Subject $160.00 (04) 0198537697 Add to My Basket 1994 Out of Stock Due UnknownS H Standard Oxford Logic Guides 28, temporal logic Mathematical Foundations
http://www.oup-usa.org/isbn/0198537697.html

Extractions: This much-needed book provides a thorough account of temporal logic, one of the most important areas of logic in computer science today. The book begins with a solid introduction to semantical and axiomatic approaches to temporal logic. It goes on to cover predicate temporal logic, meta-languages, general theories of axiomatization, many dimensional systems, propositional quantifiers, expressive power, Henkin dimension, temporalization of other logics, and decidability results. With its inclusion of cutting-edge results and unifying methodologies, this book is an indispensable reference for both the pure logician and the theoretical computer scientist.
OUP USA: Temporal Logic
temporal logic Mathematical Foundations and Computational AspectsVolume 2 DOV. M. GABBAY, King's College London, MARK A. REYNOLDS
http://www.oup-usa.org/isbn/0198537689.html

Extractions: This is the second volume in a series of well-respected works in temporal science and is by the same authors as the first. Volume one dealt primarily with basic concepts and methods, volume two discuses the more applicable aspects of temporal logics. The first four chapters continue the more theoretical presentations from volume one, covering automata, branching time and labelled deduction. The rest of the book is devoted to discussions of temporal databases, temporal execution and programming, actions and planning. With its inclusion of cutting-edge results and unifying methodologies, this book, and its companion are an indispensable reference for both the pure logician and the theoretical computer scientist.
Temporal Logic
temporal logic. A Two useful temporal logics are Computation Tree Logic(called CTL) and Linear temporal logic (called LTL). They
http://nusmv.irst.itc.it/NuSMV/papers/sttt_j/html/node3.html

Extractions: where is a finite set of states, is the set of initial states, and is the transition relation, specifying the possible transitions from state to state. is a function that labels states with the atomic propositions from a given language. Such a tuple is called state transition graph or Kripke structure Temporal logics are used to predicate over the behavior defined by Kripke structures. A behavior in a Kripke structure is obtained starting from a state , and then repeatedly appending states reachable through . We require that the transition relation be total. As a consequence all the behaviors of the system are infinite. Since a state can have more than one successor, the structure can be thought of as unwinding into an infinite tree, representing all the possible executions of the system starting from the initial states. Figure shows a state transition graph and its unwinding from the state labeled with `` A Two useful temporal logics are Computation Tree Logic (called CTL) and Linear Temporal Logic (called LTL). They differ in how they handle branching in the underlying computation tree. In CTL temporal operators it is possible to quantify over the paths departing from a given state. In LTL operators are intended to describe properties of all possible computation paths.
UMCS-94-7-1 A Reified Temporal Logic For Nonlinear Planning
UMCS94-7-1 A Reified temporal logic for Nonlinear Planning (158605 bytes).Y. Zhang and H. Barringer. Keywords temporal logics in AI. AI planning.
http://www.cs.man.ac.uk/cstechrep/Abstracts/UMCS-94-7-1.html
UMCS-89-10-1 Decision Procedures For Temporal Logic
UMCS89-10-1 Decision Procedures for temporal logic. Decision Proceduresfor temporal logic Graham D. Gough. Abstract temporal logic
http://www.cs.man.ac.uk/cstechrep/Abstracts/UMCS-89-10-1.html

Extractions: Graham D. Gough Temporal Logic has been shown, to be a powerful tool for reasoning about concurrent programs. A decision procedure is an algorithm for determining whether a given formula of the logic is valid (i.e. it is true in all interpretations of the logic). This dissertation is a study of decision procedures for various forms of temporal logic; in particular an improved decision procedure is given for a future time Temporal Logic, and a new decision procedure is given for a form of Temporal Logic including past time operators.

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