Home  - Science - Temporal Logic

Books Baby Camera Phones Computers Games DVD Electronics Kitchen Magazines Music Garden Software Tools Toys Video Apparel & Accessories Jewelry & Watches Musical Instruments Health & Personal Care Beauty Sports & Outdoors Office Products

e99.com Bookstore

Images

Newsgroups

81-100 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)

Verifying temporal properties without using temporal logic (Technical report. Cornell University. Dept. of Computer Science) by Bowen Lewis Alpern, 1985 A temporal-logic based compositional proof system for real-time message passing (Technical report. Cornell University. Dept. of Computer Science) by Jozef Hooman, 1988 The treatment of macro expansions in the temporal logic of parallel programs (Technical report. Technische Universität München. Institut für Informatik) by A Kausche, 1985 Temporal logic programming is complete and expressive (Report / Stanford University. Computer Science Dept) by Marianne Baudinet, 1988 A really temporal logic (Report / Stanford University. Computer Science Dept) by Rajeev Alur, 1989 Alternating-time temporal logic (Memorandum) by Rajeev Alur, 1998 Synchronization of multiagent plans using a temporal logic theorem prover (Technical note. SRI International) by Christopher Stuart, 1985 Semantics for reified temporal logic (Research paper. University of Edinburgh. Department of Artificial Intelligence) by Han Reichgelt, 1986 An improved algorithm for the automatic verification of finite state systems using temporal logic (Research report. Carnegie-Mellon University. Dept. of Computer Science) by Michael C Browne, 1986 Temporal logic specification and verification of a virtual ring LAN access protocol ([Report] / Université P. et M. Curie, Laboratoire Informatique Théorique et Programmation) by Ana R Cavalli, 1985 Temporal Logic: Logic, Modal Logic, Computer Science, Principle of Bivalence, Formal Verification, Linear Temporal Logic, Computation Tree Logic, Model Checking, Logical Connective Temporal Logic by Dov M. Gabbay, 2000 On the expressive power of temporal logic ([Report]. Universite P. et M. Curie. Institut de Programmation. Laboratoire Informatique Theorique et Programmation) by D Perrin, 1986 A study of an extended temporal logic and a temporal fixed point calculus (Technical report series. University of Manchester. Dept. of Computer Science) by B Banieqbal, 1986

lists with details

81. UMCS-87-12-4 Temporal Logics For Abstract Semantics
    concept of abstractness and its relationship to compositionality is formalised before considering the use of several different forms of temporal logic in the  
    http://www.cs.man.ac.uk/cstechrep/Abstracts/UMCS-87-12-4.html

82. The Temporal Logic Of Actions
    The temporal logic of actions. ABSTRACT The temporal logic of actions (TLA) is a logic for specifying and reasoning about concurrent systems.  
    http://portal.acm.org/citation.cfm?id=177726&dl=ACM&coll=portal&CFID=11111111&CF

83. Applications Of Temporal Logic To The Specification And Verification Of Reactive
    survey. Applications of temporal logic to the specification and verification of reactive systems a survey of current trends. Source,  
    http://portal.acm.org/citation.cfm?id=19527&dl=ACM&coll=portal&CFID=11111111&CFT

84. Abstract
    Using a Modular Distributed temporal logic for Inthe-large Object Specification. Our general goal is to provide a semantic foundation  
    http://www.cs.tu-bs.de/idb/publications/kue98a_abs.html
    
    Extractions: Our general goal is to provide a semantic foundation for in-the-large specification of distributed information systems. We use T ROLL , an object-oriented formal language, for system specification. Our claim is that objects are not enough as a modularisation unit when it comes to deal with very large systems. An intermediary concept between the system and the objects is needed for allowing reusability of specifications and provide a clearer system structure. Enriching T ROLL with a module concept enforces us to develop new theoretical constructs ensuring an appropriate underpinning of the language. A modular distributed temporal logic M DTL has been developed which describes the dynamic aspects of modular systems. The main features of the logic are its own modularity, the ability to express inter-module (a)synchronous communication and intra-module concurrency. It also seems promising to support module refinement. M DTL is based on n -agent logics and interpreted over labelled prime event structures. In this paper we present the logic and semantics underlying the modular object-oriented specification language by means of a small toy example.

85. Abstract
    On a Distributed temporal logic for Modular Object Systems. In this paper we present MDTL, a distributed temporal logic for reasoning  
    http://www.cs.tu-bs.de/idb/publications/kue98_abs.html
    
    Extractions: In this paper we present M DTL , a distributed temporal logic for reasoning about both synchronously and asynchronously communicating modular object systems. M DTL is an extension of D TL reflecting besides synchronous communication and non-determinism also concurrency and supporting asynchronous communication. It is based on n -agent logics. Formulae written in M DTL are interpreted over labelled prime event structures. A model construction for (a)synchronous concurrent composition has been provided in previous work. The model theory together with M DTL allows a whole range of issues, like reasoning and verification.

