skip to main content
10.1145/1228784.1228888acmconferencesArticle/Chapter ViewAbstractPublication PagesglsvlsiConference Proceedingsconference-collections
Article

A new algorithm for the largest compositionally progressive solution of synchronous language equations

Published:11 March 2007Publication History

ABSTRACT

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 solutions, when combined with the context, do not block any input that may occur in the specification, so they are of practical use. We show that if a synchronous FSM equation has a compositionally progressive solution, then the equation has the largest compositionally progressive solution. We provide an algorithm to compute the largest compositionally progressive solution that splits states of the largest solution and then removes those inducing a non-progressive composition.

References

  1. A. Mishchenko, R. Brayton, J.-H. Jiang, T. Villa, and N. Yevtushenko. Efficient solution of language equations using partitioned representations. In The Proceedings of the Design, Automation and Test in Europe Conference volume 01, pages 418--423, March 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. A new algorithm for the largest compositionally progressive solution of synchronous language equations

            Recommendations

            Comments

            Login options

            Check if you have access through your login credentials or your institution to get full access on this article.

            Sign in
            • Published in

              cover image ACM Conferences
              GLSVLSI '07: Proceedings of the 17th ACM Great Lakes symposium on VLSI
              March 2007
              626 pages
              ISBN:9781595936059
              DOI:10.1145/1228784

              Copyright © 2007 ACM

              Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

              Publisher

              Association for Computing Machinery

              New York, NY, United States

              Publication History

              • Published: 11 March 2007

              Permissions

              Request permissions about this article.

              Request Permissions

              Check for updates

              Qualifiers

              • Article

              Acceptance Rates

              Overall Acceptance Rate312of1,156submissions,27%

              Upcoming Conference

              GLSVLSI '24
              Great Lakes Symposium on VLSI 2024
              June 12 - 14, 2024
              Clearwater , FL , USA
            • Article Metrics

              • Downloads (Last 12 months)0
              • Downloads (Last 6 weeks)0

              Other Metrics

            PDF Format

            View or Download as a PDF file.

            PDF

            eReader

            View online with eReader.

            eReader