Theoretical Computer Science
Elements of an automata theory over partial orders
POMIV '96 Proceedings of the DIMACS workshop on Partial order methods in verification
On Communicating Finite-State Machines
Journal of the ACM (JACM)
A logical characterization of data languages
Information Processing Letters
Dynamic Message Sequence Charts
FST TCS '02 Proceedings of the 22nd Conference Kanpur on Foundations of Software Technology and Theoretical Computer Science
Finite state machines for strings over infinite alphabets
ACM Transactions on Computational Logic (TOCL)
Two-Variable Logic on Words with Data
LICS '06 Proceedings of the 21st Annual IEEE Symposium on Logic in Computer Science
Message-passing automata are expressively equivalent to EMSO logic
Theoretical Computer Science - Concurrency theory (CONCUR 2004)
LTL with the freeze quantifier and register automata
ACM Transactions on Computational Logic (TOCL)
Adding nesting structure to words
Journal of the ACM (JACM)
On notions of regularity for data languages
Theoretical Computer Science
An Extension of Data Automata that Captures XPath
LICS '10 Proceedings of the 2010 25th Annual IEEE Symposium on Logic in Computer Science
Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
On the satisfiability of two-variable logic over data words
LPAR'10 Proceedings of the 17th international conference on Logic for programming, artificial intelligence, and reasoning
Automata and logics for words and trees over an infinite alphabet
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
Realizability of dynamic MSC languages
CSR'10 Proceedings of the 5th international conference on Computer Science: theory and Applications
Model checking languages of data words
FOSSACS'12 Proceedings of the 15th international conference on Foundations of Software Science and Computational Structures
Nominal automata for resource usage control
CIAA'12 Proceedings of the 17th international conference on Implementation and Application of Automata
Towards nominal context-free model-checking
CIAA'13 Proceedings of the 18th international conference on Implementation and Application of Automata
| Hi-index | 0.00 |
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.