uu.seUppsala University Publications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
A succinct canonical register automaton model for data domains with binary relations
Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Systems.
Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Systems.
2012 (English)In: Automated Technology for Verification and Analysis: 10th International Symposium, ATVA 2012, Thiruvananthapuram, India, October 3-6, 2012. Proceedings, Springer, 2012, 57-71 p.Conference paper, Published paper (Refereed)
Abstract [en]

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.

Place, publisher, year, edition, pages
Springer, 2012. 57-71 p.
Series
Lecture Notes in Computer Science, ISSN 0302-9743 ; 7561
National Category
Computer and Information Science
Research subject
Computer Science
Identifiers
URN: urn:nbn:se:uu:diva-186814DOI: 10.1007/978-3-642-33386-6_6ISBN: 978-3-642-33385-9 (print)OAI: oai:DiVA.org:uu-186814DiVA: diva2:576073
Conference
10th International Symposium on Automated Technology for Verification and Analysis, ATVA 2012, 3 October 2012 through 6 October 2012, Thiruvananthapuram, India
Projects
ConnectUPMARC
Available from: 2012-12-12 Created: 2012-11-29 Last updated: 2013-12-21

Open Access in DiVA

No full text

Other links

Publisher's full text

Authority records BETA

Cassel, SofiaJonsson, Bengt

Search in DiVA

By author/editor
Cassel, SofiaJonsson, Bengt
By organisation
Computer Systems
Computer and Information Science

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 431 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf