A logical characterization of data languages.

DOI10.1016/S0020-0190(02)00229-6zbMath1042.68544MaRDI QIDQ1853115

Patricia Bouyer

Publication date: 21 January 2003

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0190(02)00229-6

zbMATH Keywords

Real-time systems; Formal languages

Mathematics Subject Classification ID

68P05: Data structures

Related Items

Separation logics and modalities: a survey, Optimal run problem for weighted register automata, A Note on C² Interpreted over Finite Data-Words, A succinct canonical register automaton model, On the freeze quantifier in Constraint LTL: Decidability and complexity, An algebraic approach to data languages and timed languages, Weighted register automata and weighted logic on data words, Reactive synthesis from visibly register pushdown automata, Complexity results on register context-free grammars and related formalisms, Nominal Automata for Resource Usage Control, Two-Variable Separation Logic and Its Inner Circle, CLASS COUNTING AUTOMATA ON DATAWORDS, An Automaton over Data Words That Captures EMSO Logic, Weighted Register Automata and Weighted Logic on Data Words, Weight Assignment Logic, Counting Multiplicity over Infinite Alphabets

Uses Software

• Uppaal

Cites Work

• Model-checking in dense real-time
• Event-clock automata: a determinizable class of timed automata
• Uppaal in a nutshell
• Timed regular expressions
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item