Automata based verification over linearly ordered data domains
From MaRDI portal
Recommendations
- An automata model for trees with ordered data values
- Extending two-variable logic on data trees with order on data values and its automata
- Feasible automata for two-variable logic with successor on data words
- Automata over infinite alphabets
- Abstraction refinement for emptiness checking of alternating data automata
Cited in
(10)- Process-centric views of data-driven business artifacts
- Decision Problems for Finite Automata over Infinite Algebraic Structures
- Separation logics and modalities: a survey
- Checking linearizability of concurrent priority queues
- Church synthesis on register automata over linearly ordered data domains
- First steps towards taming description logics with strings
- Constraint automata on infinite data trees: from \(\mathrm{CTL}(\mathbb{Z})/\mathrm{CTL}^*(\mathbb{Z})\) to decision procedures
- Constraint automata on infinite data trees: from CTL\((\mathbb{Z})\text{CTL}^*(\mathbb{Z})\) to decision procedures
- Reachability and bounded emptiness problems of constraint automata with prefix, suffix and infix
- Church synthesis on register automata over linearly ordered data domains
This page was built for publication: Automata based verification over linearly ordered data domains
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3113674)
