41. $FILE Among other activities, this group explores topics related to temporal logic including temporal resolution methods. http://www.doc.mmu.ac.uk/RESEARCH/CARD/

Department of Computing and Mathematics Manchester Metropolitan University Manchester M1 5GD, United Kingdom C ONTACT: Michael Fisher Tel: (+44) 161 247 1500 http://www.card.mmu.ac.uk/ Fax: (+44) 161 247 1483 Contents Contents Mission Members of CARD What are Agents and why are they important? ... Bibliography Mission To undertake and apply high quality research into all aspects of agent-based systems, including analysis, foundations, development, and programming languages, and to promote collaborative research between the Centre and other groups, both within and outside MMU. Members of CARD Shaheena Abbas [Lecturer] Alexander Bolotov [Research Fellow] Clare Dixon [Senior Research Lecturer] Anatoli Degtiarev [Senior Research Lecturer] Michael Fisher [Professor] Mari Carmen Fernandez Gago [PhD Student] Chiara Ghidini [Senior Research Lecturer] Ullrich Hustadt [Senior Research Lecturer] Claudia Nalon [PhD Student] Peter Quigley [Senior Lecturer] Vladimir Sazonov [Senior Research Lecturer] We are interested in external collaboration and welcome visiting researchers. In addition, there are, from time to time, vacancies within the centre.

42. Temporal Logic temporal logic. We should mention that temporal logic is by no means theonly tool used in AI for enabling reasoning about time and change. http://www.rpi.edu/~brings/LOG AI/lai/node8.html

43. TIME International Symposium Series The annual International Workshop on Temporal Representation and Reasoning covers temporal representation and reasoning, including temporal logic. http://www.cs.uregina.ca/~temporal/

TIME International Symposium Series The TIME International Symposium Series began in 1994. The first six annual meetings were held as workshops in conjunction with the FLAIRS (Florida Artificial Intelligence Research Society) annual conference. As the workshop has grown, the participants decided to hold the annual meeting as an independent event. Since its inception, the purpose of this symposium series has been to bring together active researchers in the area of temporal representation and reasoning in Artificial Intelligence. Through paper presentations and discussions, the participants will exchange, compare, and contrast results in the area. Over the years, participation of researchers from areas outside of mainstream AI (especially the database community) has grown. For this reason, beginning with TIME-2001, we have opened the meeting to active researchers in temporal (including temporal-spatial) representation and reasoning from all areas. Additionally, the annual meeting has matured and the format has evolved to the point where it is more appropriately identified as a symposium rather than a workshop. Also, beginning with TIME-2001, we have adopted a track format for the symposium. For information about the current or previous meetings, follow the appropriate link below. Past, Present and Future Issues of the Symposium

44. Visual Specification Of Branching Time Temporal Logic Talk. Visual Specification of Branching Time temporal logic. http://www.computer.org/conferences/vl95/talks/T36.html

Talk Visual Specification of Branching Time Temporal Logic Alberto Del Bimbo, Luigi Rella, Enrico Vicario About the Authors Keywords Visual Formalism Visual Specification Languages Temporal Logic 3D Visualization Abstract Document in PostScript (compressed, 334188 bytes) Visual Programming with Graph Rewriting Systems ViTABaL: A Visual Language Supporting Design by Tool Abstraction Index of Talks ... Proceedings - 11th Intl. Symposium on Visual Languages

45. Spin A general tool for verifying the correctness of distributed software (designs) in a rigorous and mostly automated fashion. Can be used as a full linear temporal logic model checking system. http://netlib.bell-labs.com/netlib/spin/whatispin.html

46. Extending Statecharts With Temporal Logic March 1998 (Vol. 24, No. 3). pp. 216231 ExtendingStatecharts with temporal logic. http://www.computer.org/tse/ts1998/e0216abs.htm

