Synthesis of Uninitialized Systems
The sequential synthesis problem, which is closely related to Church’s solvability problem, asks, given a specification in the form of a binary relation between input and output streams, for the construction of a finite-state stream transducer that converts inputs to appropriate outputs. For efficiency reasons, practical sequential hardware is often designed to operate without prior initialization. Such hardware designs can be modeled by uninitialized state machines, which are required to satisfy their specification if started from any state. In this paper we solve the sequential synthesis problem for uninitialized systems, that is, we construct uninitialized finite-state stream transducers. We consider specifications given by LTL formulas, deterministic, nondeterministic, universal, and alternating Büchi automata. We solve this uninitialized synthesis problem by reducing it to the well-understood initialized synthesis problem. While our solution is straightforward, it leads, for some specification formalisms, to upper bounds that are exponentially worse than the complexity of the corresponding initialized problems. However, we prove lower bounds to show that our simple solutions are optimal for all considered specification formalisms. We also study the problem of deciding whether a given specification is uninitialized, that is, if its uninitialized and initialized synthesis problems coincide. We show that this problem has, for each specification formalism, the same complexity as the equivalence problem.
Unable to display preview. Download preview PDF.
- [Chu62]A. Church. Logic, arithmetic, and automata. In Proc. Intl. Congress of Mathematicians, pages 23–35. Institut Mittag-Leffler, 1962.Google Scholar
- [Dil89]D.L. Dill. Trace Theory for Automatic Hierarchical Verification of Speed Independent Circuits. MIT Press, 1989.Google Scholar
- [HU79]J. E. Hopcroft and J. D. Ullman, Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, 1987.Google Scholar
- [IEEE93]IEEE Standard 1149.1-1993. IEEE Standard Test Access Port and Bound-ary Scan Architecture. IEEE, 1993.Google Scholar
- [PR89]A. Pnueli and R. Rosner. On the synthesis of a reactive module. In Proc. 16th Symposium on Principles of Programming Languages, pages 179–190. ACM Press, 1989.Google Scholar
- [QBSP96]S. Qadeer, R. K. Brayton, V. Singhal, and C. Pixley. Latch redundancy removal without global reset. In Proc. Intl. Conference on Computer Design, pages 432–439. IEEE Computer Society, 1996.Google Scholar
- [Rab70]M.O. Rabin. Weakly definable relations and special automata. Mathematical Logic and Foundations of Set theory, 1970.Google Scholar
- [Rab72]M.O. Rabin. Automata on Infinite Objects and Church’s Problem. Number 13 in Regional Conference Series in Mathematics. American Mathematical Society, 1972.Google Scholar
- [RW89]P.J.G. Ramadge and W.M. Wonham. The control of discrete event systems. IEEE Transactions on Control Theory, 77:81–98, 1989.Google Scholar
- [Ros92]R. Rosner. Modular Synthesis of Reactive Systems. PhD thesis, Weizmann Institute of Science, 1992.Google Scholar
- [Saf88]S. Safra. On the complexity of omega-automata. In Proc. 29th Symposium on Foundations of Computer Science, pages 319–327. IEEE Computer Society, 1988.Google Scholar
- [SP94]V. Singhal and C. Pixley. The verification problem for safe replaceability. In Proc. Conference on Computer-Aided Verification, LNCS 818, pages 311–323. Springer-Verlag, 1994.Google Scholar
- [Wol82]P. Wolper. Synthesis of Communicating Processes from Temporal Logic Specifications. PhD thesis, Stanford University, 1982.Google Scholar