Modular verification of modular finite state machines

1 January 2004

conference paper
Published by Institute of Electrical and Electronics Engineers (IEEE)

Vol. 1, 972-979 Vol.1
https://doi.org/10.1109/cdc.2004.1428811

Abstract

This paper summarizes the key results for modular verification of modular finite state machines; that is, for verifying the correctness of a system of modular finite state machines without performing the composition of all of the modules. The modular finite state machine framework is first reviewed; this framework differs from standard finite state machines in that there are two types of events: triggers, which the system reacts to, and responses, which it generates or forces to occur. Because the proofs of modular verification are based on the languages generated by modular finite state machines, the main definitions and properties of trigger response languages are summarized. The paper also describes the computational complexity of the modular verification procedure.

Keywords

This publication has 5 references indexed in Scilit:

Reconfigurable logic control using modular FSMs: Design, verification, implementation, and integrated error handling
Published by Institute of Electrical and Electronics Engineers (IEEE) ,2002
Decentralized supervisory control with communicating controllers
IEEE Transactions on Automatic Control, 2000
Introduction to Discrete Event Systems
Published by Springer Nature ,1999
The control of discrete event systems
Proceedings of the IEEE, 1989
Supervisory Control of a Class of Discrete Event Processes
SIAM Journal on Control and Optimization, 1987