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...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Design, Automation and Test in Europe s. 418 - 423
Hlavní autoři:	Mishchenko, Alan, Brayton, Robert, Jiang, Roland, Villa, Tiziano, Yevtushenko, Nina
Médium:	Konferenční příspěvek
Jazyk:	angličtina
Vydáno:	Washington, DC, USA IEEE Computer Society 07.03.2005 IEEE
Edice:	ACM Conferences
Témata:	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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!