Geometry.Net - Science: Temporal Logic


Home - Science - Temporal Logic

e99.com Bookstore

Images

Newsgroups

101-110 of 110 Back | 1 | 2 | 3 | 4 | 5 | 6

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)

Protocol specification and verification using the significant event temporal logic (Technical report. University of British Columbia. Dept. of Computer Science) by George K Tsiknis, 1988
The complementation problem for buchi automata with applications to temporal logic (Research Report RJ. International Business Machines Corporation. Research Division) by Aravinda Prasad Sistla, 1986
Temporal Logic (LEP Library of Exact Philosophy) by Nicholas Rescher, Alasdair Urquhart, 1971-08-18
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
A taxonomy of fairness and temporal logic problems for Petri nets (Technical report. Iowa State University. Dept. of Computer Science) by Rodney R Howell, 1988
A temporal logic for multi-level reasoning about hardware by Ben Moszkowski, 1982
Characterising temporal logic (Technical report series. University of Manchester. Dept. of Computer Science) by Michael Fisher, 1989
Proceedings of the Combined Tenth International Symposium on Temporal Representation and Reasoning and the Fourth International Conference on Temporal Logic: TIME-ICTL 2003 Cairns, Queensland, Australia, 8-10 July 2003 by Mark Reynolds, 2003-01-01
A concurrent program synthesis using Petri net and temporal logic in MENDELS ZONE (ICOT technical report) by Naoshi Uchihira, 1989
Temporal Logic by Dov M. Gabbay, 2007
Automatic verification of finite state concurrent systems using temporal logic specifications (Technical report. University of Texas at Austin. Dept. of Computer Sciences) by Edmund Melson Clarke, 1985
Two methods for checking formulas of temporal logic (Report) by Hugh W McGuire, 1995
Engineering of Computer Based Systems, 10th Annual IEEE International Conference on Temporal Logic, 4th International Conference On by IEEE Computer Society Staff, 2003-01-01
Modal and temporal logics (LFCS report series) by Colin Stirling, 1991

lists with details

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
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
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
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/

Extractions: This is a file in the archives of the Stanford Encyclopedia of Philosophy A B C D ... Z 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. The logical language of Tense Logic contains, in addition to the usual truth-functional operators, four modal operators with intended meanings as follows:
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

Extractions: 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 Display the whole document in one of the following formats.
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

Extractions: 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. Display a selected page in one of the following formats (document has 14 pages).
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

Extractions: 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.
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/
The Homepage Of Ben Moszkowski
http://www.cse.dmu.ac.uk/~benm/
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/

Extractions: 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: 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

101-110 of 110 Back | 1 | 2 | 3 | 4 | 5 | 6