March 1998 (Vol. 24, No. 3) p p. 216-231 Extending Statecharts with Temporal Logic Arcot  Sowmya, S.  Ramesh Abstract—The task of designing large real-time reactive systems, which interact continuously with their environment and exhibit concurrency properties, is a challenging one. In this paper, we explore the utility of a combination of behavior and function specification languages in specifying such systems and verifying their properties. An existing specification language, statecharts, is used to specify the behavior of real-time reactive systems, while a new logic-based language called FNLOG (based on first-order predicate calculus and temporal logic, is designed to express the system functions over real time. Two types of system properties, intrinsic and structural, are proposed. It is shown that both types of system properties are expressible in FNLOG and may be verified by logical deduction, and also hold for the corresponding behavior specification. Index Terms- Concurrency, FNLOG, formal specifications, reactive systems, real-time, robotics, statecharts, specification languages, state-machines, temporal logic. The full text of IEEE Transactions on Software Engineering is available to members of the IEEE Computer Society who have an online subscription and a web account

47. Basic Temporal Logic Basic temporal logic. Accordingly, the minimal temporal logic is axiomatizedby adding to system K the axiom (4), which corresponds to transitivity. http://www.informatik.uni-leipzig.de/~duc/Thesis/node52.html

Next: Propositional Dynamic Logic Up: Modal logic Previous: Montague-Scott semantics Contents Basic temporal logic The reading of the operator as ``always in the future'' (and accordingly, as ``sometimes in the future'') has proved plausible for many modal logics. Those systems are the most simple temporal (or tense) logics. Semantically, the ``possible worlds'' of a Kripke model are interpreted as moments in time, and the accessibility relation is viewed as the the relation ``later than''. Clearly, not all algebraic properties that can be imposed on binary relations are meaningful under a temporal interpretation. The most interesting properties are those characterizing ordering relations. Transitivity is probably the most basic condition that can be placed on the relation ``later than'', so it is typically assumed that temporal structures are transitive. Accordingly, the minimal temporal logic is axiomatized by adding to system K the axiom , which corresponds to transitivity. That system is denoted K , with the subscript indicating that a temporal logic is being considered.

48. Efficient Symbolic Tools A BDD based tool for the formal verification of concurrent systems using a propositional branchingtime 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/

EST Home Page EST SourceForge Page is a mirror of this page at SourceForge Project: Efficient Symbolic Tools Authors: Robert Meolic, Tatjana Kapus, Ales Casar, Mirjam Sepesy Maucec, Zmago Brezocnik Synopsis: Efficient Symbolic Tools package (EST) is a new tool for the verification of concurrent systems , which has not been widely presented yet. Its main advantages are the flexibility, portability and an efficient memory management. The latter is mainly the consequence of a well implemented BDD package with good garbage collection functions. EST distinguishes itself as a small and efficient package with an easily readable source code and well implemented algorithms. It runs on many different computers with different operating systems, including HP-UX, Linux, and Windows 95/98/NT. COBISS-ID: 5626902 (this number is used by Slovenian libraries) Source Forge: EST SourceForge Project Info Previews: license menu dialog colors ... an example of verification Binary release of EST, 1st edition est-1ed-linux.zip , Sep 21, 2001, (Intel, Debian 2.2.18, Tcl/Tk 8.2.3), est-1ed-solaris.zip

49. CS 557 References On Temporal Logic Session 18 4 October 1995. Some references for temporal logic. Hailpern, Brent T.,Verifying Concurrent Processes Using temporal logic , SpringerVerlag (1981). http://www.cs.colostate.edu/~cs557/read/temporal.html

Computer Science Department CS 557 (Distributed Systems) CJCSchauble Session 18: 4 October 1995 Some references for Temporal Logic Hailpern, Brent T., Verifying Concurrent Processes Using Temporal Logic , Springer-Verlag (1981). Lamport, Leslie, " Sometime is sometimes not never 7th POPL, , ACM (1980). Lamport, Leslie, "TIMESETS: A New Method for Temporal Reasoning About Programs," Logics of Programs , D. Kozen, ed., LNCS #131, Springer-Verlag (1982). Manna, Zohar and Pnueli, Amir, "Verification of Concurrent Programs: A Temporal Proof System," Department of Computer Science, Stanford University (Jun 1983), Report No. STAN-CS-83-967. Moszkowski, Executing Temporal Logic Programs , Cambridge University Press (1986). Pnueli, Amir, "The Temporal Logic of Programs," 18th Annual Symposium on Foundations of Computer Science , IEEE (1977). This is the classic reference. Pnueli, Amir, "The Temporal Semantics of Concurrent Processes," Proc. of the International Symposium on Semantics of Concurrent Computation , Springer-Verlag (1979).

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

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

52. Temporal Logic Lineartime temporal logic. A formula of temporal logic describes the set of infinitesequences for which it is true, also known as a temporal property . http://www-step.stanford.edu/tutorial/temporal-logic/temporal1.html

Linear-time Temporal Logic Temporal logic is a convenient formalism for specifying and verifying properties of reactive systems, as first pointed out by Pnueli in 1977. A formula of temporal logic describes the set of infinite sequences for which it is true, also known as a temporal property . A given system satisfies a property if all of its computations belong to this set. A model of linear-time temporal logic (LTL) is an infinite sequence of states where each point in time has a unique successor. Temporal formulas are evaluated over such a sequence of states together with an index i =0,1,2,... of the i 'th state. Syntax and informal description Besides the usual logical connectives, temporal formulas can be composed using temporal operators. We describe these briefly, with p and q being sub-formulas. Future Temporal Operators []p Henceforth p p Eventually p p Until q q holds some time in the future, and p holds at least up to the first q p Awaits q Either p holds indefinitely, or p Until q p holds at the next time instance Past Temporal Operators [-]p So-far p p Once p p Since q q did hold some time in the past, and p held at least down to the first q

53. KLUWER Academic Publishers | Advances In Temporal Logic Books » Advances in temporal logic. Advances in temporal logic. Addto cart. edited by Howard Barringer University of Manchester, UK http://www.wkap.nl/prod/b/0-7923-6149-0

Title Authors Affiliation ISBN ISSN advanced search search tips Books Advances in Temporal Logic Advances in Temporal Logic Add to cart edited by Howard Barringer University of Manchester, UK Michael Fisher Manchester Metropolitan University, UK Dov M. Gabbay Dept. of Computer Science, King's College, London, UK Graham Gough University of Manchester, UK Book Series: APPLIED LOGIC SERIES Volume 16 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. Readership : Any student of the area - postgraduate, postdoctoral or even research professor - will find the book most valuable. Computing professionals requiring state-of-the-art knowledge in the area will appreciate the volume for its leading results and its links to other relevant literature.

54. KLUWER Academic Publishers | Temporal Logic Books » temporal logic. temporal logic From Ancient Ideas to ArtificialIntelligence. Add to cart. by Peter Øhrstrøm Dept. of Communication http://www.wkap.nl/prod/b/0-7923-3586-4

Title Authors Affiliation ISBN ISSN advanced search search tips Books Temporal Logic Temporal Logic From Ancient Ideas to Artificial Intelligence Add to cart by Dept. of Communication, Aalborg University, Denmark Per F.V. Hasle Dept. of Information Science, University of Aarhus, Denmark Book Series: STUDIES IN LINGUISTICS AND PHILOSOPHY Volume 57 Temporal Logic: From Ancient Ideas to Artificial Intelligence deals with the history of temporal logic as well as the crucial systematic questions within the field. The book studies the rich contributions from ancient and medieval philosophy up to the downfall of temporal logic in the Renaissance. The modern rediscovery of the subject, which is especially due to the work of A. N. Prior, is described, leading into a thorough discussion of the use of temporal logic in computer science and the understanding of natural language. Temporal Logic: From Ancient Ideas to Artificial Intelligence thus interweaves linguistic, philosophical and computational aspects into an informative and inspiring whole. Contents Kluwer Academic Publishers, Dordrecht

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

56. Temporal Logic Definition of temporal logic, possibly with links to more informationand implementations. NIST. temporal logic. (definition). http://www.nist.gov/dads/HTML/temporllogic.html

temporal logic (definition) Definition: A logic with a notion of time included. The formulas can express facts about past, present, and future states. The formulas are interpreted over Kripke structures, which can model computation; hence temporal logic is very useful in formal verification Author: SKS Implementation The SMV model checker. Go to the Dictionary of Algorithms and Data Structures home page. If you have suggestions, corrections, or comments, please get in touch with Paul E. Black (paul.black@nist.gov). Entry modified Sat Sep 4 16:48:17 1999. HTML page formatted Tue Dec 3 12:15:04 2002. This page's URL is http://www.nist.gov/dads/HTML/temporllogic.html

57. Verifying Temporal Formulas In The Temporal Logic Of Actions Verifying Temporal Formulas in the temporal logic of Actions. LucianWischik, University of Cambridge. The temporal logic of Actions. http://gatekeeper.research.compaq.com/pub/DEC/SRC/technical-notes/SRC-1999-003-h

58. Interval Temporal Logic Interval temporal logic. Interval temporal logic (ITL) is an important class oftemporal logic which was initally devised by Ben Moskowski in the 1980's. http://www.cs.ukc.ac.uk/people/staff/hb5/interval.html

Interval Temporal Logic Howard Bowman Interval Temporal Logic (ITL) is an important class of temporal logic which was initally devised by Ben Moskowski in the 1980's. Standard temporal logics (see e.g. this page ) are defined over infinite state models, for example, the models for Manna and Pnueli Linear Time Temporal Logic are infinite state sequences. However, in interval temporal logic the model theory is restricted to finite state sequences, called intervals (although, supporting infinite state sequences is currently being investigated). There are a number of reasons for being interested in such logics. One reason is that interval temporal logic lends itself to execution. This is apparent from Moskowski's initial work. In addition, a number of interesting and powerful operators arise naturally from ITL. In fact, it is straightforward to derive operators very like the constructs of imperative programming (e.g. assignment, conditionals, iteration etc). This then yields the possibility that abstract specifications and concrete implementations can be realised in the same notation, with refinement mappings between. An additional aspect of interval temporal logic is that it provides a very simple real-time model in which one unit of time is past when moving from state to state. Consequently, timings can be obtained by measuring interval lengths.

59. Computer Science: Publication: Mexitl: Multimedia In Executable Interval Tempora Mexitl Multimedia in Executable Interval temporal logic, H. Bowman and H. Cameronand P. King and SJ Thompson, 2003, Computer Science, University of Kent at http://www.cs.ukc.ac.uk/pubs/2003/1570/

Mexitl: Multimedia in executable interval temporal logic H. Bowman, H. Cameron, P. King, and S.J. Thompson Formal Methods in System Design , 22:5-38, January 2003. Abstract This paper explores a formalism for describing a wide class of multimedia document constraints. The formalism is based on an interval temporal logic. We describe the requirements on temporal logic specification that arise from the multimedia documents application area. In particular, we highlight a canonical specification example. Then we present the temporal logic formalism that we use. This extends existing interval temporal logic with a number of new features: actions, framing of actions, past operators, a projection like operator called filter and a new handling of interval length. A model theory and satisfaction relation is defined for the notation and a specification of the canonical example is presented. Bibtex Record Contact address Enquiries about UKC Computing Laboratory publications should be made to: Publications Officer Computing Laboratory The University Canterbury Kent Home Teaching People Search ... Help Last modified Thursday January 23 14:07:28 GMT 2003 Problems with this page? Contact the

60. Temporal Logic next up previous contents Next Probabilistic Logic Up Temporal ProbabilisticLogic Previous Temporal Probabilistic Logic. temporal logic. http://www.uwasa.fi/cs/publications/2NWGA/node285.html

Next: Probabilistic Logic Up: Temporal Probabilistic Logic Previous: Temporal Probabilistic Logic Temporal Logic As a basis for describing the genetic algorithm we will use a combination of classical first-order logic, temporal logic [ , and probabilistic logic [ As far as temporal logic is concerned, our logic is based on temporal intervals, typically denoted I . Intervals may be used in expressions in various ways, using the following operators (table Given an interval I we have the following two operations on intervals. In order to reason within our logic we need to define some basic operators, in addition to the standard first-order logic with its boolean operators (disjunction), (conjunction), (negation), (implication) and (equivalence). We also have the first order operators (existence), and (universality). Following Manna and Pnueli [ , the temporal operators in table are sufficient for our purposes. Table: operators. p and q are general propositions. for intervals. Note that some of these operators are `weak' versions: wait-for is a weak version of the until operator which allows for the possibility that q never occurs and, then

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 3     41-60 of 104    Back | 1  | 2  | 3  | 4  | 5  | 6  | Next 20