Sciweavers

17 search results - page 3 / 4
» The complexity of linear-time temporal logic over the class ...
Sort
View
CORR
2008
Springer
141views Education» more  CORR 2008»
13 years 5 months ago
Model checking memoryful linear-time logics over one-counter automata
We study complexity of the model-checking problems for LTL with registers (also known as freeze LTL and written LTL ) and for first-order logic with data equality tests (written F...
Stéphane Demri, Ranko Lazic, Arnaud Sangnie...
16
Voted
CSL
2008
Springer
13 years 7 months ago
Quantified Positive Temporal Constraints
Abstract. A positive temporal template (or a positive temporal constraint language) is a relational structure whose relations can be defined over countable dense linear order witho...
Witold Charatonik, Michal Wrona
LICS
2007
IEEE
14 years 2 days ago
The Cost of Punctuality
In an influential paper titled “The Benefits of Relaxing Punctuality” [2], Alur, Feder, and Henzinger introduced Metric Interval Temporal Logic (MITL) as a fragment of the r...
Patricia Bouyer, Nicolas Markey, Joël Ouaknin...
ENTCS
2007
90views more  ENTCS 2007»
13 years 5 months ago
Undecidability of Multi-modal Hybrid Logics
This paper establishes undecidability of satisfiability for multi-modal logic equipped with the hybrid binder ↓ , with respect to frame classes over which the same language wit...
Martin Mundhenk, Thomas Schneider 0002
FUIN
2007
135views more  FUIN 2007»
13 years 5 months ago
On First-Order Fragments for Mazurkiewicz Traces
Mazurkiewicz traces form a model for concurrency. Temporal logic st-order logic are important tools in order to deal with the abstract behavior of such systems. Since typical prop...
Volker Diekert, Martin Horsch, Manfred Kufleitner