Constraint automata with memory cells and their composition

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

doi:10.1016/j.scico.2017.03.006

Constraint automata with memory cells and their composition

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

Research Line Resilience (part of LIRS program)

Research output: Contribution to journal › Article › Academic › peer-review

4 Citations (Web of Science)

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 language	English
Pages (from-to)	50-86
Number of pages	37
Journal	Science of computer programming
Volume	146
DOIs	https://doi.org/10.1016/j.scico.2017.03.006
Publication status	Published - 2017

Access to Document

10.1016/j.scico.2017.03.006

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 B.V.",

}

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

SN - 0167-6423

VL - 146

SP - 50

EP - 86

JO - Science of computer programming

JF - Science of computer programming

ER -

Constraint automata with memory cells and their composition

Abstract

Access to Document

Fingerprint

Cite this