86. Alur/Henzinger/Kupferman: Alternating-time Temporal Logic
    Alternatingtime temporal logic. Rajeev Alur, Thomas A. Henzinger, and Orna Kupferman temporal logic comes in two varieties linear  
    http://www-cad.eecs.berkeley.edu/~tah/Publications/alternating-time_temporal_log
    
    Extractions: 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 offers selective quantification over those paths that are possible outcomes of games, such as the game in which the system and the environment alternate moves. While linear-time and branching-time logics are natural specification languages for closed systems, alternating-time logics are natural specification languages for open systems. For example, by preceding the temporal operator "eventually" with a selective path quantifier, we can specify that in the game between the system and the environment, the system has a strategy to reach a certain state. The problems of receptiveness, realizability, and controllability can be formulated as model-checking problems for alternating-time formulas. Depending on whether or not we admit arbitrary nesting of selective path quantifiers and temporal operators, we obtain the two alternating-time temporal logics ATL and ATL*. ATL and ATL* are interpreted over concurrent game structures Journal of the ACM 49:672-713, 2002. Preliminary versions appeared in the

87. Alur/Henzinger: A Really Temporal Logic
    A Really temporal logic. Rajeev Alur and Thomas A. Henzinger We introduce a temporal logic for the specification of realtime systems.  
    http://www-cad.eecs.berkeley.edu/~tah/Publications/a_really_temporal_logic.html
    
    Extractions: Rajeev Alur and Thomas A. Henzinger We introduce a temporal logic for the specification of real-time systems. Our logic, TPTL, employs a novel quantifier construct for referencing time: the "freeze" quantifier binds a variable to the time of the local temporal context. TPTL is both a natural language for specification and a suitable formalism for verification. We present a tableau-based decision procedure and a model-checking algorithm for TPTL. Several generalizations of TPTL are shown to be highly undecidable. Journal of the ACM 41:181-204, 1994. A preliminary version appeared in the Proceedings of the 30th Annual Symposium on Foundations of Computer Science (FOCS), IEEE Computer Society Press, 1989, pp. 164-169. PostScript PDF IEEE ACM

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

89. QSL: Temporal Logic
    temporal logic. December 10, 2002. 11h00, Break, 11h20, temporal logic with Forgettable Past 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

90. Mechanising First-Order Temporal Logics
    This has the advantage that it can potentially be extended to branchingtime temporal logic by considering trees rather than lists.  
    http://www.csc.liv.ac.uk/research/logics/mfotl/
    
    Extractions: EPSRC research grant, originally awarded to the above teams when Michael Fisher and Anatoli Degtyarev were at the Department of Computing and Mathematics within the Manchester Metropolitan University. The project was funded for three years from the first half of 1999 (although the Liverpool part of the project has been slightly delayed after the move, in early 2001, from the Manchester Metropolitan University). The aim of this project is to apply novel techniques from artificial intelligence to the development of a practical theorem-proving system for First-Order Temporal Logics (FOTL). FOTL is exploited in a variety of application areas, particularly system verification, knowledge representation, program synthesis and execution. As these application areas are themselves increasingly important in both mainstream computer science and artificial intelligence, the development of appropriate reasoning systems for such logics will ultimately contribute to many strands within these disciplines.

91. Logic Journal Of The IGPL, Volume 7, Issue 1: January 1999.
    J. van Benthem temporal logic arose at the border of philosophy and linguistics. Hybrid Languages and temporal logic. P. Blackburn and M. Tzakova  
    http://www3.oup.co.uk/igpl/Volume_07/Issue_01/
    
    Extractions: Get the whole document as .dvi file Get the whole document as PostScript file Get the whole document as PDF file (1526 KB) The following file need to be copied to your local disc if you want to see all figures in the xdvi or xhdvi previewer or if you want to print .dvi files. It is not needed if you work with the PostScript files.

92. Volume 7 January - December 1997
    Email M.Fisher@doc.mmu.ac.uk. ABSTRACT. In this paper a normal form, called Separated Normal Form (SNF), for temporal logic formulae is described.  
    http://www3.oup.co.uk/logcom/hdb/Volume_07/Issue_04/070429.sgm.abs.html
    
    Extractions: M Fisher Department of Computing, Manchester Metropolitan University, Chester Street, Manchester UK . Email: M.Fisher@doc.mmu.ac.uk ABSTRACT In this paper a normal form, called Separated Normal Form (SNF) , for temporal logic formulae is described. A simple propositional temporal logic, based on a discrete linear model structure, is introduced and a procedure for transforming an arbitrary formula of this logic into SNF is described. It is shown that the transformation process preserved satisfiability and ensures that any model of the transformed formula is a model for the original one. This normal form not only provides a simple and concise representation for temporal formulae, but is also used as the basis for both a resolution proof method and an execution mechanism for this type of temporal logic. In addition to outlining these applications, we show how the normal form can be extended to deal with first-order temporal logic. Keywords : Temporal logics, normal forms, theorem-proving, executable logics.

93. Temporal Logic With Past Is Exponentially More Succinct
    temporal logic with Past is Exponentially More Succinct. Abstract The old question What is temporal logic with past? It is temporal logic  
    http://litpc24.ulb.ac.be/~nmarkey/PLTL.php
    
    Extractions: 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 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 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) 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.

