A logical characterization of data languages.

DOI10.1016/S0020-0190(02)00229-6zbMath1042.68544OpenAlexW2014246868MaRDI 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 systemsFormal languages

Mathematics Subject Classification ID

Data structures (68P05)

Related Items (16)

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

This page was built for publication: A logical characterization of data languages.