81. ULB - Service Des Systèmes Distribués Keywords logic, temporal logic, Verification, Hybrid Systems, Complexity.Assistantresearchers. Keywords temporal logic, Verification. http://www.ulb.ac.be/di/ssd/ssd.html

Back to DI Presentation The SSD research activities are mainly in the field of distributed and parallel systems. These are ranging from Formal Verification and Specification of Systems to the Analysis of Scheduling Algorithms. Members Professor Prof. R. Devillers Keywords: Petri Network, Real-Time Systems, Formalism. Lecturers Prof. M. Denecker Keywords: Prof. J. Goossens Keywords: Real-Time Scheduling Theory, Resource-Allocation Problems, Real-Time Uniprocessor Scheduling, Real-time Scheduling on Heterogeneous Multiprocessors, Computer Integrated Manufacturing. Prof. Th. Massart Keywords: Specification, Verification, Real-Time Systems, Process Algebra (CCS, CSP, LOTOS), Correctness preserving transformations , Model Checking of Infinite state systems, Abstract interpretation, Program specialisation. Prof. J.-F. Raskin Keywords: Logic, Temporal Logic, Verification, Hybrid Systems, Complexity. Assistant-researchers Mr. E. Dall'Olio Keywords: Temporal Logic, Verification. Mr. M. De Wulf Keywords: hybrid systems, distribution, communication. Mr. G. Geeraerts

82. Remote.science.uva.nl/~mdr/AiML/Workshops/AiML-2000/aiml2000-cfp3.txt theory of modal and temporal logic, representation of time in natural language semantics,nonmonotonic modal logics, provability logic, temporal databases. http://remote.science.uva.nl/~mdr/AiML/Workshops/AiML-2000/aiml2000-cfp3.txt

Phone: +49 351 463 5489 Fax: +49 351 463 6068 LOCAL ORGANIZERS Frank Wolter, Leipzig Holger Sturm, Leipzig IMPORTANT DATES Submission deadline: May 15, 2000 Notification: July 15, 2000 Workshop: October 4-7, 2000 Preliminary version for workshop volume due: at the workshop Notification of acceptance for publication: December 1, 2000 FURTHER INFORMATION E-mail enquiries about AiML-ICTL 2000 should be directed to . Information about AiML can be obtained on the World-Wide Web at , and about AiML-ICTL 2000 at

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

Computer Science or Browse by Subject Out of Stock Due: Unknown Standard Oxford Logic Guides 28 Temporal Logic Mathematical Foundations and Computational Aspects Volume 1 DOV M. GABBAY, IAN HODKINSON, and MARK REYNOLDS, all at Imperial College of Science, Technology and Medicine, London 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. 672 pp.; 84 illus.; 0-19-853769-7 Publication dates and prices are subject to change without notice. Prices are stated in US Dollars and valid only for sales transacted through the US website.

84. Atlas: Logic Programming With Temporal Constraint Graphs By Sergei Bogomolov logic Programming with temporal Constraint Graphs presented by SergeiBogomolov LGTCM Soft Lab logic Programming with temporal Constraint http://atlas-conferences.com/c/a/c/s/22.htm

Atlas Document # cacs-22 First St.Petersburg Days of Logic and Computability May 26-29, 1999 Steklov Institute of Mathematics St.Petersburg, Russia Conference Organizers Evgeny Dantsin, Gennadii Davydov, Dima Grigoriev, Eduard Karavaev, Nickolai Kossovskii, Vladimir Lifschitz, Maurice Margenstern, Yuri Matiyasevich (chairman), Grigori Mints, Vladimir Orevkov, Anatol Slissenko and Maxim Vsemirnov View Abstracts Conference Homepage Logic Programming with Temporal Constraint Graphs presented by Sergei Bogomolov LGTCM Soft Lab Logic Programming with Temporal Constraint Graphs Presented by Sergei Bogomolov LGTCM Soft Lab The aim of this paper is to present an approach based on conception of constraint logic programming. Temporal constraints are concerned that lie in the class of closed linear inequalities involving no more than two temporal variables. This restriction allows to propose effective procedure of computation of answer to temporal constraints query. The temporal reasoning scheme combines the temporal constraints consistency procedure based on transitive closure and non-deterministic choice procedure based on SLD-resolution. The consistency procedure allows to cut off non-promise ways of search. The size of search space is cut down much more large if there are more accurate temporal constraints in initial query and rules from temporal constraint logic program. The logic programs with temporal constraints (TC) enable to use new flexible computation strategies based on analysis of accuracy of temporal constraints of TC-rules and TC-query. The computation strategy defines an order of round of search tree and includes a selection step of active atom from current query and a suitable rule choice from admissible rule list. For selection of suitable rule a more compound strategy may use the ordering of admissible rules set based on analysis of accuracy of temporal constraints.

85. TLLP: A Temporal Linear Logic Programming Language And Its Compiler System TLLP language is a logic programming language based on intuitionistic temporal linearlogic, an integration of intuitionistic linear logic and temporal logic. http://kaminari.scitec.kobe-u.ac.jp/tllp/

