Pages that link to "Item:Q2946574"
From MaRDI portal
The following pages link to LTL with the freeze quantifier and register automata (Q2946574):
Displayed 50 items.
- Satisfiability of \(\operatorname{ECTL}^\ast\) with constraints (Q269503) (← links)
- Adding one or more equivalence relations to the interval temporal logic \(\mathsf{AB}\overline{\mathsf{B}}\) (Q288804) (← links)
- Metric propositional neighborhood logic with an equivalence relation (Q329414) (← links)
- On temporal logics with data variable quantifications: decidability and complexity (Q342712) (← links)
- An automata-theoretic approach to constraint LTL (Q870361) (← links)
- Model checking memoryful linear-time logics over one-counter automata (Q974117) (← links)
- Branching-time logics repeatedly referring to states (Q1047801) (← links)
- First-order \(\mu\)-calculus over generic transition systems and applications to the situation calculus (Q1706163) (← links)
- Weighted register automata and weighted logic on data words (Q1786559) (← links)
- On pebble automata for data languages with decidable emptiness problem (Q1959427) (← links)
- Timeline-based planning over dense temporal domains (Q1989337) (← links)
- On the termination and structural termination problems for counter machines with incrementing errors (Q2037198) (← links)
- The containment problem for unambiguous register automata and unambiguous timed automata (Q2048204) (← links)
- Reactive synthesis from interval temporal logic specifications (Q2062122) (← links)
- Reactive synthesis from visibly register pushdown automata (Q2119985) (← links)
- SMT-based satisfiability of first-order LTL with event freezing functions and metric operators (Q2182731) (← links)
- On computability of data word functions defined by transducers (Q2200823) (← links)
- Nondeterministic and co-nondeterministic implies deterministic, for data languages (Q2233422) (← links)
- Computable fixpoints in well-structured symbolic model checking (Q2248074) (← links)
- Streamable regular transductions (Q2286735) (← links)
- Regular expressions for data words (Q2353403) (← links)
- Reachability in pushdown register automata (Q2396722) (← links)
- Process-centric views of data-driven business artifacts (Q2396822) (← links)
- Satisfiability of \(\mathrm{ECTL}^*\) with local tree constraints (Q2411048) (← links)
- A note on the emptiness problem for alternating finite-memory automata (Q2437765) (← links)
- Trace inclusion for one-counter nets revisited (Q2636512) (← links)
- Complexity results on register context-free grammars and related formalisms (Q2672616) (← links)
- Automated Program Verification (Q2799160) (← links)
- Weak and Nested Class Memory Automata (Q2799172) (← links)
- On Freeze LTL with Ordered Attributes (Q2811345) (← links)
- A Class of Automata for the Verification of Infinite, Resource-Allocating Behaviours (Q2811927) (← links)
- Expressiveness of Hybrid Temporal Logic on Data Words (Q2825412) (← links)
- Complexity Hierarchies beyond Elementary (Q2828216) (← links)
- Nominal Automata with Name Binding (Q2988364) (← links)
- Logics of Repeating Values on Data Trees and Branching Counter Systems (Q2988368) (← links)
- An Automaton over Data Words That Captures EMSO Logic (Q3090829) (← links)
- Weighted Register Automata and Weighted Logic on Data Words (Q3179411) (← links)
- Future-Looking Logics on Data Words and Trees (Q3182936) (← links)
- Playing with Repetitions in Data Words Using Energy Games (Q3300789) (← links)
- (Q3384172) (← links)
- (Q3384890) (← links)
- Trace Inclusion for One-Counter Nets Revisited (Q3447702) (← links)
- Path Checking for MTL and TPTL over Data Words (Q3451113) (← links)
- Algorithmic Analysis of Array-Accessing Programs (Q3644742) (← links)
- Separation logics and modalities: a survey (Q4586138) (← links)
- (Q4611376) (← links)
- (Q4972731) (← links)
- (Q4972736) (← links)
- (Q5009434) (← links)
- (Q5028468) (← links)