A succinct canonical register automaton model for data domains with binary relations

Authors:
Sofia Cassel;Bengt Jonsson;Falk Howar;Bernhard Steffen
Affiliations:
Dept. of Information Technology, Uppsala University, Sweden;Dept. of Information Technology, Uppsala University, Sweden;Chair for Programming Systems, Technical University Dortmund, Germany;Chair for Programming Systems, Technical University Dortmund, Germany
Venue:
ATVA'12 Proceedings of the 10th international conference on Automated Technology for Verification and Analysis
Year:
2012

Citing 18
Cited 1

Learning regular sets from queries and counterexamples

Information and Computation
Three partition refinement algorithms

SIAM Journal on Computing
CCS expressions finite state processes, and three problems of equivalence

Information and Computation
Inference of finite automata using homing sequences

Information and Computation
A theory of timed automata

Theoretical Computer Science
Finite-memory automata

Theoretical Computer Science
Introduction To Automata Theory, Languages, And Computation

Introduction To Automata Theory, Languages, And Computation
A Unifying Approach to Data-Independence

CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
Specifying Timed State Sequences in Powerful Decidable Logics and Timed Automata

ProCoS Proceedings of the Third International Symposium Organized Jointly with the Working Group Provably Correct Systems on Formal Techniques in Real-Time and Fault-Tolerant Systems
An algebraic characterization of deterministic regular languages over infinite alphabets

Theoretical Computer Science
Confirming Configurations in EFSM Testing

IEEE Transactions on Software Engineering
On notions of regularity for data languages

Theoretical Computer Science
Two-variable logic on data words

ACM Transactions on Computational Logic (TOCL)
A succinct canonical register automaton model

ATVA'11 Proceedings of the 9th international conference on Automated technology for verification and analysis
Automata with Group Actions

LICS '11 Proceedings of the 2011 IEEE 26th Annual Symposium on Logic in Computer Science
Automata and logics for words and trees over an infinite alphabet

CSL'06 Proceedings of the 20th international conference on Computer Science Logic
Variable automata over infinite alphabets

LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications
Inferring canonical register automata

VMCAI'12 Proceedings of the 13th international conference on Verification, Model Checking, and Abstract Interpretation

Minimization of symbolic automata

Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a novel canonical automaton model for languages over infinite data domains, that is suitable for specifying the behavior of services, protocol components, interfaces, etc. The model is based on register automata. A major contribution is a construction of succinct canonical register automata, which is parameterized on the set of relations by which elements in the data domain can be compared. We also present a Myhill Nerode-like theorem, from which minimal canonical automata can be constructed. This canonical form is as expressive as general deterministic register automata, but much better suited for modeling in practice since we lift many of the restrictions on the way variables can be accesed and stored: this allows our automata to be significantly more succinct than previously proposed canonical forms. Key to the canonical form is a symbolic treatment of data languages, which allows us to construct minimal representations whenever the set of relations can be equipped with a so-called branching framework.