81. Linear Temporal Logic Linear temporal logic. This contribution 6166). Date July 2002. Keywords temporallogic, infinite transition systems, coinduction. Warning ! This http://pauillac.inria.fr/coq/contribs/LTL.html

Linear Temporal Logic 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 V8.0) 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

82. Temporal Logic temporal logic. Branching time logics have The expressiveness of a temporallogic is a lively area of study. In branching time temporal http://www.cs.man.ac.uk/fmethods/people/wprm/subsectionstar3_4_2.html

ff Next: Process Algebras Up: Research Profile Previous: Research Direction Temporal Logic Branching time logics have been long established as important tools for verifying finite state concurrent systems. The expressiveness of a temporal logic is a lively area of study. In branching time temporal logic a hierarchy of $CTL^*$ sub-logics has been discovered in respect of their expressive capabilities. Next: Process Algebras Up: Research Profile Previous: Research Direction bill@r8h.cs.man.ac.uk Wed Jul 13 14:42:00 BST 1994

83. Controller Design From Temporal Logic: Undecidability Need Not Matter Controller Design from temporal logic Undecidability Need Not Matter.by Martin Fränzle Ph.D. thesis, Technische Fakultät der http://www.imm.dtu.dk/~mf/diss.html

Controller Design from Temporal Logic: Undecidability Need Not Matter online Abstract: However, we claim that the impact of these findings goes much deeper than just Duration Calculus. Formal methods are intended to be mathematically rigorous design instruments, aiming at subjecting the development process to mathematical verification. Hence, the only rationale for taking idealizations in the formal representation of a design problem is that the gains in tractability of the problem may outweigh the loss of accuracy. However, if such semantic idealizations complicate rather than simplify the design problem then there is no justification for taking them. Thus, our results may be interpreted as an indication that liberating formal models of embedded control from some of the idealizations that have been imposed for smoothening the models may enhance both their accuracy and their tractability. As this implies that similar analyses of other formal models of embedded-system specification and implementation may yield similar gains, there is quite some potential for extending our results to other temporal logics or even for exploiting them in high-level hardware synthesis technologies. Gzipped Postscript Full bibliographic information in BibTeX format Last modified: Wed, Apr. 8, 1998