TLLP : A Temporal Linear Logic Programming Language and its Compiler System Mutsunori Banbara , Hideo Yoshikawa, and Naoyuki Tamura Last modified: Wed Oct 31 18:19:24 2001 JST The TLLP language is a logic programming language based on intuitionistic temporal linear logic, an integration of intuitionistic linear logic and temporal logic. TLLP is a superset of Prolog and LLP , and it covers a significant fragment of (first-order) Lolli developed by J.Hodas and D.Miller TLLP can be seem as an extension of LLP with various temporal modalities. TLLP allows the use of modal operators '@'(next) and '#'(always ) in addition to '!'(bang). The intuitive meaning of these operators is as follows: The assumption @R means that R can be used exactly once at the next moment in time, The assumption #R means that R can be used exactly once any time, The assumption !R means R can be used arbitrarily many times (including zero many times) at any time, The goal @G adjusts time one clock ahead and then executes G. TLLP is distributed as free software for non-profit use.

86. Temporal Logic Research University of Greenwich. to CMS homepage temporal logic Research in the School ofComputing and Mathematical Sciences Publications in the temporal logic area http://cms1.gre.ac.uk/research/temp_logic/

Temporal Logic Research in the School of Computing and Mathematical Sciences: Publications in the Temporal Logic area

87. Listings Of The World Science Math Logic And Foundations Listings World Science Math logic and Foundations Nonstandard logicsand Extensions temporal logic. Listings World, http://listingsworld.com/Science/Math/Logic_and_Foundations/Nonstandard_Logics_a

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

Modal/temporal logic Go to home page 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)

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

On the expressive power of temporal logic for finite words J. COHEN, D. PERRIN et J.-E. PIN 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

90. Introduction To Temporal Logic Propositional Checker Introduction to temporal logic Propositional Checker by Hugh McGuire.Without too much ado, here's the Unixstyle manual-page for http://www.cs.ucsb.edu/~mcguire/tl_sat/intro_to_impl.html

Introduction to Temporal Logic Propositional Checker by Hugh McGuire Without too much ado, here's the Unix-style manual-page for this program (or actually, set of programs), comprising instructions and then examples of use. ( My dissertation provides more information and examples.) Click here if you want to get these programs (they are free). (This page was last updated 1996:June:22.)

91. A Temporal Logic For The Specification And Verification Of Distributed Behaviour TU Braunschweig Informatik Abt. Programmierung A temporal logic for the Specificationand Verification of Distributed Behaviour. Peter Niebert Abstract. http://www.cs.tu-bs.de/ips/niebert/Niebert1999-abstract_en.shtml

[TU Braunschweig] [Informatik] [Abt. Programmierung] A Temporal Logic for the Specification and Verification of Distributed Behaviour Peter Niebert Abstract In this work we develop a temporal logic with fixpoints for distributed processes or distributed systems. Here, we extend this approach to distributed processes, which represent the causal relation of events occurring in a run of a system as partial order. A key problem is the proper generalisation of the ``Next'' operator. Within a general framework we identify several syntactic subclasses of the logic. Both theoretical and pragmatic aspects of the resulting logics are investigated. Informatik-Bericht 99-02, TU Braunschweig Page provided by Thomas Firley firley@ips.cs.tu-bs.de

92. Temporal Logic With Past Is Exponentially More Succinct LSV. LSV, temporal logic with Past is Exponentially More Succinct. Whatis temporal logic with past? It is temporal logic where future http://www.lsv.ens-cachan.fr/~markey/PLTL.php

Temporal Logic with Past is Exponentially More Succinct Main Menu Abstract : The old question whether temporal logic with past-time modalities is exponentially more succinct than pure-future temporal logic has recently been answered positively What is temporal logic with past? It is temporal logic where future-time modalities, such as F sometimes in the future G always in the future U until "), ... are complemented with their past-time counterparts ( P or F for " once in the past H or G for " always in the past S or U for " since Is it useful? Yes. Indeed, specifications expressed in natural language often use references to events that occured in the past. One finds it natural to express that "every request is eventually granted" by G (request => F grant) Thus we woud like to express that "every grant is preceeded by a request" by the formula G (grant => F request) Is it really useful? It is possible to express the property of formula (2) without past-time modalities, and write U Formula (3) only uses future modalities, and is equivalent to formula (2) when interpreted at the beginning of a path. This is a general pattern. Gabbay

93. Specifications In Temporal Logic Specifications in temporal logic. temporal logic studies the structure or topologyof time 13. RTTL is an extension of the MannaPnueli temporal logic 11. http://rutcor.rutgers.edu/~pinzon/papers/rrr1/node13.html

