Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

51

CORR
2006
Springer

84views Education» more CORR 2006»

On the freeze quantifier in Constraint LTL: decidability and complexity

15 years 2 months ago

On the freeze quantifier in Constraint LTL: decidability and complexity

Download www.lsv.ens-cachan.fr

Stéphane Demri, Ranko Lazic, David Nowak

Real-time Traffic

CORR 2006 | Education |

claim paper

Related Content

» Model Checking Freeze LTL over OneCounter Automata

» Lineartime temporal logics with Presburger constraints an overview

» Taming Past LTL and Flat Counter Systems

» Model checking memoryful lineartime logics over onecounter automata

» Quantified Equality Constraints

» Quantified Positive Temporal Constraints

» Deciding Boolean Algebra with Presburger Arithmetic

» The FirstOrder Theory of Sets with Cardinality Constraints is Decidable

» An Algorithm for Deciding BAPA Boolean Algebra with Presburger Arithmetic

Post Info
More Details (n/a)

Added	11 Dec 2010
Updated	11 Dec 2010
Type	Journal
Year	2006
Where	CORR
Authors	Stéphane Demri, Ranko Lazic, David Nowak

Comments (0)