The maximum set of permissible behaviors for FSM networks
ICCAD '93 Proceedings of the 1993 IEEE/ACM international conference on Computer-aided design
Synthesis of finite state machines: logic optimization
Synthesis of finite state machines: logic optimization
On the Construction of Submodule Specifications and Communication Protocols
ACM Transactions on Programming Languages and Systems (TOPLAS)
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
A Discrete Event Systems Approach for Protocol Conversion
Discrete Event Dynamic Systems
Verification of I/O Trace Set Inclusion for a Class of Non-Deterministic Finite State Machines
ICCD '92 Proceedings of the 1991 IEEE International Conference on Computer Design on VLSI in Computer & Processors
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)
Analysis and Applications of the XDI model
ASYNC '99 Proceedings of the 5th International Symposium on Advanced Research in Asynchronous Circuits and Systems
Optimization of synchronous circuits
Logic Synthesis and Verification
A Theory of Non-Deterministic Networks
Proceedings of the 2003 IEEE/ACM international conference on Computer-aided design
Equisolvability of Series vs. Controller's Topology in Synchronous Language Equations
DATE '03 Proceedings of the conference on Design, Automation and Test in Europe - Volume 1
Progressive solutions to a parallel automata equation
Theoretical Computer Science
Computational Universality in One-variable Language Equations
Fundamenta Informaticae - SPECIAL ISSUE MCU2004
Residual for Component Specifications
Electronic Notes in Theoretical Computer Science (ENTCS)
Progressive Solutions to FSM Equations
CIAA '08 Proceedings of the 13th international conference on Implementation and Applications of Automata
Decision problems for language equations
Journal of Computer and System Sciences
Electronic Notes in Theoretical Computer Science (ENTCS)
Synthesis of interface automata
ATVA'05 Proceedings of the Third international conference on Automated Technology for Verification and Analysis
On computational universality in language equations
MCU'04 Proceedings of the 4th international conference on Machines, Computations, and Universality
Computational Universality in One-variable Language Equations
Fundamenta Informaticae - SPECIAL ISSUE MCU2004
| Hi-index | 0.00 |
The problem of designing a component that combined with a known part of a system, conforms to a given overall specification arises in several applications ranging from logic synthesis to the design of discrete controllers. We cast the problem as solving abstract equations over languages. Language equations can be defined with respect to several language composition operators such as synchronous composition, •, and parallel composition, ♦; conformity can be checked by language containment. In this paper we address parallel language equations.Parallel composition arises in the context of modeling delay-insensitive processes and their environments. The parallel composition operator models an exchange protocol by which an input is followed by an output after a finite exchange of internal signals. It abstracts a system with two components with a single message in transit, such that at each instance either the components exchange messages or one of them communicates with its environment, which submits the next external input to the system only after the system has produced an external output in response to the previous input.We study the most general solutions of the language equation A ♦ X ⊆ C, and define the language operators needed to express them. Then we specialize such equations to languages associated with important classes of automata used for modeling systems, e.g., regular languages and FSM languages. In particular, for A ♦ X ⊆ C, we give algorithms for computing: the largest FSM language solution, the largest complete solution, and the largest solution whose composition with A yields a complete FSM language. We solve also FSM equations under bounded parallel composition.In this paper, we give concrete algorithms for computing such solutions, and state and prove their correctness.