Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Solution of parallel language equations for logic synthesis
Proceedings of the 2001 IEEE/ACM international conference on Computer-aided design
Solving Asynchronous Equations
FORTE XI / PSTV XVIII '98 Proceedings of the FIP TC6 WG6.1 Joint International Conference on Formal Description Techniques for Distributed Systems and Communication Protocols (FORTE XI) and Protocol Specification, Testing and Verification (PSTV XVIII)
Multi Component Digital Circuit Optimization by Solving FSM Equations
DSD '03 Proceedings of the Euromicro Symposium on Digital Systems Design
Progressive solutions to a parallel automata equation
Theoretical Computer Science
Compositionally Progressive Solutions of Synchronous FSM Equations
Discrete Event Dynamic Systems
| Hi-index | 0.00 |
The equation solvingproblem is to derive the behavior of the unknown component Xknowing the joint behavior of the other components (or the context) Cand the specification of the overall system S. The component Xcan be derived by solving the Finite State Machine (FSM) equation C$\lozenge$ X~ S, where $\lozenge$ is the parallel composition operator and ~ is the trace equivalence or the trace reduction relation. A solution Xto an FSM equation is called progressiveif for every external input sequence the composition C$\lozenge$ Xdoes not fall into a livelock without an exit. In this paper, we formally define the notion of a progressive solution to a parallel FSM equation and present an algorithm that derives a largest progressive solution (if a progressive solution exists). In addition, we generalize the work to a system of FSM equations. Application examples are provided.