Efficient Solution of Language Equations Using Partitioned Representations

A class of discrete event synthesis problems can be reduced to solving language equations f X S, where F is the fixed component and S the specification. Sequential synthesis deals with FSMs when the automata for F and S are prefix closed, and are naturally represented by multi-level networks with la...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Design, Automation and Test in Europe S. 418 - 423
Hauptverfasser:	Mishchenko, Alan, Brayton, Robert, Jiang, Roland, Villa, Tiziano, Yevtushenko, Nina
Format:	Tagungsbericht
Sprache:	Englisch
Veröffentlicht:	Washington, DC, USA IEEE Computer Society 07.03.2005 IEEE
Schriftenreihe:	ACM Conferences
Schlagworte:	Automata Boolean functions Computing methodologies > Symbolic and algebraic manipulation > Symbolic and algebraic algorithms Data structures Equations Formal verification Hardware > Hardware validation > Functional verification Hardware > Integrated circuits > Logic circuits > Sequential circuits Image converters Input variables Network synthesis Protocols Testing Theory of computation > Design and analysis of algorithms Theory of computation > Formal languages and automata theory
ISBN:	9780769522883, 0769522882
ISSN:	1530-1591
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!