A logical characterization of data languages.
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 1633145 (Why is no real title available?)
- scientific article; zbMATH DE number 988807 (Why is no real title available?)
- scientific article; zbMATH DE number 177824 (Why is no real title available?)
- scientific article; zbMATH DE number 709536 (Why is no real title available?)
- scientific article; zbMATH DE number 941396 (Why is no real title available?)
- scientific article; zbMATH DE number 1863168 (Why is no real title available?)
- scientific article; zbMATH DE number 1405646 (Why is no real title available?)
- scientific article; zbMATH DE number 3237829 (Why is no real title available?)
- Event-clock automata: a determinizable class of timed automata
- Model-checking in dense real-time
- Timed regular expressions
- Uppaal in a nutshell
Cited in
(17)- An algebraic approach to data languages and timed languages
- Reactive synthesis from visibly register pushdown automata
- Separation logics and modalities: a survey
- An automaton over data words that captures EMSO logic
- On the freeze quantifier in Constraint LTL: Decidability and complexity
- Counting Multiplicity over Infinite Alphabets
- A Note on C² Interpreted over Finite Data-Words
- Two-Variable Separation Logic and Its Inner Circle
- Weighted register automata and weighted logic on data words
- Weighted register automata and weighted logic on data words
- A succinct canonical register automaton model
- Optimal run problem for weighted register automata
- Complexity results on register context-free grammars and related formalisms
- Weight assignment logic
- Automata and grammars for data words
- Nominal automata for resource usage control
- Class counting automata on datawords
This page was built for publication: A logical characterization of data languages.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1853115)
