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

Data storage equipment
Chemical analysis
Experiments

Cite this

@article{0b213d284a4e4562add09dc8d0291415,
title = "Constraint automata with memory cells and their composition",
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.",
author = "S.-S.T.Q. Jongmans and T. Kapp{\'e} and F. Arbab",
year = "2017",
doi = "10.1016/j.scico.2017.03.006",
language = "English",
volume = "146",
pages = "50--86",
journal = "Science of computer programming",
issn = "0167-6423",
publisher = "ELSEVIER SCIENCE BV",

}

Constraint automata with memory cells and their composition. / Jongmans, S.-S.T.Q.; Kappé, T.; Arbab, F.

In: Science of computer programming, Vol. 146, 2017, p. 50-86.

Research output: Contribution to journalArticleAcademicpeer-review

TY - JOUR

T1 - Constraint automata with memory cells and their composition

AU - Jongmans, S.-S.T.Q.

AU - Kappé, T.

AU - Arbab, F.

PY - 2017

Y1 - 2017

N2 - 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.

AB - 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.

U2 - 10.1016/j.scico.2017.03.006

DO - 10.1016/j.scico.2017.03.006

M3 - Article

VL - 146

SP - 50

EP - 86

JO - Science of computer programming

JF - Science of computer programming

SN - 0167-6423

ER -