An Automaton over Data Words That Captures EMSO Logic
An Automaton over Data Words That Captures EMSO Logic
复制标题
捕获 EMSO 逻辑的数据字自动机
DOI：
10.1007/978-3-642-23217-6_12
复制
发表时间：
2011
期刊：
影响因子：
2.5
通讯作者：
B. Bollig
中科院分区：
文献类型：
--
作者：
B. Bollig
We develop a general framework for the specification and implementation of systems whose executions are words, or partial orders, over an infinite alphabet. As a model of an implementation, we introduce class register automata, a one-way automata model over words with multiple data values. Our model combines register automata and class memory automata. It has natural interpretations. In particular, it captures communicating automata with an unbounded number of processes, whose semantics can be described as a set of (dynamic) message sequence charts. On the specification side, we provide a local existential monadic second-order logic that does not impose any restriction on the number of variables. We study the realizability problem and show that every formula from that logic can be effectively, and in elementary time, translated into an equivalent class register automaton.
