Open reactive systems provide services to users by interacting the users and environments of the systems. There are several methods that describe formal specifications of reactive systems. Temporal logic is one of the methods. An open reactive system specification is defined to be realizable if and only if there is a program that satisfies the specification even if the environment and the users of the reactive system take any behaviors. There are several kinds of the methods of deciding realizability of open reactive system. These methods are based on automata theory and their complexities are at least double exponential times of the length of a specification. This paper shows the relation between a syntax and realizability properties of reactive system specifications. This relation can reduce the complexity of deciding the properties of reactive system specifications.
展开▼
