Program synthesis for stepwise satisfiable specification of reactive system

被引:2
作者
Yoshiura, N [1 ]
Yonezaki, N [1 ]
机构
[1] Tokyo Inst Technol, Grad Sch Informat Sci & Engn, Dept Comp Sci, Meguro Ku, Tokyo, Japan
来源
INTERNATIONAL SYMPOSIUM ON PRINCIPLES OF SOFTWARE EVOLUTION, PROCEEDINGS | 2000年
关键词
D O I
10.1109/ISPSE.2000.913222
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
Reactive system, such as operating systems or elevator control systems, is a system which ideally never terminates and is intended to maintain some interaction with environ ment. In previous researches, a reactive system specification is required to satisfy realizability for synthesizing a program from it. A specification is realizable if and only if there exists a system which satisfies the specification no matter how the environment behaves. However, many of actual reactive system specifications do not satisfy realizability and there exist actual reactive system programs of such specifications. In this paper, we discuss realizability property of actual reactive system specifications and show that stepwise satisfiability is a property which actual reactive system specifications have to satisfy. This paper also presents a synthesis procedure of reactive system programs from stepwisely satisfiable specifications. By this procedure, we can synthesize prototype programs from an imperfect specification. It is useful to synthesize prototype programs in the middle of describing a specification because prototype programs give useful information for testing or revising the specification. Thus, the procedure in this paper is useful for system specification revision.
引用
收藏
页码:58 / 67
页数:2
相关论文
共 13 条
  • [1] ABADI M, 1989, LECT NOTES COMPUT SC, V372, P1
  • [2] [Anonymous], P 16 ACM S PRINC PRO
  • [3] ANUCHITANUKUL A, 1994, LNCS, V863, P156
  • [4] Emerson E.A., 1990, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics, P995, DOI [DOI 10.1016/B978-0-444-88074-1.50021-4, 10.1016/B978-0-444-88074-1.50021-4.]
  • [5] USING BRANCHING TIME TEMPORAL LOGIC TO SYNTHESIZE SYNCHRONIZATION SKELETONS
    EMERSON, EA
    CLARKE, EM
    [J]. SCIENCE OF COMPUTER PROGRAMMING, 1982, 2 (03) : 241 - 266
  • [6] SYNTHESIS OF COMMUNICATING PROCESSES FROM TEMPORAL LOGIC SPECIFICATIONS
    MANNA, Z
    WOLPER, P
    [J]. ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS, 1984, 6 (01): : 68 - 93
  • [7] MORI R, 1993, INFORMATION MODELING
  • [8] MORI R, 1994, LNCS, V863, P567
  • [9] PNUELI A, 1989, LNCS, V939, P652
  • [10] PNUELI A, 1977, P 18 IEEE S FDN COMP, P46, DOI DOI 10.1109/SFCS.1977.32