Using homing, synchronizing and distinguishing input sequences for the analysis of reversible finite state machines

Abstract

A digital device is called reversible if it realizes a reversible mapping, i.e., the one for which there exist a unique inverse. The field of reversible computing is devoted to studying all aspects of using and designing reversible devices. During last 15 years this field has been developing very intensively due to its applications in quantum computing, nanotechnology and reducing power consumption of digital devices. We present an analysis of the Reversible Finite State Machines (RFSM) with respect to three well known sequences used in the testability analysis of the classical Finite State Machines (FSM). The homing, distinguishing and synchronizing sequences are applied to two types of reversible FSMs: the converging FSM (CRFSM) and the nonconverging FSM (NCRFSM) and the effect is studied and analyzed. We show that while only certain classical FSMs possess all three sequences, CRFSMs and NCRF-SMs have properties allowing to directly determine what type of sequences these machines possess.

Technique of control PMSM powered by PV panel using predictive controller of DTC-SVM

“…The most suitable solution now is direct torque control (DTC). This method has been first proposed for induction machines [7][8][9][10][11][12]. It is used in variable frequency drives where the stator flux and machine electromagnetic torque are directly used to generate the control pulses for voltagesource inverter through a predefined switching table [13], DTC owns the advantages of simplicity, quick dynamic response and robustness, which makes it a powerful motor control method in various applications [14].…”