000			03627nam a22005175i 4500
001			978-0-387-68759-9
003			DE-He213
005			20140220083227.0
007			cr nn 008mamaa
008			111114s2012 xxu| s |||| 0|eng d
020			_a9780387687599 _9978-0-387-68759-9
024	7		_a10.1007/978-0-387-68759-9 _2doi
050		4	_aTK7888.4
072		7	_aTJFC _2bicssc
072		7	_aTEC008010 _2bisacsh
082	0	4	_a621.3815 _223
100	1		_aVilla, Tiziano. _eauthor.
245	1	4	_aThe Unknown Component Problem _h[electronic resource] : _bTheory and Applications / _cby Tiziano Villa, Nina Yevtushenko, Robert K. Brayton, Alan Mishchenko, Alexandre Petrenko, Alberto Sangiovanni-Vincentelli.
264		1	_aBoston, MA : _bSpringer US, _c2012.
300			_aXVI, 312 p. _bonline resource.
336			_atext _btxt _2rdacontent
337			_acomputer _bc _2rdamedia
338			_aonline resource _bcr _2rdacarrier
347			_atext file _bPDF _2rda
505	0		_a1. Synopsis -- 2. Equations over Languages and Finate Automata -- 3. Equations over Finite State Machines -- 4. Equations Over w-Automata -- 5. A Survey of Relevant Literature -- 6. Implementation of Automata Manipulations -- 7. Manipulations of FSMs Represented as Sequential Circuits -- 8. The Software Package BALM -- 9. Fundamental Operations in BALM -- 10. Computation of Flexibility in Sequential Networks -- 11. Computation of Sequential Flexibility in Netlists by Windowing -- 12. Computation of Sequential Flexibility in Networks of FSMs by Windowing -- 13. Language Solving Using Simulation Relations -- 14. Exploitation of Flexibility in Sequential Networks -- 15. Supervisory Control -- 16. Testing -- 17. Synthesis of Strategies for Games -- 18. Extending BALM to Synchronous Equations Over co-Büchi Specifications -- 19. Conclusions and Open Problems.
520			_aThe Problem of the Unknown Component: Theory and Applications addresses the issue of designing a component that, combined with a known part of a system, conforms to an overall specification. The authors tackle this problem by solving abstract equations over a language. The most general solutions are studied when both synchronous and parallel composition operators are used. The abstract equations are specialized to languages associated with important classes of automata used for modeling systems. The book is a blend of theory and practice, which includes a description of a software package with applications to sequential synthesis of finite state machines. Specific topologies interconnecting the components, exact and heuristic techniques, and optimization scenarios are studied. Finally the scope is enlarged to domains like testing, supervisory control, game theory and synthesis for special omega languages. The authors present original results of the authors along with an overview of existing ones.
650		0	_aEngineering.
650		0	_aLogic design.
650		0	_aComputer engineering.
650		0	_aSystems engineering.
650	1	4	_aEngineering.
650	2	4	_aCircuits and Systems.
650	2	4	_aLogic Design.
650	2	4	_aElectrical Engineering.
700	1		_aYevtushenko, Nina. _eauthor.
700	1		_aBrayton, Robert K. _eauthor.
700	1		_aMishchenko, Alan. _eauthor.
700	1		_aPetrenko, Alexandre. _eauthor.
700	1		_aSangiovanni-Vincentelli, Alberto. _eauthor.
710	2		_aSpringerLink (Online service)
773	0		_tSpringer eBooks
776	0	8	_iPrinted edition: _z9780387345321
856	4	0	_uhttp://dx.doi.org/10.1007/978-0-387-68759-9
912			_aZDB-2-ENG
999			_c100190 _d100190