We revise soft constraint automata, wherein transitions are weighted and each action has an associated preference value. We first relax the underlying algebraic structure to allow bipolar preferences. We then equip automata with memory locations, that is, with an internal state to remember and update information from transition to transition. We furthermore revise automata operators, such as composition and hiding, providing examples on how such memory locations interact with preferences. We finally apply our framework to encode context-sensitive behaviour.
Automata with memory, Constraint automata, Reo language, Soft constraints
Journal of Logical and Algebraic Methods in Programming
Centrum Wiskunde & Informatica, Amsterdam, The Netherlands

Dokter, K.P.C, Gadducci, F, Lion, B, & Santini, F. (2021). Soft constraint automata with memory. Journal of Logical and Algebraic Methods in Programming, 118. doi:10.1016/j.jlamp.2020.100615