By Topic

An extended OBDD representation for extended FSMs

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Langevin, M. ; Dept. d''Inf. et de Recherche Oper., Montreal Univ., Que., Canada ; Cerny, E.

This paper presents a subset of the predicate calculus, called the case calculus, which is suitable for describing Extended Finite State Machines (EFSMs). EFSMs can be used as abstract models of combined datapath and control systems. Case expressions can be represented using Extended Ordered Binary Decision Diagrams (EOBDDs) that are compact, allow an efficient implementation of logical operations on expressions, and have a unique form for many semantically equivalent expressions. Operations for formal verification and synthesis based on EFSM models, such as the “pre” and “post"” operations on sets of states, can be efficiently implemented. We illustrate the usefulness of EOBDDs in design verification and microcode synthesis

Published in:

European Design and Test Conference, 1994. EDAC, The European Conference on Design Automation. ETC European Test Conference. EUROASIC, The European Event in ASIC Design, Proceedings.

Date of Conference:

28 Feb-3 Mar 1994