Efficient equivalence-checking algorithms for propositional Mealy programs over balanced frames

MaRDI QIDQ6855549zbMATH OpenFDO

Authors V. V. Podymov

Publication date 20 February 2026

Published in Prikladnaya Diskretnaya Matematika (Search for Journal in Brave)

Full work available at URL https://www.mathnet.ru/eng/pdm889

zbMATH Keywords

equivalence problemequivalence checkingprogram modelsdiscrete processorspropositional sequential programs

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Semantics in the theory of computing (68Q55)

This page was built for publication: Efficient equivalence-checking algorithms for propositional Mealy programs over balanced frames

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6855549)