Technique of traces in solving the equivalence problem in algebraic program models

Technique of traces in solving the equivalence problem in algebraic program models

Algebraic models of sequential programs without procedures are considered. The question of applicability of the technique of traces to the solution of the equivalence problem in such models is investigated. Models called balanced left-cancellative semigroups are singled out for which the technique o...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Cybernetics and systems analysis 2009-09, Vol.45 (5), p.692-702
1. Verfasser: Podlovchenko, R. I.
Format: Artikel
Sprache:eng
Schlagworte:
Algebra
Algorithms
Artificial Intelligence
Control
Investigations
Labeling
Mathematical models
Mathematics
Mathematics and Statistics
Processor Architectures
Semantics
Software Engineering/Programming and Operating Systems
Studies
Systems analysis
Systems Theory
Variables
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Algebraic models of sequential programs without procedures are considered. The question of applicability of the technique of traces to the solution of the equivalence problem in such models is investigated. Models called balanced left-cancellative semigroups are singled out for which the technique of traces provides an effective decision procedure.
ISSN:1060-0396
1573-8337
DOI:10.1007/s10559-009-9139-8