Title :
Decision problems for interacting finite state machines
Author :
Drusinsky-Yoresh, Doron
Author_Institution :
Sony Corp., Kanagawa, Japan
fDate :
12/1/1991 12:00:00 AM
Abstract :
Given a system of n interacting finite state machines (FSMs) and a state configuration, the reachability problem is to examine whether this configuration is reachable within the system. An investigation is made of the complexity of this decision problem and three of its derivatives, namely, (1) verifying system determination, (2) testing for the existence of unspecified inputs to any FSM within the system, and (3) testing for exclusiveness of two intra-FSM signals. It is proved that these problems are all PSPACE-complete. The effect of these problems on the state assignment process for concurrent systems of interacting FSMs is also shown
Keywords :
decision theory; finite automata; state assignment; PSPACE-complete; concurrent systems; interacting FSMs; interacting finite state machines; reachability problem; state assignment; state configuration; Automata; Concurrent computing; Control system synthesis; Control systems; Hardware design languages; Programmable logic arrays; Real time systems; Signal synthesis; Strain control; System testing;
Journal_Title :
Computer-Aided Design of Integrated Circuits and Systems, IEEE Transactions on
