
	Where results make sense

Topic: Linear temporal logic

Related Topics

Operation Ivy Blizzard

List of state leaders in 988

SRM

Calais

Honen

Aspar

Einhard

Zhejiang

INXS

Leros

558 BC

370 BC

In the News (Sat 26 Dec 09)

Northern Trust

Marvin Harrison

Peter Chernin

Gary Locke

Match Play

Penelope Cruz

Mickey Rourke

AR Rahman

Danny Boyle

Hugh Jackman

	Temporal logic (Site not responding. Last check: 2007-10-22)
		In logic, the term temporal logic is used to describe any system of rules and symbolism for representing, and reasoning about, propositions qualified in terms of time.
		Temporal logic was first studied in depth by Aristotle, and his writings are filled with a crude form of first order temporal modal binary logic.
		Any logic which views time as a sequence of states, is a temporal logic, and any logic which uses only two truth values, is a binary logic.
	www.sciencedaily.com /encyclopedia/temporal_logic (330 words)

	Encyclopedia: Linear Temporal Logic (Site not responding. Last check: 2007-10-22)
		Linear temporal logic (LTL) is a field of mathematical logic that is able to talk about the future of paths.
		LTL formulas are generally evaluated over paths and a position on that path.
		LTL can be shown to be equivalent to the first-order logic over one successor and the smaller relation, FO[S,<] as well as star-free regular expressions or deterministic finite automata with loop complexity 0.
	www.nationmaster.com /encyclopedia/Linear-Temporal-Logic (215 words)

	Temporal Logic
		Tense Logic was introduced by Arthur Prior (1957, 1967, 1969) as a result of an interest in the relationship between tense and modality attributed to the Megarian philosopher Diodorus Cronus (ca.
		This kind of manoeuvre lies at the heart of hybrid temporal logics in which the standard apparatus of propositions and tense operators is supplemented by propositions which are true at unique instants, thereby effectively naming those instants without invoking philosophically dubious reification.
		Prior's motivation for inventing Tense Logic was largely philosophical, his idea being that the precision and clarity afforded by a formal logical notation was indispensible for the careful formulation and resolution of philosophical issues concerning time.
	plato.stanford.edu /entries/logic-temporal (3508 words)

	Interval Temporal Logic
		Interval Temporal Logic (ITL) is an important class of temporal logic which was initally devised by Ben Moskowski in the 1980's.
		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.
		A further reason for being interested in logics containing chop and repetition operators (such as projection) is that they address the problem of the limited expressiveness of classic point based temporal logics such as linear and branching time temporal logics.
	www.cs.ukc.ac.uk /people/staff/hb5/interval.html (528 words)

	Distributed Versions of Linear Time Temporal Logic: A Trace Perspective (Site not responding. Last check: 2007-10-22)
		Linear time Temporal Logic (LTL) has become a well established tool for specifying the dynamic behaviour of distributed systems.
		In these logics, every specification is guaranteed to have the ``all-or-none'' property and hence can take advantage of the partial-order based reduction methods during the verification process.
		The study of these logics also exposes the richness of the partial-order settings from a logical standpoint and the complications that can arise as a consequence.
	www.brics.dk /RS/98/8 (410 words)

	Model-Checking Kit
		A model-checker for the next-free fragment of LTL: pep-ltl.
		A model-checker for the next-free fragment of LTL: prod-ltl.
		A model-checker for the next-free fragment of LTL: spin-ltl
	www.fmi.uni-stuttgart.de /szs/tools/mckit/overview.shtml (2051 words)

	Project proposal: Automatic Verification of Linear Temporal Logic (Site not responding. Last check: 2007-10-22)
		Linear Temporal Logic (LTL) can be used as a specification notation for e.g.
		Using LTL one can express properties of protocols such as ``every request is eventually followed by a response''.
		The aim of the project is to implement an algorithm for automatic verification of LTL, for example that described in the research paper Simple On-the-fly Automatic Verification of Linear Temporal Logic, or An Automata-Theoretic Approach to Linear Temporal Logic.
	www.cs.bham.ac.uk /~mzk/projects/mzk.auto.verif.html (209 words)

	Mechanized Reasoning Systems (Site not responding. Last check: 2007-10-22)
		E is a theorem prover for clausal logic with equality.
		MONA is an implementation of decision procedures for weak second-order logics of successors.
		Nqthm is a prover for quantifier free logic for recursive functions over the integers and other finitely generated structures, combining rewriting, heuristics for induction, and other techniques.
	www-formal.stanford.edu /clt/ARS/systems.html (1545 words)

	Advances in Modal Logic : Tools : Computational Tools
		BLIKSEM - Hans de Nivelle's resolution based theorem prover for modal logic and first-order logic with equality.
		Logics Workbench (LWB) - A sequent based theorem prover for a range of propositional logics, including modal logics, temporal logics, intuitionistic logics and nonmonotonic logics.
		Saturate - An experimental theorem prover for first-order logic, primarily based on saturation.
	www.cs.man.ac.uk /~schmidt/tools (655 words)

	Modelling and Testing Object-Oriented Distributed Systems with Linear-time Temporal Logic
		Numerous proposals for applying temporal logic to the specification and verification of object-oriented systems have appeared in the past several years.
		Although various temporal models have been proposed for the requirements analysis of object-oriented distributed systems, there is no similar body of work for the design phase.
		We show that although temporal logic is a powerful tool for behavior specifications, its basic formulation does not have the expressive power required for non-trivial object systems.
	icapeople.epfl.ch /dietrich/pubs/TR001/paper.html (176 words)

	Chapter 4 Web book - Formal Verification
		Temporal logic is an extension of conventional (propositional) logic which incorporates special operators that cater for time.
		The specification is done with (Temporal) logic statements that make assertions about properties and relationships in the past, present, and the future.
		This logic is given by a formal system, which defines a set of axioms and a set of inference rules.
	www.cis.ksu.edu /%7Ehankley/d841/Fa99/chap4.html (3976 words)

	Modal Temporal Logic (Site not responding. Last check: 2007-10-22)
		Research into temporal logic includes the study of temporal logic within the framework of logic and covers: axiom systems, theorem proving and proof theory, model theory, execution models and applications.
		The efficiency of the execution stems from viewing temporal evaluations as temporal constraints on intervals end points and generating maximal intervals at which formulae holds.
		Investigation of theorem proving for modal temporal logic led to the development of a non-clausal theorem prover for first order temporal logic.
	www.comp.brad.ac.uk /research/ai/temporal.html (181 words)

	Research projects: pttf satisfiability checker (Site not responding. Last check: 2007-10-22)
		The advantage of the temporal logic specifications is based on the fact that it is possible to obtain the model graph of the specifications which accepts all the sequences of the events, actions or states of the specified system.
		A simple satisfiability analysis method for transitions programs, composed of a set of temporal transition formulas, by solving a system of fixpoint equations has been proposed and is used in the implementation of the pttf tool.
		With pttf tool it is possible to use propositional temporal transition formulas, which are a subset of the linear time propositional temporal logic (PTL) formulas, to specify and implement a large class of systems, such as distributed, real time and sequential systems.
	www.ase.md /~aursu/research_pttf_en.html (677 words)

	workmodels
		Temporal Logic (TL), also known as Chronological Logic and Tense Logic, as defined by the Encyclopedia Britannica, has as its object to "systemize reasoning with time-related propositions." Further, "some essential reference to the before-after…or the past-present-future relationship is at issue; and the ideas of succession, change and constancy enter in [27]."
		Temporal Logic, which is the logic upon which model-based verification or model checking is built, originated in philosophy as a branch of logic dealing with the "topology of time".
		The input language of SMV is CTL, a temporal logic language, and is designed to allow the description of finite state systems that range from synchronous to asynchronous, and from the detailed to the abstract.
	www.cis.ksu.edu /~hankley/d841/old/cis841/modelchecking/models.html (6520 words)

	Integrating processes in temporal logic. (Site not responding. Last check: 2007-10-22)
		The idea is that in a temporal logic processes are ordinary syntactical objects with a specific semantical representation.
		So we want to achieve a `temporal logics of processes' to adequately describe aspects of systems dealing with data structures, reactive and time-critical behavior, environmental influences, and their interaction in a single frame.
		Such a set has to respects the structure of the underlying temporal logic, but not one to one, we do not require that for a path in the time structure there is exactly one possible run.
	www.ubka.uni-karlsruhe.de /indexer-vvv/ira/1997/22 (333 words)

	Equivalences, preorders and compositional verification for linear time temporal logic and concurrent systems, A-1996-1
		A promising approach to formal specification and verification of finite-state concurrent systems is using propositional temporal logic as a specification language and applying automated model-checking algorithms for the verification task.
		It is shown that NDFD preserves all nexttime-less linear temporal logic properties, and that it is compositional with respect to parallel composition and abstraction by hiding and encapsulation.
		that it is fully abstract with respect to preserving nexttime-less linear temporal logic properties in an arbitrary context.
	www.cs.helsinki.fi /TR/A-1996/1 (421 words)

	CONCUR01: Abstract for Paper 58 (Site not responding. Last check: 2007-10-22)
		It is now recognized that a good language should extend linear temporal logic with the ability to specify all $\omega$-regular properties.
		Early extensions of linear temporal logic with automata use nondeterministic B\"uchi automata.
		It follows that the PSPACE-complete, as are the ones for LTL and its earlier extensions with automata.
	concur01.cs.auc.dk /accepted/Abstracts/58.html (258 words)

	CULT Online (Site not responding. Last check: 2007-10-22)
		It is shown that the decision problem for the temporal logic with the strict until operator over general linear time is PSPACE-complete.
		This shows that it is no harder to reason with arbitrary linear orderings than with discrete linear time temporal logics.
		The complexity of the temporal logic with “until” over general linear time, Journal of Computer and System Sciences, 66 (2003) pp 393-426.
	www.csse.uwa.edu.au /%7Emark/research/Online/CULT.htm (100 words)

	Modelling and Testing Object-Oriented Distributed Systems with Linear-time Temporal Logic (Site not responding. Last check: 2007-10-22)
		Although various temporal models have been proposed for the requirements analysis of object-oriented distributed systems, there is no similar amount of work for the design- and implementation phase.
		In our model, which relies on event-based behavioral abstraction, we use linear-time temporal logic as the underlying formalism for the specification of behavioral constraints.
		We show that although temporal logic is a powerful tool for behavior specifications, it does not have the expressive power required for non-trivial object systems.
	icapeople.epfl.ch /dietrich/pubs/TR001.html (193 words)

	Linear Temporal Logic Satisfiability-Checking
		This logic is convenient for representing and verifying properties of reactive and concurrent systems, including software and electronic circuits.
		The classical algorithm for this task defines possible states as settings of the truth-values of particular formulas which are relevant to the given formula; possible states are constructed and then linked according to their associated formulas' constraints on temporally adjacent states, and then certain fulfillment-conditions are checked.
		Then, whereas classical proofs of correctness for such algorithms are existential, the proof here is constructive; the proof here shows that for any given formula being checked, any model of the formula is embedded in the graph of possible states, which implies that the algorithm here can find the model.
	www.cs.ucsb.edu /research/colloquia/abstracts/mcguire96.shtml (211 words)

	Efficient Verification of Parallel Real-Time Systems (Site not responding. Last check: 2007-10-22)
		The approach is based on the idea of (1) using only differences of timing variables to be able to construct a finite representation of the set of all reachable states and (2) further reducing the size of this representation by exploiting the concurrency in the net.
		This reduction of the state space is possible, because the considered linear-time temporal logic is stuttering invariant.
		In this paper the theory of timing verification with time Petri nets and temporal logic is presented, a concrete model checking algorithm is developed and proved to be correct, and some experimental results demonstrating the efficiency of the method are given.
	yoneda-www.cs.titech.ac.jp /Papers/ys97.htm (177 words)

	A Product Version of Dynamic Linear Time Temporal Logic (Site not responding. Last check: 2007-10-22)
		We present here a linear time temporal logic which simultaneously extends LTL, the propositional temporal logic of linear time, along two dimensions.
		Secondly, the core formulas of the logic are decorated with names of sequential agents drawn from fixed finite set.
		The resulting logic has a natural semantics in terms of the runs of a distributed program consisting of a finite set of sequential programs that communicate by performing common actions together.
	www.brics.dk /RS/97/9 (156 words)

	Shengbing Jiang: Failure Diagnosis of Discrete Event Systems—A Temporal Logic Approach (Site not responding. Last check: 2007-10-22)
		The use of Linear Temporal Logic formulae for specifying failures in the system is advocated.
		It is argued that they can capture the failures representing the violation of both liveness and safety properties, whereas earlier developed formal language/automaton-based specifications can capture only failures representing the violation of safety properties (such as the occurrence of a faulty event or the arrival at a failure state).
		The complexity of the algorithm is exponential in the length of each specification LTL formula, and polynomial in the number of system states and the number of specifications.
	www.lb.cs.cmu.edu /afs/cs/project/svc/www/talks/20050302-jiang.html (301 words)

	Real-Time Logics: Complexity and Expressiveness - Storming Media
		To study temporal logics for real time systems, the authors combine this classical theory of infinite state sequences with a theory of time, via a monotonic function that maps every state to its time.
		This framework allows one to classify a wide variety of real time logics according to their complexity and expressiveness.
		The authors are, however, able to identify two elementary real time temporal logics as expressively complete fragments of the theory of timed state sequences, and give tableau-based decision procedures.
	www.stormingmedia.us /14/1443/A144323.html (195 words)

	Locally Linear Time Temporal Logic - Ramanujam (ResearchIndex)
		Abstract: We study linear time temporal logics of multiple agents, where the temporal modalities are local.
		The models for these logics are simple : runs of networks of synchronizing automata.
		A number of linear time temporal logics to be interpreted directly over Mazurkiewicz traces (e.g.
	citeseer.ist.psu.edu /ramanujam96locally.html (555 words)

	Temporal Logic and Semidirect Products: An Effective Characterization of the Until Hierarchy (Site not responding. Last check: 2007-10-22)
		We use this connection to obtain an algebraic characterization of the until hierarchy of linear temporal logic.
		(The kth level of that hierarchy is comprised of all temporal properties that are expressible by a formula of nesting depth k in the until operator.) Applying deep results from finite semigroup theory we are able to prove that each level of the until hierarchy is decidable.
		By means of Ehrenfeucht--Fraissé games, we extend the results from linear temporal logic over finite sequences to linear temporal logic over infinite sequences.
	epubs.siam.org /sam-bin/dbq/article/32277 (196 words)

	Verification of reactive systems and decision problems in temporal logic
		We study decision problems related to system analysis in automata theory and temporal logic.
		Then, we study if we can generalize the syntax of linear hybrid automata for describing flows without sacrificing the polyhedral property: given a state-set described by a polyhedron, the set of states that can be reached, as time elapses, is also a polyhedron.
		We extend linear hybrid automata by allowing flows described by origin-dependent rate polytopes, in which the allowed rates depend, not only on the current control mode, but also on the specific state at which the mode was entered.
	repository.upenn.edu /dissertations/AAI3031687 (404 words)

	Página personal de Carlos Gustavo Lopez Pombo (Site not responding. Last check: 2007-10-22)
		Interpretability of linear time temporal logic in fork algebra.
		In this paper we prove theorems on the interpretability of the first-order temporal logics LTL and TL into Fork Algebras.
		This result is part of a research project on the interpretability of logics in Fork Algebras, and has important applications towards the relational specification of properties of systems within the Argentum tool.
	www.dc.uba.ar /people/exclusivos/clpombo/pag/espanol/frias_jlap04.html (81 words)

Try your search on: Qwika (all wikis)