A new algorithm for the largest compositionally progressive solution of synchronous language equations
Abstract
Reference
Index Terms
- A new algorithm for the largest compositionally progressive solution of synchronous language equations
Recommendations
Compositionally Progressive Solutions of Synchronous FSM Equations
The paper addresses the problem of designing a component that combined with a known part of a system, called the context FSM, is a reduction of a given specification FSM. We study compositionally progressive solutions of synchronous FSM equations. Such ...
Progressive solutions to a parallel automata equation
In this paper, we consider the problem of deriving a component X of a system knowing the behavior of the whole system C and the other components A. The component X is derived by solving the parallel automata equation A ⋄ X ≃ C. We present an algorithm ...
Progressive Solutions to FSM Equations
CIAA '08: Proceedings of the 13th international conference on Implementation and Applications of AutomataThe equation solving problem is to derive the behavior of the unknown component X knowing the joint behavior of the other components (or the context) C and the specification of the overall system S . The component X can be derived by solving the ...
Comments
Information & Contributors
Information
Published In
- General Chairs:
- Hai Zhou,
- Enrico Macii,
- Program Chairs:
- Zhiyuan Yan,
- Yehia Massoud
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Check for updates
Author Tags
Qualifiers
- Article
Conference
Acceptance Rates
Upcoming Conference
- Sponsor:
- sigda
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 86Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in