Comparing generic state machines

DOI10.1007/3-540-55179-4_43MaRDI QIDQ6493564zbMATH OpenFDO

Authors Michel Langevin, Eduard Cerny

Publication date 29 April 2024

Full work available at URL https://doi.org/10.1007/3-540-55179-4_43

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60)

Cites work

• scientific article; zbMATH DE number 3991418 (Why is no real title available?)
• scientific article; zbMATH DE number 3702108 (Why is no real title available?)
• scientific article; zbMATH DE number 139807 (Why is no real title available?)
• scientific article; zbMATH DE number 177240 (Why is no real title available?)
• scientific article; zbMATH DE number 177508 (Why is no real title available?)
• scientific article; zbMATH DE number 3550181 (Why is no real title available?)
• scientific article; zbMATH DE number 3598362 (Why is no real title available?)
• A Comparison of Register Transfer Languages for Describing Computers and Digital Systems
• Algebraic simplification
• Graph-Based Algorithms for Boolean Function Manipulation
• Unification: a multidisciplinary survey

This page was built for publication: Comparing generic state machines

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