Synthesizing Processes and Schedulers from Temporal Specifications
暂无分享,去创建一个
[1] R. Alur,et al. Automata For Modeling Real-Time Systems , 1990, ICALP.
[2] David L. Dill,et al. Trace theory for automatic hierarchical verification of speed-independent circuits , 1989, ACM distinguished dissertations.
[3] Amir Pnueli,et al. On the Synthesis of an Asynchronous Reactive Module , 1989, ICALP.
[4] Martín Abadi,et al. Realizable and Unrealizable Specifications of Reactive Systems , 1989, ICALP.
[5] E. Allen Emerson,et al. On simultaneously determinizing and complementing omega -automata , 1989, [1989] Proceedings. Fourth Annual Symposium on Logic in Computer Science.
[6] Amir Pnueli,et al. On the synthesis of a reactive module , 1989, POPL '89.
[7] Sheng Cheng,et al. Scheduling algorithms for hard real-time systems: a brief survey , 1989 .
[8] E. Allen Emerson,et al. The complexity of tree automata and logics of programs , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.
[9] Amir Pnueli,et al. Now you may compose temporal logic specifications , 1984, STOC '84.
[10] Pierre Wolper,et al. Reasoning about infinite computation paths , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).
[11] M. Rabin. Automata on Infinite Objects and Church's Problem , 1972 .
[12] J. R. Büchi,et al. Solving sequential conditions by finite-state strategies , 1969 .
[13] Alonzo Church,et al. Logic, arithmetic, and automata , 1962 .