Synthesis of uninitialized systems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2380 LNCS, Issue , 2002, Pages 644-656

  Henzinger, Thomas A ^a   Krishnan, Sriram C ^b   Kupferman, Orna ^c   Mang, Freddy Y C ^d  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b CISCO SYSTEMS   (United States)

^c HEBREW UNIVERSITY OF JERUSALEM   (Israel)

^d SYNOPSYS INC   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; EQUIVALENCE CLASSES; TRANSDUCERS;

BINARY RELATION; EQUIVALENCE PROBLEM; HARDWARE DESIGN; INPUT AND OUTPUTS; LOWER BOUNDS; SEQUENTIAL SYNTHESIS; STATE MACHINE; SYNTHESIS PROBLEMS;

SPECIFICATIONS;

EID: 84869149457     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45465-9_55     Document Type: Conference Paper

References (23)

1. M. Abadi, L. Lamport, and P. Wolper. Realizable and unrealizable concurrent program specifications. In Proc. 16th Intl. Colloquium on Automata, Languages, and Programming, LNCS 372, pages 1-17. Springer-Verlag, 1989
2. J.R. Büchi and L.H. Landweber. Solving sequential conditions by finitestate strategies. Transactions of the American Mathematical Society, 138:295-311, 1969.
3. A. Church. Logic, arithmetic, and automata. In Proc. Intl. Congress of Mathematicians, pages 23-35. Institut Mittag-Leffler, 1962.
4. D.L. Dill. Trace Theory for Automatic Hierarchical Verification of Speed Independent Circuits. MIT Press, 1989.
5. E.A. Emerson and E.M. Clarke. Using branching time logic to synthesize synchronization skeletons. Science of Computer Programming, 2:241-266, 1982.
6. J. E. Hopcroft and J. D. Ullman, Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, 1987.
7. IEEE Standard 1149.1-1993. IEEE Standard Test Access Port and Boundary Scan Architecture. IEEE, 1993.
8. O. Kupferman and M.Y. Vardi. Church's problem revisited. The Bulletin of Symb olic Logic, 5:245-263, 1999.
9. S. Miyano and T. Hayashi. Alternating finite automata on ?-words. Theoretical Computer Science, 32:321-230, 1984.
10. D.E. Muller and P.E. Schupp. Simulating aternating tree automata by nondeterministic automata: New results and new proofs of theorems of Rabin, McNaughton, and Safra. Theoretical Computer Science, 141:69-107, 1995.
11. Z. Manna and R. Waldinger. A deductive approach to program synthesis. ACM Transactions on Programming Languages and Systems, 2:90-121, 1980.
12. A. Pnueli. The temporal semantics of concurrent programs. Theoretical Computer Science, 13:45-60, 1981.
13. A. Pnueli and R. Rosner. On the synthesis of a reactive module. In Proc. 16th Symposium on Principles of Pr ogramming Languages, pages 179-190. ACM Press, 1989.
14. 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.
15. M.O. Rabin. Weakly definable relations and special automata. Mathematical Logic and Foundations of Set theory, 1970.
16. M.O. Rabin. Automata on Infinite Objects and Church's Problem. Number 13 in Regional Conference Series in Mathematics. American Mathematical Society, 1972.
17. P.J.G. Ramadge and W.M.Wonham. The control of discrete event systems. IEEE Transactions on Control Theory, 77:81-98, 1989.
18. R. Rosner. Modular Synthesis of R eactive Systems. PhD thesis, Weizmann Institute of Science, 1992.
19. S. Safra. On the complexity of omega-automata. In Proc. 29th Symposium on Foundations of Computer Science, pages 319-327. IEEE Computer Society, 1988.
20. A.P. Sistla and E.M. Clarke. The complexity of propositional linear temporal logic, Journal of the ACM, 32:733-749, 1985.
21. 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.
22. M.Y. Vardi and P. Wolper. Reasoning about infinite computations. Information and Computation, 115:1-37, 1994.
23. P. Wolper. Synthesis of Communic ating Processes from Temporal Logic Specifications. PhD thesis, Stanford University, 1982.