A clocked finite state machine built from DNA. by Costa Santini, C, Bath, J, Tyrrell, A, Turberfield, A

“…We implement a finite state machine by representing state, transition rules and input symbols with DNA components. …”

Iterated Boolean games by Gutierrez, J, Harrenstein, B, Wooldridge, M

“…In order to represent the strategies of players in such games, we use a finite state machine model. After introducing and formally defining iterated Boolean games, we investigate the computational complexity of their associated game-theoretic decision problems, as well as semantic conditions characterising classes of LTL properties that are preserved by equilibrium points (pure-strategy Nash equilibria) whenever they exist.…”

Synchronous Protocol Automata: A Framework for Modelling and Verification of SoC Communication Architectures by D'Silva, V, Ramesh, S, Sowmya, A

“…We present a synchronous, Finite State Machine based framework for modelling communication aspects of such architectures. …”

Synchronous protocol automata: a framework for modelling and verification of SoC communication architectures by D'Silva, V, Ramesh, S, Sowmya, A

“…A synchronous, finite state machine framework for modelling communication aspects of such architecture is presented. …”

SACCADE AND PURSUIT ON AN ACTIVE HEAD EYE PLATFORM by Bradshaw, K, Mclauchlan, P, Reid, I, Murray, D

“…A gaze controller which selects results from the two visual processes and controls the movement of the head platform is implemented as a finite state machine. © 1994.…”

Iterated Boolean games by Gutierrez, J, Harrenstein, P, Wooldridge, M

“…In order to model the strategies that players use in such games, we use a finite state machine model. After introducing and formally defining iterated Boolean games, we investigate the computational complexity of their associated game-theoretic decision problems as well as semantic conditions characterising classes of LTL properties that are preserved by pure strategy Nash equilibria whenever they exist.…”

Run-time monitoring of data-handling violations by Happa, J, Moffat, N, Goldsmith, M, Creese, S

“…This paper proposes a finite-state-machine method for detecting violations of preferences (consents and revocations) expressed by Data Subjects regarding use of their personal data, and also violations of any related obligations that might be placed upon data handlers (data controllers and processors). …”

DRIVING SACCADE TO PURSUIT USING IMAGE MOTION by Murray, D, Bradshaw, K, Mclauchlan, P, Reid, I, Sharkey, P

“…To couple the different visual activities of waiting, saccading, pursuing and panicking, we use a finite state machine which provides inherent robustness outside of visual processing and provides a means of making repeated exploration. …”

Reducing domestic energy consumption through behaviour modification by Ford, R

“…</p> <p>Three sets of features including the short term time domain, time dependent finite state machine behaviour and time of day are identified by monitoring step changes in the power consumption of the home. …”

Safe and certified reinforcement learning with logical constraints by Hasanbeig, MH

“…We convert the given property into a Limit Deterministic Buchi Automaton (LDBA), namely a finite-state machine expressing the property. Further, by exploiting the structure of the LDBA, we shape a synchronous reward function on-the-fly, and we discuss the assumptions under which RL is guaranteed to synthesise control policies whose traces satisfy the LTL specification with maximum probability possible. …”

Exacerbations in chronic obstructive pulmonary disease: Identification and prediction using a digital health system by Shah, S, Velardo, C, Farmer, A, Tarassenko, L

“…</p> <p>Methods: We used data from 110 patients, with a combined monitoring period of more than 35,000 days. We propose a finite-state machine–based approach for modeling COPD exacerbation to gain a deeper insight into COPD patient condition during home monitoring to take account of the time course of symptoms. …”

A Refinement Approach to Design and Verification of On−Chip Communication Protocols by Böhm, P, Melham, T

“…Our modeling framework consists of design steps and design transformations formalized as finite state machines. Given a verified design step, transformations are used to extend the system with advanced features. …”

A Refinement Approach to Design and Verification of On-Chip Communication Protocols by Boehm, P, Melham, T

“…Our modeling framework consists of design steps and design transformations formalized as finite state machines. Given a verified design step, transformations are used to extend the system with advanced features. …”

Operational algorithmic game semantics by Bunting, B, Murawski, AS

“…We also identify a fragment for which these automata are finite-state machines.Further, we use the trace model to prove that translations of prototypical call-by-name (IA) and call-by-value (RML) languages into our call-by-push-value language are fully abstract. …”

Automata vs. Logics on Data Words by Benedikt, M, Ley, C, Puppis, G

“…Kaminski and Francez introduced a class of automata called finite memory automata (FMA), that represent a natural analog of finite state machines. A FMA can use, in addition to its control state, a (bounded) number of registers to store and compare values from the input word. …”