Next: Control Synthesis Up: Timed Transition Models Previous: The Plant Model Specifications in Temporal Logic Temporal logic studies the structure or topology of time [ ]. It uses special operators such as (``henceforth'') and (``eventually'') to describe the temporal connectives that occur in language. In more recent years, temporal logic has been successfully applied in various areas of computer science, especially software verification. (See for example [ ].) Ostroff uses Real Time Temporal Logic (RTTL) in describing the specifications for purposes of controller synthesis. RTTL is an extension of the Manna-Pnueli temporal logic [ ]. It uses the standard temporal operators and adds the proof rules needed for real-time properties. The following summary follows closely that presented in [ ]. The reader is referred to [ ] for more details on RTTL. A state-formula is any first order predicate which does not contain any temporal operators. If a state-formula evaluates to true in state s , we write . Unlike a state-formula which can be evaluated in a single state, a

94. GUP: TLC - Temporal Logic Checker TLC temporal logic Checker. This is an Austrian - Hungarian joint projectto develop a temporal logic assertion checker. Ofiicial Project Page, http://www.gup.uni-linz.ac.at/research/logic/index.php

TLC - Temporal Logic Checker Project Definition Integrating Temporal Specifications as Runtime Assertions into Parallel Debugging Tools This is an Austrian - Hungarian joint project to develop a temporal logic assertion checker. Ofiicial Project Page The TLC (Temporal Logic Checker) project page Description Debugging nondeterministic parallel programs is a difficult and tedious task. In this project we propose to investigate the use of program specifications , which can serve as enhanced debugging aids in existing parallel debugging tools. The principal idea is to formulate a specification of expected program behavior, translate this specification into runtime assertions , and check them during execution . With this sophisticated approach, the user may select a subset of all possible executions on which checking should be performed and collect for each check a consistent global state of the observed application. Members GUP-Linz MTA SZTAKI RISC-Linz Deliverables Project Diary Specifikation Download Products Documention Source-Code Talks : Talk about "

95. Minimal Temporal Epistemic Logic Minimal temporal Epistemic logic. Abstract. Keywords temporal logic, epistemiclogic, nonmonotonic logics, decidability, complexity. Also in. http://www.cs.vu.nl/~joeri/abstracts/MTEL.html

Minimal Temporal Epistemic Logic Abstract In the study of nonmonotonic reasoning the main emphasis has been on static (declarative) aspects. Only recently has there been interest in the dynamic aspects of reasoning processes, particularly in artificial intelligence. We study the dynamics of reasoning processes by using a temporal logic to specify them and to reason about their properties, just as is common in theoretical computer science. This logic is composed of a base temporal epistemic logic with a preference relation on models, and an associated nonmonotonic inference relation in the style of Shoham, to account for the nonmonotonicity. We present an axiomatic proof system for the base logic and study decidability and complexity for both the base logic and the nonmonotonic inference relation based on it. Then we look at an interesting class of formulae, prove a representation result for it, and provide a link with the rule of monotonicity. Keywords: Temporal logic, epistemic logic, nonmonotonic logics, decidability, complexity. Also in Proceedings Sixth International Workshop on Nonmonotonic Reasoning, SRI International, Menlo Park, USA, pp. 63-71, 1996.

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

97. Abstracts Vol. 10-No 3-4/ 2000 However, unlike classical logic, temporal logic does not provide anextension of the notion of non negative normal form. In this http://www.irit.fr/ACTIVITES/EQ_ALG/Jancl/abstract-10.3-4.html

98. RR-2804 : Interactive Theorem Proving With Temporal Logic Translate this page logo inria. RR-2804 - Interactive Theorem Proving with temporal logic. Abstract In this paper, we present a theorem prover for linear temporal logic. http://www.inria.fr/rrrt/rr-2804.html

RR-2804 - Interactive Theorem Proving with Temporal Logic Felty, Amy Les rapports de cet auteur Rapport de recherche de l'INRIA- Sophia Antipolis Page d'accueil de l'unité de recherche Fichier PostScript / PostScript file Fichier postscript du document : 165 Ko Fichier PDF / PDF file Fichier PDF du document : 344 Ko Page d'accueil du projet

99. Alur/Henzinger/Kupferman: Alternating Temporal Logic Alternating temporal logic. Rajeev Alur, Thomas A. Henzinger, and OrnaKupferman temporal logic comes in two varieties lineartime http://www.cis.upenn.edu/~alur/Focs97.html

Alternating Temporal Logic Rajeev Alur, Thomas A. Henzinger, and Orna Kupferman Temporal logic comes in two varieties: linear-time temporal logic assumes implicit universal quantification over all paths that are generated by system moves; branching-time temporal logic allows explicit existential and universal quantification over all paths. We introduce a third, more general variety of temporal logic: alternating-time temporal logic no matter how the environment behaves A preliminary version appears in the Proceedings of the 38th Annual IEEE Symposium on Foundations of Computer Science (FOCS'97), pp. 100-109, 1997. An extended version appears in Compositionality The Significant Difference, LNCS 1536, pp. 2360, Springer-Verlag, 1999.

100. Bradfield, Julian 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/

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 5     81-100 of 102    Back | 1  | 2  | 3  | 4  | 5  | 6  | Next 20