101. Mu-ACTL+: A Temporal Logic For UML Statechart Diagrams MuACTL+ A temporal logic for UML Statechart diagrams. Author(s) Stefania Gnesi and Franco Mazzanti. Keywords temporal logic, mu calculus, branching time. http://dienst.isti.cnr.it/Dienst/UI/2.0/Describe/ercim.cnr.isti/2003-TR-64?tipos

102. Temporal Logic From FOLDOC temporal logic. logic An extension There are two types of temporal logic used branching time and linear time. The basic propositional http://www.instantweb.com/foldoc/foldoc.cgi?temporal logic

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

104. Temporal Logic temporal logic. The term temporal logic has been Modallogic approaches to temporal logic. Tense Logic. Tense Logic was introduced by Arthur http://www.seop.leeds.ac.uk/archives/sum2000/entries/logic-temporal/

This is a file in the archives of the Stanford Encyclopedia of Philosophy Stanford Encyclopedia of Philosophy A B C D ... Z Temporal Logic 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. Modal-logic approaches to temporal logic Predicate-logic approaches to temporal logic Philosophical issues Applications ... Related Entries Modal-logic approaches to temporal logic Tense Logic The logical language of Tense Logic contains, in addition to the usual truth-functional operators, four modal operators with intended meanings as follows:

105. Discrete Event Models + Temporal Logic = Supervisory Controller: Automatic Synth Discrete Event Models + temporal logic = Supervisory Controller Automatic Synthesis of Locomotion Controllers. M. Antoniotti and http://csdocs.cs.nyu.edu/Dienst/UI/2.0/Describe/ncstrl.nyu_cs/TR1994-675

Discrete Event Models + Temporal Logic = Supervisory Controller: Automatic Synthesis of Locomotion Controllers M. Antoniotti and B. Mishra November, 1994 In this paper, we address the problem of the synthesis of controller programs for a variety of robotics and manufacturing tasks. The problem we choose for test and illustrative purposes is the standard ``Walking Machine Problem,'' a representative instance of a real "hybrid" problem with both logical/discrete and continuous properties and strong mutual influence without any reasonable separation. We aim to produce a ``compiler technology'' for this class of problems in a manner analogous to the development of the so-called ``Silicon Compilers'' for the VLSI technology. To cope with the difficulties inherent to the problem, we resort to a novel approach that combines many key ideas from a variety of disciplines: namely, ``Discrete Event Supervisory Systems'', Petri Nets approaches and ``Temporal Logic''. Notes: Will appear in the 1995 IEEE International Conference on Robotics and Automation, Nagoya, Japan How to view this document Display the whole document in one of the following formats.

106. Generating Optimal Linear Temporal Logic Monitors By Coinduction Generating Optimal Linear temporal logic Monitors by Coinduction. Koushik Sen, Grigore Rosu and Gul Agha UIUCDCSR-2003-2362 July 2003 http://www.cs.uiuc.edu/Dienst/UI/2.0/Describe/ncstrl.uiuc_cs/UIUCDCS-R-2003-2362

Generating Optimal Linear Temporal Logic Monitors by Coinduction Koushik Sen, Grigore Rosu and Gul Agha UIUCDCS-R-2003-2362 July 2003 A coinduction-based technique to generate an optimal monitor from a Linear Temporal Logic (LTL) formula is presented in this paper. Such a monitor receives a sequence of states (one at a time) from a running process, checks them against a requirements specification expressed as an LTL formula, and determines whether the formula has been violated or validated. It can also say whether the LTL formula is not monitorable any longer, i.e., that the formula can in the future neither be violated nor be validated. A Web interface for the presented algorithm adapted to extended regular expressions is available, so interested readers as well as runtime verification tools such as Java PathExplorer can generate optimal LTL monitors on-line. How to view this document Display an overview of the document in one of the following formats. Overview of thumbnail pages Display a selected page in one of the following formats (document has 14 pages).

107. IEEE Symposium On Logic In Computer Science -- 1996 BibTeX entry. Kousha Etessami and Thomas Wilke. An Until hierarchy for temporal logic. BibTeX entry. R. Ramanujam. Locally linear time temporal logic. http://theory.lcs.mit.edu/~dmjones/LICS/lics96.html

IEEE Symposium on Logic in Computer Science 1996 J. Antonio Medina and Neil Immerman . A generalization of Fagin's theorem. In Proceedings, 11th Annual IEEE Symposium on Logic in Computer Science , pages 2-12, New Brunswick, New Jersey, 27-30 July 1996. IEEE Computer Society Press. References. BibTeX entry Jerzy Marcinkowski . DATALOG SIRUPs uniform boundedness is undecidable. In Proceedings, 11th Annual IEEE Symposium on Logic in Computer Science , pages 13-24, New Brunswick, New Jersey, 27-30 July 1996. IEEE Computer Society Press. References. BibTeX entry Michael Benedikt and Leonid Libkin . On the structure of queries in constraint query languages. In Proceedings, 11th Annual IEEE Symposium on Logic in Computer Science , pages 25-34, New Brunswick, New Jersey, 27-30 July 1996. IEEE Computer Society Press. References and Citations. BibTeX entry Ian Stark . A fully abstract domain model for the pi-calculus. In Proceedings, 11th Annual IEEE Symposium on Logic in Computer Science , pages 36-42, New Brunswick, New Jersey, 27-30 July 1996. IEEE Computer Society Press. References and Citations.

108. Manchester Metropolitan University Department of Computing and Mathematics, logic and Computation Group. Research projects Proof Methods for NonClassical logics; temporal and Modal logics; Programming Language Design; Agent-Based Systems. Members, research interests, bibliography. http://www.doc.mmu.ac.uk/RESEARCH/LoCo/

109. The Homepage Of Ben Moszkowski http://www.cse.dmu.ac.uk/~benm/

110. TLA Workshop Workshop and Tutorial on TLA/TLA+. Monday 20, September 1999 and Tutorial on Thursday 23, September 1999. A Satellite Event to FM 99 http://www.loria.fr/~mery/tla99/

Workshop and Tutorial on TLA/TLA+ Monday 20, September 1999 and Tutorial on Thursday 23, September 1999 A Satellite Event to FM'99, Toulouse, France (20-24 September 1999) The TLA workshop was one of the side events organized around the conference Formal Methods'99 (formerly FME). It brought together the community interested in various aspects of TLA and TLA+, including: TLA as a semantic language tools for TLA+ specs and to support TLA reasoning practical experience with TLA and TLA+ TLA in education Evolution of TLA+ The foundations of TLA have been stable for almost a decade. The research focus has shifted from theory to putting TLA into practice. Recent work has concentrated on the development of the specification language TLA+ and on tools for it. FM'99 was a perfect opportunity for the community to come together and share its experience (failures as well as successes), describe current and future work, and complain about what's missing. More than 30 persons attended the workshop and the room of the tutorial was clearly too small. Participants and programme at the workshop included: Isabelle Attali (INRIA, Sophia Antipolis)

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