An Automaton over Data Words That Captures EMSO Logic

DOI10.1007/978-3-642-23217-6_12zbMath1343.68153arXiv1101.4475OpenAlexW1812897951MaRDI QIDQ3090829

Benedikt Bollig

Publication date: 2 September 2011

Published in: CONCUR 2011 – Concurrency Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1101.4475

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items

Weighted Register Automata and Weighted Logic on Data Words, Nominal Automata for Resource Usage Control, Set augmented finite automata over infinite alphabets, A Note on C² Interpreted over Finite Data-Words, Regular and context-free nominal traces, Weighted register automata and weighted logic on data words, A Class of Automata for the Verification of Infinite, Resource-Allocating Behaviours

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An optimal construction of Hanf sentences
• On notions of regularity for data languages
• Finite-memory automata
• A logical characterization of data languages.
• Message-passing automata are expressively equivalent to EMSO logic
• An extension of data automata that captures XPath
• Temporal Logics on Words with Multiple Data Values.
• LTL with the freeze quantifier and register automata
• Two-variable logic on data words
• FINITE-MEMORY AUTOMATA WITH NON-DETERMINISTIC REASSIGNMENT
• Adding nesting structure to words
• Realizability of Dynamic MSC Languages
• Automata and Logics for Words and Trees over an Infinite Alphabet
• On Communicating Finite-State Machines
• On the Satisfiability of Two-Variable Logic over Data Words
• Finite state machines for strings over infinite alphabets
• Fresh-register automata