Automatic verification of finite-state concurrent systems using temporal logic specifications
ACM Transactions on Programming Languages and Systems (TOPLAS)
The complementation problem for Bu¨chi automata with applications to temporal logic
Theoretical Computer Science
Theory of finite and infinite graphs
Theory of finite and infinite graphs
Analysis of discrete event coordination
REX workshop Proceedings on Stepwise refinement of distributed systems: models, formalisms, correctness
Model checking, abstraction, and compositional verification
Model checking, abstraction, and compositional verification
Input don't care sequences in FSM networks
ICCAD '93 Proceedings of the 1993 IEEE/ACM international conference on Computer-aided design
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Design Constraints in Symbolic Model Checking
CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
CAV '90 Proceedings of the 2nd International Workshop on Computer Aided Verification
CAV '93 Proceedings of the 5th International Conference on Computer Aided Verification
A bdd-based environment for formal verification of hardware systems
A bdd-based environment for formal verification of hardware systems
EOOA: an extensible object oriented data model for automata applications
ICAI'06 Proceedings of the 7th WSEAS International Conference on Automation & Information
| Hi-index | 0.00 |
In this paper we outline a theory for the environment-modeling problem, the problem of abstracting component finite state machines (FSMs)bordering a particular FSM of interest within a network of interacting FSMs. The goal is to lay a theoretical foundation for the automatic state reduction of large FSM networks. We feel this is a prerequisite for the efficient use of many verification techniques. We focus on computing conditions for the safe removal of a component FSM in a FSM network, where removal is safe if it preserves a certain well-defined trace equivalence. We present an optimized algorithm for determining language universality of a FSM, as well as determining independence of a FSM from those of its inputs connected to outputs of neighboring FSMs. These two properties, input independence and language universality, provide the necessary and sufficient conditions for safe removal. In addition, we show how simulation relations can be utilized, both to reduce the cost of computing safe removal and to create an appropriate abstract FSM when safe removal is not possible.