Algebraic Interpretation of a Microprogram Finite-State Machine with Datapath of Transitions

Algebraic Interpretation of a Microprogram Finite-State Machine with Datapath of Transitions

A new principle is proposed for the representation of functions of a microprogram finite state machine with datapath of transitions in the form of a set of some algebras. The principle consists of partitioning the set of tuples forming transition and output functions into subsets each of which is in...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Cybernetics and systems analysis 2016-03, Vol.52 (2), p.191-198
Hauptverfasser: Babakov, R. M., Barkalov, A. A.
Format: Artikel
Sprache:eng
Schlagworte:
Algebra
Artificial Intelligence
Circuits
Computer science
Control
Cybernetics
Electronics
Expenditures
Finite state machines
Mathematical analysis
Mathematical models
Mathematics
Mathematics and Statistics
Microprograms
Partitioning
Processor Architectures
Representations
Signatures
Software Engineering/Programming and Operating Systems
Studies
Systems analysis
Systems Theory
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:A new principle is proposed for the representation of functions of a microprogram finite state machine with datapath of transitions in the form of a set of some algebras. The principle consists of partitioning the set of tuples forming transition and output functions into subsets each of which is interpreted as a partial function from the signature of the corresponding algebra.
ISSN:1060-0396
1573-8337
DOI:10.1007/s10559-016-9814-5