LTL with the freeze quantifier and register automata
From MaRDI portal
Publication:2946574
Recommendations
Cited in
(71)- The complexity of flat freeze LTL
- The complexity of flat freeze LTL
- Church synthesis on register automata over linearly ordered data domains
- Set augmented finite automata over infinite alphabets
- $$\textsc {Reach}$$ on Register Automata via History Independence
- Temporal stream logic modulo theories
- Reasoning on data words over numeric domains
- scientific article; zbMATH DE number 7136664 (Why is no real title available?)
- Realizability problem for constraint LTL
- Universality Problem for Unambiguous VASS
- A Note on C² Interpreted over Finite Data-Words
- scientific article; zbMATH DE number 7471703 (Why is no real title available?)
- Model checking flat Freeze LTL on one-counter automata
- Optimal run problem for weighted register automata
- scientific article; zbMATH DE number 7577573 (Why is no real title available?)
- Ordered navigation on multi-attributed data words
- Branching-time logics repeatedly referring to states
- Separation logics and modalities: a survey
- Trace inclusion for one-counter nets revisited
- Linear-time temporal logic with event freezing functions
- Nondeterministic and co-nondeterministic implies deterministic, for data languages
- Satisfiability of \(\operatorname{ECTL}^\ast\) with constraints
- A note on the emptiness problem for alternating finite-memory automata
- Process-centric views of data-driven business artifacts
- Model-Checking Counting Temporal Logics on Flat Structures
- On computability of data word functions defined by transducers
- The Parametric Complexity of Lossy Counter Machines
- scientific article; zbMATH DE number 7649933 (Why is no real title available?)
- On temporal logics with data variable quantifications: decidability and complexity
- Timeline-based planning over dense temporal domains
- On freeze LTL with ordered attributes
- Reactive synthesis from visibly register pushdown automata
- Satisfiability of \(\mathrm{ECTL}^*\) with local tree constraints
- Safety alternating automata on data words
- Expressiveness of hybrid temporal logic on data words
- Streamable regular transductions
- Adding one or more equivalence relations to the interval temporal logic \(\mathsf{AB}\overline{\mathsf{B}}\)
- The containment problem for unambiguous register automata
- An automata-theoretic approach to constraint LTL
- Algorithmic Analysis of Array-Accessing Programs
- Model checking memoryful linear-time logics over one-counter automata
- Reactive synthesis from interval temporal logic specifications
- scientific article; zbMATH DE number 7447743 (Why is no real title available?)
- On the termination and structural termination problems for counter machines with incrementing errors
- Logics of repeating values on data trees and branching counter systems
- Nominal automata with name binding
- A taxonomy and reductions for common register automata formalisms
- Reachability in pushdown register automata
- Trace inclusion for one-counter nets revisited
- Future-Looking Logics on Data Words and Trees
- scientific article; zbMATH DE number 7566065 (Why is no real title available?)
- First-order \(\mu\)-calculus over generic transition systems and applications to the situation calculus
- Extending two-variable logic on data trees with order on data values and its automata
- Automated program verification
- Synthesis of data word transducers
- Regular expressions for data words
- Computable fixpoints in well-structured symbolic model checking
- Active learning for deterministic bottom-up nominal tree automata
- Metric propositional neighborhood logic with an equivalence relation
- Weighted register automata and weighted logic on data words
- A class of automata for the verification of infinite, resource-allocating behaviours
- Complexity results on register context-free grammars and related formalisms
- Weighted register automata and weighted logic on data words
- Selective monitoring
- Temporal logics of repeating values
- Weak and nested class memory automata
- An automaton over data words that captures EMSO logic
- Complexity hierarchies beyond elementary
- On pebble automata for data languages with decidable emptiness problem
- The containment problem for unambiguous register automata and unambiguous timed automata
- SMT-based satisfiability of first-order LTL with event freezing functions and metric operators
This page was built for publication: LTL with the freeze quantifier and register automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2946574)
