Constraint automata with memory cells and their composition

S.-S.T.Q. Jongmans, T. Kappé, F. Arbab

Research output: Contribution to journalArticleAcademicpeer-review

Abstract

Highlights

• We extend constraint automata to compactly deal with infinite data domains.
• We define foundational notions as behavior, equivalence, congruence, composition.
• We present a new approach to composing a set of constraint automata.
• We compare the new approach to the existing approach in a number of experiments.
Original languageEnglish
Pages (from-to)50-86
Number of pages37
JournalScience of computer programming
Volume146
DOIs
Publication statusPublished - 2017

Fingerprint Dive into the research topics of 'Constraint automata with memory cells and their composition'. Together they form a unique fingerprint.

Cite this