On the freeze quantifier in Constraint LTL: Decidability and complexity
From MaRDI portal
(Redirected from Publication:868025)
Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Specification and verification (program logics, model checking, etc.) (68Q60) Decidability of theories and sets of sentences (03B25) Temporal logic (03B44)
Recommendations
Cites work
- scientific article; zbMATH DE number 1670482 (Why is no real title available?)
- scientific article; zbMATH DE number 1048047 (Why is no real title available?)
- scientific article; zbMATH DE number 1954380 (Why is no real title available?)
- scientific article; zbMATH DE number 2080995 (Why is no real title available?)
- scientific article; zbMATH DE number 2086420 (Why is no real title available?)
- scientific article; zbMATH DE number 2086598 (Why is no real title available?)
- scientific article; zbMATH DE number 1841828 (Why is no real title available?)
- scientific article; zbMATH DE number 2090515 (Why is no real title available?)
- scientific article; zbMATH DE number 1424043 (Why is no real title available?)
- scientific article; zbMATH DE number 2196601 (Why is no real title available?)
- scientific article; zbMATH DE number 3291134 (Why is no real title available?)
- scientific article; zbMATH DE number 2243382 (Why is no real title available?)
- A logical characterization of data languages.
- A really temporal logic
- A semantics of sequence diagrams.
- A theory of timed automata
- An algebraic approach to data languages and timed languages
- Automated Technology for Verification and Analysis
- Axiomatizing the monodic fragment of first-order temporal logic
- CONCUR 2005 – Concurrency Theory
- Computer Science Logic
- Constrained properties, semilinear systems, and Petri nets
- Decidable fragments of first-order temporal logics
- Equality and monodic first-order temporal logic
- Finite state machines for strings over infinite alphabets
- Flat fragments of CTL and CTL: separating the expressive and distinguishing powers
- Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems
- Hierarchies of modal and temporal logics with reference pointers
- Introduction to constraint databases
- Many-dimensional modal logics: theory and applications
- Modal Logics Between Propositional and First-order
- NExpTime-complete description logics with concrete domains
- Reversal-Bounded Multicounter Machines and Their Decision Problems
- Temporal logic can be more expressive
- The benefits of relaxing punctuality
- The complexity of propositional linear temporal logics
- “Sometimes” and “not never” revisited
Cited in
(17)- Temporal stream logic modulo theories
- Model checking memoryful linear-time logics over one-counter automata
- Reactive synthesis from visibly register pushdown automata
- scientific article; zbMATH DE number 7136664 (Why is no real title available?)
- Querying best paths in graph databases
- Future-Looking Logics on Data Words and Trees
- Model checking flat Freeze LTL on one-counter automata
- scientific article; zbMATH DE number 7407799 (Why is no real title available?)
- Taming strategy logic: non-recurrent fragments
- The complexity of flat freeze LTL
- The complexity of flat freeze LTL
- Expressiveness of hybrid temporal logic on data words
- Optimal run problem for weighted register automata
- Complexity results on register context-free grammars and related formalisms
- Some Recent Results in Metric Temporal Logic
- Beyond Shapes: Lists with Ordered Data
- Automata and grammars for data words
This page was built for publication: On the freeze quantifier in Constraint LTL: Decidability and complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q868025)