94. CAV 2003 - Reasoning With Temporal Logic On Truncated Paths
    Reasoning with temporal logic on Truncated Paths. Abstract. We consider the problem of reasoning with linear temporal logic on truncated paths.  
    http://www.cs.utexas.edu/users/trcenter/CAV/accepted/49.html
    
    Extractions: CAV 2003 START ConferenceManager Presented at Computer-Aided Verification 2003 (CAV 2003), Boulder, Colorado, USA, July 8-12 2003 We consider the problem of reasoning with linear temporal logic on truncated paths. A truncated path is a path which is finite, but not necessarily maximal. Truncated paths arise naturally in several areas, among which are incomplete verification methods (such as simulation or bounded model checking) and hardware resets. We present a formalism for reasoning about truncated paths, and analyze its characteristics. Server START Conference Manager (V2.44.8) Update Time 16 Apr 2003 at 11:15:39 Maintainer hunt@cs.utexas.edu

95. Testing Temporal Logic Properties In Distributed Systems
    next Next Keywords Testing temporal logic Properties in Distributed Systems. F. Dietrich, X. Logean, S. Koppenhoefer, JP Hubaux  
    http://icapeople.epfl.ch/dietrich/pubs/CONF001/paper.html
    
    Extractions: Postscript file Based on the notion of event-based behavioral abstraction (EBBA) we specify properties of object-oriented distributed systems in linear time temporal logic. These properties are then observed at system run-time and it is checked whether or not the system violates the specified behavioral constraints. In our approach, several steps in the testing process can be automized: instrumenting the source code, constructing test-oracles and generating an observer. Taking an industrial example as basis, we discuss how our proposal can be integrated into the software design- and testing process.

96. Lambda The Ultimate Diagnosing Java Code Assertions And Temporal
    Diagnosing Java code Assertions and temporal logic in Java. Previous topic, Next topic. Diagnosing Java code Assertions and temporal logic in Java.  
    http://lambda.weblogs.com/discuss/msgReader$4204

97. Temporal Logic In Specification 1987
    dblp.unitrier.de temporal logic in Specification 1987 Altrincham, UK. 1-20; Shmuel Katz, Doron Peled Interleaving Set temporal logic.  
    http://www.informatik.uni-trier.de/~ley/db/conf/tls/tls1987.html
    
    Extractions: Behnam Banieqbal Howard Barringer Amir Pnueli (Eds.): Temporal Logic in Specification, Altrinchamm UK, April 8-10, 1987, Proceedings. Lecture Notes in Computer Science 398 Springer 1989, ISBN 3-540-51803-7 DBLP Pierre Wolper : On the Relation of Programs and Computations to Models of Temporal Logic. 75-123 Zohar Manna Amir Pnueli : Specification and Verification of Concurrent Programs by forall-Automata. 124-164 Bernhard Josko : MCTL - An Extension of CTL for Modular Verification of Concurrent Systems. 165-187 Edmund M. Clarke Orna Grumberg : The Model Checking Problem for Concurrent Systems with Many Similar Processes. 188-201 Moshe Y. Vardi

98. Advances In Temporal Logic|KLUWER Academic Publishers
    Books » Advances in temporal logic. Advances in temporal logic. Add to cart. edited by Howard Barringer University of Manchester, UK  
    http://www.wkap.nl/prod/b/0-7923-6149-0
    
    Extractions: Time is a fascinating subject that has captured mankind's imagination from ancient times to the present. It has been, and continues to be studied across a wide range of disciplines, from the natural sciences to philosophy and logic. More than two decades ago, Pnueli in a seminal work showed the value of temporal logic in the specification and verification of computer programs. Today, a strong, vibrant international research community exists in the broad community of computer science and AI. This volume presents a number of articles from leading researchers containing state-of-the-art results in such areas as pure temporal/modal logic, specification and verification, temporal databases, temporal aspects in AI, tense and aspect in natural language, and temporal theorem proving. Earlier versions of some of the articles were given at the most recent International Conference on Temporal Logic, University of Manchester, UK.

99. SDL Mailing List: Re: SDL-News: SDL And Temporal Logic
    Re SDLNews SDL and temporal logic. Subject Re Next message philippe Leblanc RE SDL-News SDL and temporal logic ; Previous message  
    http://www.sdl-forum.org/Archives/SDL/0086.html

100. SDL Mailing List: SDL-News: SDL And Temporal Logic
     SDLNews SDL and temporal logic. Subject SDL-News SDL and temporal logic From Pedro Merino (pedro@lcc.uma.es) Date Fri Dec 15 2000 - 025246 MST.  
     http://www.sdl-forum.org/Archives/SDL/0077.html
     
     Extractions: Pedro Merino Gómez Universidad de Málaga, Departamento de Lenguajes y Ciencias de la Computación ETSI Informática- ETSI Telecomuniación Campus de Teatinos 29071 Málaga (SPAIN) Teléfono: 952 132752 Fax: 952131397 e.mail: pedro@lcc.uma.es Despacho: 3.2.9 http://www.sdl-forum.org/Society/members.htm

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

81-100 of 110    Back | 1  | 2  | 3  | 4  | 5  | 6  | Next 20