84. (Drusinsky D., Shing M.T.) Monitoring Temporal Logic Specifications Combined Wit get Monitoring temporal logic Specifications Combined with Time Series Constraints.Doron Drusinsky (Naval Postgraduate School and TimeRover, Inc. http://www.jucs.org/jucs_9_11/monitoring_temporal_logic_specification

User: anonymous Special Issues Sample Issues Volume 10 (2004) Volume 9 (2003) ... Printed Publications available in: Comment: get: Monitoring Temporal Logic Specifications Combined with Time Series Constraints Doron Drusinsky (Naval Postgraduate School and Time-Rover, Inc. California, USA) doron@time-rover.com Man-Tak Shing (Naval Postgraduate School California, USA) shing@nps.navy.mil Abstract: Keywords: Temporal Logic, Run-time Execution Monitoring, Rapid Prototyping, Execution-based Model Checking, Real-time Systems Category: D.2.1 D.2.4 D.2.5 D.2.6 ... F.3.1

85. (Krebs A., Ruf J.) Optimized Temporal Logic Compilation get Optimized temporal logic Compilation. Andreas system. Keywordsverification, simulation, systemLevel, temporal logic, emulation. http://www.jucs.org/jucs_9_2/optimized_temporal_logic_compilation

User: anonymous Special Issues Sample Issues Volume 10 (2004) Volume 9 (2003) ... Printed Publications available in: Comment: get: Optimized Temporal Logic Compilation Andreas Krebs wsi@krebs-net.de ruf@informatik.uni-tuebingen.de Abstract: Verification and validation are the major tasks during the design of digital hardware/software systems. Often more than 70% of the development time is spent for locating and correcting errors in the design. Therefore, many techniques have been developed to support the debugging process. Recently, simulation and test methods have been accompanied by formal methods such as equivalence checking and property checking. However, their industrial applicability is currently restricted to small or medium sized designs or to a specific phase in the design process. Therefore, simulation is still the most commonly applied verification technique. In this paper, we present a method for asserting temporal properties during simulation and also during emulation of hardware prototypes. The properties under verification are efficiently translated into an intermediate language (of a virtual machine). This intermediate representation can then be interpreted during simulation. We may also produce executable checkers running in parallel to the simulation. Furthermore, we are able to translate the properties into synthesizable hardware modules which can then be used during system emulation on FPGA-based emulators or as self test components checking the functionality during the lifetime of the system.

86. Temporal Logic Innovations And Patents temporal logic Innovations and Patents. © 2002, XQ23.COM Research (air.xq23.com). Moreinformation on temporal logic and temporal logic Research References. http://www.air.xq23.com/energy_science_resources/Temporal_Logic.html

Temporal Logic Innovations and Patents © 2002, XQ23.COM Research (air.xq23.com) Who were the Great Minds Absolute Zero Acid Rain Acoelomates ... HOME KEY SITES: PRIME-RADIANT FUTURE'S EDGE Future Books Educational Priorities THE LUMINARIES SCIENCE FICTION ARCHIVES: FIRST PILLAR kurt vonnegut arthur c clarke david brin ... Dialysis More information on: Temporal Logic and Temporal Logic Research References. Recent U.S. patents related to Temporal Logic: 6,346,879: Verification of message sequence charts 6,343,372: Methods and apparatus for generating a verified algorithm for transforming a program from a first form to a second form 6,339,837: Hybrid method for design verification 6,324,496: Model checking of hierarchical state machines 6,314,415: Automated forms publishing system and method using a rule-based expert system to dynamically generate a graphical user interface 6,289,502: Model-based software design and validation 6,275,980: Programming method for concurrent programs and program supporting apparatus thereof 6,260,185: Method for designing semiconductor integrated circuit and automatic designing device

87. From Event-Based Semantics To Linear Temporal Logic From EventBased Semantics to Linear temporal logic The logical and ComputationalAspects of a Natural Language Interface for Hardware Verification. http://www.ltg.ed.ac.uk/prosper/papers/laureys-1999-ebs/

P ROSPER AT E DINBURGH Proof and Specification Assisted Design Environments From Event-Based Semantics to Linear Temporal Logic: The Logical and Computational Aspects of a Natural Language Interface for Hardware Verification Tom Laureys MSc Dissertation, School of Cognitive Science , University of Edinburgh Abstract Computing system design can significantly benefit from the application of formal verification techniques. However, the logical expertise which formal verification requires has often hindered its take-up in industry. The present work proposes a solution to this problem in the form of a natural language interface for hardware verification. From a theoretical point of view, the logical background for an interface system is researched. On the computational side, a prototype is developed which can form the foundation for a fully operational natural language interface. Full paper PostScript PDF 26 November 1999

88. Generating Oracles From Your Favorite Temporal Logic Specifications 19 Pierre Wolper, On the Relation of Programs and Computations to Models of temporallogic, temporal logic in Specification, p.75123, April 08-10, 1987. http://portal.acm.org/citation.cfm?id=239116&dl=ACM&coll=portal&CFID=11111111&CF

89. The Temporal Logic Of Reactive And Concurrent Systems Feedback Report a problem Satisfaction survey. The temporal logic of reactiveand concurrent systems. Purchase this Book Purchase this Book. http://portal.acm.org/citation.cfm?id=128869&dl=ACM&coll=portal&CFID=11111111&CF

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

QSL seminar Temporal Logic December 10, 2002 LORIA Rooms B011/B013 Campus Scientifique Vandoeuvre-les-Nancy 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 Igor Walukiewicz

91. 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://www.loria.fr/~merz/papers/diss.html

Temporal Logic as a Programming Language Stephan Merz Abstract The central topic of this thesis is the characterization of a class of temporal logic formulas for which a model can be constructed automatically and efficiently. This study is motivated by the desire to close the gap between the ``declarative'' use of temporal logic as a specification formalism, especially for reactive systems, and the implementation of such systems in a different ``operational'' formalism. The logical framework employed is a temporal logic based on fixpoint operators, allowing the results to be as general as practical by treating various temporal operators in a uniform way. A characterization of safety properties in this framework is given, which is then specialized to a similar characterization of deterministic safety properties. Starting from such formulas, the theory of ``executable'' temporal logic formulas is at first developed for propositional temporal logic, aiming at the characterization of formulas which allow for a model construction using a backtracking-free and future-directed algorithm whose time complexity is linear in the length of the input formulas. For the first-order case, first some new incompleteness results are presented which further motivate the preference of a model-construction over a ``proofs-as-programs'' paradigm for the design of a programming language based on temporal logic. The framework developed for propositional temporal logic is extended to first-order temporal logic. Finally, the parallel composition of modules is studied using a conventional interleaving semantics and, in particular, the transition from properties of single modules to properties of composed systems is addressed. For programs expressed in the formalism developed before, a rule is given which allows the derivation of unconditional system properties in the presence of mutual dependencies between the modules.

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

Alternating-time 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 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

93. Alur/Henzinger: A Really Temporal Logic A Really temporal logic. Rajeev Alur and Thomas A. Henzinger We introducea temporal logic for the specification of realtime systems. http://www-cad.eecs.berkeley.edu/~tah/Publications/a_really_temporal_logic.html

A Really Temporal Logic 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

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

Next: Symbolic Representation of Kripke Up: Symbolic Model Checking Previous: Symbolic Model Checking Temporal Logic A finite state system can be described as a tuple: 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 Figure 1: A State Transition Graph and its unwinding. 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.

95. Abstract Of: Two-sorted Metric Temporal Logics CSR9577 A. Montanari ; M. de Rijke ; 1995, CS-R9577, ISSN 0169-118X compressedPostScript ( 158 KB ) ( 26 pages ) Abstract temporal logic has been http://db.cwi.nl/rapporten/abstract.php?abstractnr=550

96. Testing Temporal Logic Properties In Distributed Systems next Next Keywords Testing temporal logic Properties in DistributedSystems. F. Dietrich, X. Logean, S. Koppenhoefer, JP Hubaux http://icapeople.epfl.ch/dietrich/pubs/CONF001/paper.html

Next: Keywords Testing Temporal Logic Properties in Distributed Systems F. Dietrich , X. Logean, S. Koppenhoefer, J.-P. Hubaux Institute for computer Communications and Applications (ICA) Swiss Federal Institute of Technology, CH-1015 Lausanne Postscript file Abstract: 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. Keywords Introduction The set of events Expressing properties ... About this document ... Falk Dietrich

97. Logic Journal Of The IGPL, Volume 7, Issue 1: January 1999. J. van Benthem temporal logic arose at the border of philosophy and linguistics. HybridLanguages and temporal logic. P. Blackburn and M. Tzakova http://www3.oup.co.uk/igpl/Volume_07/Issue_01/

Home Online Resources Logic Journal of the IGPL Table of Contents Volume 7, Issue 1: January 1999. Editorial Original Articles J. van Benthem Temporal Patterns and Modal Structure P. Blackburn and M. Tzakova Hybrid Languages and Temporal Logic D.R. Dams Flat Fragments of CTL and CTL : Separating the Expressive and Distinguishing Powers A. Montanari, A. Peron and A. Policriti Theories of omega-Layered Metric Temporal Structures: Expressiveness and Decidability C. Stirling Bisimulation, Modal Logic and Model Checking Games A. Zanardo and B. Barcellan and M. Reynolds Non-Definability of the Class of Complete Bundled Trees 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. cover.eps Editorial Get the .dvi (5 KB) or the PostScript (67 KB) or the PDF file (87 KB).

98. Logic Journal Of The IGPL, Volume 8, Issue 5: September 2000. Along the way we make a detour through hybrid propositional dynamic logic we establishupper bounds for a number of temporal logics by generalizing results http://www3.oup.co.uk/igpl/Volume_08/Issue_05/

Home Online Resources Logic Journal of the IGPL Table of Contents Volume 8, Issue 5: September 2000. Ruy J.G.B. de Queiroz Editorial Original Articles John Baldwin Finite and Infinite Model Theory A Historical Perspective A Cut-Free Gentzen Formulation of the Modal Logic S5 Eduard Ferme; Irrevocable Belief Revision and Epistemic Entrenchment Carlos Areces, Patrick Blackburn and Maarten Marx The Computational Complexity of Hybrid Temporal Logics Angelo Montanari, Adriano Peron and Alberto Policriti The Taming (Timing) of the States Andre Nies Model theory of the computably enumerable many-one degrees Get the whole issue as dvi file (206 KB) or PostScript file (462 KB) or PDF file (1353 KB). The following file need to be copied to your local disc if you want to see all figures in xdvi or if you want to print .dvi files. It is not needed if you work with the PostScript files. cover.eps Editorial Ruy J.G.B. de Queiroz Get the .dvi (4 KB) or the PostScript (31 KB) or the PDF file (63 KB). Back to the table of contents. Original Articles Finite and Infinite Model Theory A Historical Perspective John Baldwin We describe the progress of model theory in the last half century from the standpoint of how finite model theory might develop.

99. Dominion Web Directory : Science : Math : Logic_and_Foundations : Nonstandard_Lo Development Open in a new browser window Among other activities, this group explorestopics related to temporal logic including temporal resolution methods. http://directory.dominion-web.com/Top/Science/Math/Logic_and_Foundations/Nonstan

Search the Directory search the entire directory search this category only advanced Top Science Math Temporal Logic Categories: Prior, Arthur@ See Also: Top/Science/L Top/Science/T Sites: Centre for Agent Research and Development Among other activities, this group explores topics related to temporal logic including temporal resolution methods. http://www.doc.mmu.ac.uk/RESEARCH/CARD/ Efficient Symbolic Tools A BDD based tool for the formal verification of concurrent systems using a propositional branching-time temporal logic: action computation tree logic (ACTL). It runs under different OS, including Linux and Windows 95/98/NT. http://www.el.feri.uni-mb.si/est/ Ground Temporal Logic: A Logic for Hardware Verification A temporal logic designed to specify properties of hardware at the register transfer level. http://www.csl.sri.com/reports/html/cav94.html Interval Temporal Logic A flexible notation for both propositional and first-order reasoning about periods of time found in descriptions of hardware and software systems. Includes table of contents, abstracts and pdf downloads. http://link.springer.de/link/service/journals/00165/bibs/0012001/00120052.htm

100. Mu-ACTL+: A Temporal Logic For UML Statechart Diagrams MuACTL+ A temporal logic for UML Statechart diagrams. Author(s) Stefania Gnesiand 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

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