Supervisory Control Of Finite State Machines

A Aziz,F Balarin,Rk Brayton, Md Dibenedetto, A Saldanha

Proceedings of the 7th International Conference on Computer Aided Verification（1995）

引用 36|浏览8

暂无评分

摘要

We address a problem of finding a finite state machine (FSM), which composed with a given FSM, satisfies a given specification. The composition we use is the standard synchronous automata composition restricted to cases which correctly model hardware interconnection. For the satisfaction relation, we use language containment. We present a procedure that will generate a solution (if one exists) which is maximal, i.e. contains behaviors of all other solutions.

查看译文

关键词

Finite State Machines,Supervisory Control

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要