Mealy machine

Known as: Mealy Machines, Mealy, Mealy state machine 
In the theory of computation, a Mealy machine is a finite-state machine whose output values are determined both by its current state and the current… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Chemical reaction networks(CRNs) have been used as a formal language for constructing and analysing molecular systems… (More)
  • figure 1
  • figure 2
  • figure 5
  • figure 3
  • figure 4
Is this relevant?
2017
2017
We introduce a new model of Mealy machines with timers (MMTs), which is able to describe the timing behavior of a broad class of… (More)
Is this relevant?
2015
2015
In this paper, we propose a smart video summarization technique that compiles a synopsis of event(s)-of-interest occurring within… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2014
2014
In applications where abstract models of reactive systems are to be inferred, one important challenge is that the behavior of… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2014
2014
Automata learning is increasingly being applied to ease the testing and comparing of complex systems. We formally reconstruct an… (More)
  • table 1
Is this relevant?
2013
2013
Using a well-known industrial case study from the verification literature, the bounded retransmission protocol, we show how… (More)
Is this relevant?
2011
2011
Conformance test is a black-box test technique aiming at checking whether an implementation conforms to its specification… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 5
  • figure 4
Is this relevant?
2008
2008
We consider a very simple Mealy machine (two non-trivial states over a two-symbol alphabet), and derive some properties of the… (More)
  • figure 1
Is this relevant?
2007
2007
We present a novel coalgebraic logic for deterministic Mealy machines that is sound, complete and expressive w.r.t. bisimulation… (More)
Is this relevant?
2006
2006
In Rutten (2005), the theoretical basis was given for the synthesis of binary Mealy machines from specifications in 2-adic… (More)
  • figure 1
  • figure 2
Is this relevant?