 |
|
|
|
| HAL: hal-00558757, version 4 |
| arXiv: 1101.4475 |
| DOI: 10.1007/978-3-642-23217-6_12 |
| Detailed view |  Export this paper |
|
|
| CONCUR 2011, Aachen : Germany (2011) |
|
|
| Available versions: | v1 (2011-01-24) | v2 (2011-01-26) | v3 (2011-04-11) | v4 (2011-06-10) |
|
|
|
|
| An automaton over data words that captures EMSO logic |
|
|
| Benedikt Bollig 1 |
|
|
| (2011-09) |
|
|
|
| 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. |
|
|
|
|
|
|
|
|
|
|
|
| 1: | Laboratoire Spécification et Vérification [Cachan] (LSV) |
|
|
|
CNRS : UMR8643 – INRIA – École normale supérieure de Cachan - ENS Cachan |
|
|
|
|
|
|
|
|
|
| Subject | : | Computer Science/Formal Languages and Automata Theory |
|
|
| data words – register automata – class memory automata – data automata – MSO logic – message sequence charts – communicating automata |
|
|
|
|
|
| hal-00558757, version 4 | |
| http://hal.archives-ouvertes.fr/hal-00558757 | |
| oai:hal.archives-ouvertes.fr:hal-00558757 | |
| From: Benedikt Bollig | |
| Submitted on: Friday, 10 June 2011 15:44:09 | |
| Updated on: Monday, 9 January 2012 13:45:51 | |
