Article

Free access

Minimum length synchronizing sequences of finite state machine

Authors:

June-Kyung Rho,

Fabio Somenzi,

Carl PixleyAuthors Info & Claims

DAC '93: Proceedings of the 30th international Design Automation Conference

Pages 463 - 468

https://doi.org/10.1145/157485.164978

Published: 01 July 1993 Publication History

PDF eReader

References

[1]

F. Brglez, D. Bryan, and K. Ko~mifiskt. Combinational profiles of sequential benchmark circuits In Proceedings of the IEEE International Symposium on C~rcuzts and Systems, pages 1929-1934, Portland, O1%, May 1989.

Google Scholar

[2]

J. R. Burch, E. M Clarke, and D E. Long. Representing circuits more efficiently in symbolic model checking In Proceedings of the Design Automation Conference, pages 403-407, San Francisco, CA, June 1991.

Digital Library

Google Scholar

[3]

C L. Berman. Ordered binary decision diagrams and circuit structure Extended abstract In Proceedzngs of the International Conference on Computer Design, October 1989.

Google Scholar

[4]

T.L. Booth. Sequential Machines and Automata Theory. Wiley, New York, 1967.

Google Scholar

[5]

O. Coudert, C. Berthet, and J. C Madre Verification of sequential machines based on symbolic execution. In J. Sifakis, editor, Automatzc Vemficat~on Methods for Fznite State Systems, Lecture Notes in Computer Sczence 407, pages 365-373 Sprlnger-Verlag, 1989.

Digital Library

Google Scholar

[6]

H. Cho, S.-W. Jeong, F Somenzl, and C. Pixley. Synchronizing sequences and symbolic traversal techniques in test generation. Journal of Electronw Testzng: Theory and Apl~cat~ons, 1993 To appear.

Google Scholar

[7]

F.C. Hennie F~n~te-State Models for Logzcal Machines. John Wiley, New York, 1968.

Google Scholar

[8]

Z Kohavi. Swztch~ng and F~n~te Automata Theory. McGraw-Hill, New York, second edition, 1978

Google Scholar

[9]

P.N. Lowenstein. Formal verification of state-machines using higher-order logic. In IEEE Internatznal Conference on Computer Design, pages 204-207, Cambridge, MA, October 1989.

Crossref

Google Scholar

[10]

E.F. Moore. Gedanken experiments on sequential machines. In C E Shannon and J. McCarthy, editors, Automata Studzes Princeton University Press, 1956.

Google Scholar

[11]

C. Pixley and G Beihl. Calculating resetability and reset sequences. In Proceed,ngs of the International Conference on Computer-A~ded Deszgn, pages 376-379, Santa Clara, CA, November 1991.

Google Scholar

[12]

C. Pixley. A computational theory and implementation of sequential hardware equivalence. In E M Clarke and 1%. P. Kurshan, editors, Computer-Azded Verzficat~on '90, pages 293-320. American Mathematical Society - Association for Computing Machinery, 1991.

Digital Library

Google Scholar

[13]

C. Pixley, S.-W. Jeong, and G. D Hachtel. Exact calculation of synchronizatmn sequences based on binary decision diagrams. In Proceedings of the Design Automation Conference, pages 620-623, Anaheim, CA, June 1992.

Digital Library

Google Scholar

[14]

J.-K. l=tho and F. Somenzi. Inductive verification for lterative systems In Proceedzngs of the Design Automatzon Conference, pages 628-633, Anaheim, CA, June 1992.

Digital Library

Google Scholar

[15]

E. M. Sentovich, K. J. Singh, C. Moon, H. Savoj, 1% K Brayton, and A. Sangiovanni-Vincentelii. Sequential circuit design using synthesis and optimization. In Proceed~ngs of the International Conference on Computer Deszgn, pages 328-333, Cambridge, MA, October 1992.

Digital Library

Google Scholar

[16]

H. Touati, H Savoj, B. Lin, R. K. Brayton, and A. Sangiovanni-V1ncentelli. Implicit enumeration of finite state machines using BDD's. In Proceedzngs of the IEEE International Conference on Computer A~ded Design, pages 130-133, November 1990.

Crossref

Google Scholar

[17]

S. Yang. Logic synthesis and optimization benchmarks user guide version 3.0. Technical report, Microelectronlcs Center of North Carolina, :Research Triangle Park, NC, January 1991.

Google Scholar

Cited By

View all

Bruchertseifer JFernau H(2021)Synchronizing series-parallel deterministic finite automata with loops and related problemsRAIRO - Theoretical Informatics and Applications10.1051/ita/202100555(7)Online publication date: 22-Jul-2021
https://doi.org/10.1051/ita/2021005
Szykuła M(2015)Checking Whether an Automaton Is Monotonic Is NP-completeImplementation and Application of Automata10.1007/978-3-319-22360-5_23(279-291)Online publication date: 28-Jul-2015
https://doi.org/10.1007/978-3-319-22360-5_23
Pocci MDemongodin IGiambiasi NGiua AWainer GTraoré MHeckel RHimmelspach J(2011)Synchronizing sequences on not strongly connected Petri nets (Work-in-Progress)Proceedings of the 2011 Symposium on Theory of Modeling & Simulation: DEVS Integrative M&S Symposium10.5555/2048476.2048481(45-50)Online publication date: 3-Apr-2011
https://dl.acm.org/doi/10.5555/2048476.2048481
Show More Cited By

Index Terms

Minimum length synchronizing sequences of finite state machine
1. Hardware
  1. Hardware test
    1. Test-pattern generation and fault simulation
  2. Integrated circuits
    1. Logic circuits
      1. Sequential circuits
2. Theory of computation
  1. Formal languages and automata theory

Recommendations

Synthesizing Finite State Machines for Minimum Length Synchronizing Sequence Using Partial Scan
FTCS '95: Proceedings of the Twenty-Fifth International Symposium on Fault-Tolerant Computing

Abstract: The goal is to synthesize an FSM with the objective to minimize the number of scanned flip-flops while requiring a minimum number of system clocks to reach the synchronizable state. An algorithm for selecting state variables for scanning while ...
Generalized commutativity of intuitionistic fuzzy finite state machine

Concepts of generalized commutative intuitionistic fuzzy finite state machines and generalized switching intuitionistic fuzzy finite state machines are proposed in this paper, and properties of these two kinds of intuitionistic fuzzy finite state ...
Lattice-valued finite state machines and lattice-valued transformation semigroups

This paper provides a generalization of known results about fuzzy finite state machines, fuzzy transformation semigroups and their relationship by broading the truth values domain from the interval [0,1] to a complete lattice endowed with a t-norm and a ...

Comments

Information & Contributors

Information

Published In

DAC '93: Proceedings of the 30th international Design Automation Conference

July 1993

768 pages

ISBN:0897915771

DOI:10.1145/157485

Chairman:
Alfred E. Dunlop
AT&T Bell Labs., Murray Hill, NJ

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: 01 July 1993

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

DAC93

Sponsor:

EDAC
SIGDA
IEEE-CAS

DAC93: The 30th ACM/IEEE Design Automation Conference

June 14 - 18, 1993

Texas, Dallas, USA

Acceptance Rates

Overall Acceptance Rate 1,770 of 5,499 submissions, 32%

Upcoming Conference

DAC '25

Sponsor:
sigda

62nd ACM/IEEE Design Automation Conference

June 22 - 26, 2025

San Francisco , CA , USA

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

22
Total Citations
View Citations
330
Total Downloads

Downloads (Last 12 months)24
Downloads (Last 6 weeks)5

Reflects downloads up to 13 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Bruchertseifer JFernau H(2021)Synchronizing series-parallel deterministic finite automata with loops and related problemsRAIRO - Theoretical Informatics and Applications10.1051/ita/202100555(7)Online publication date: 22-Jul-2021
https://doi.org/10.1051/ita/2021005
Szykuła M(2015)Checking Whether an Automaton Is Monotonic Is NP-completeImplementation and Application of Automata10.1007/978-3-319-22360-5_23(279-291)Online publication date: 28-Jul-2015
https://doi.org/10.1007/978-3-319-22360-5_23
Pocci MDemongodin IGiambiasi NGiua AWainer GTraoré MHeckel RHimmelspach J(2011)Synchronizing sequences on not strongly connected Petri nets (Work-in-Progress)Proceedings of the 2011 Symposium on Theory of Modeling & Simulation: DEVS Integrative M&S Symposium10.5555/2048476.2048481(45-50)Online publication date: 3-Apr-2011
https://dl.acm.org/doi/10.5555/2048476.2048481
Volkov M(2008)Synchronizing Automata and the Černý ConjectureLanguage and Automata Theory and Applications10.1007/978-3-540-88282-4_4(11-27)Online publication date: 1-Jun-2008
https://dl.acm.org/doi/10.1007/978-3-540-88282-4_4
Pomeranz IReddy S(2006)On synchronizable circuits and their synchronizing sequencesIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems10.1109/43.86364919:9(1086-1092)Online publication date: 1-Nov-2006
https://dl.acm.org/doi/10.1109/43.863649
Trahtman A(2006)An efficient algorithm finds noticeable trends and examples concerning the Černy conjectureProceedings of the 31st international conference on Mathematical Foundations of Computer Science10.1007/11821069_68(789-800)Online publication date: 28-Aug-2006
https://dl.acm.org/doi/10.1007/11821069_68
Bertoli PCimatti A(2002)Improving heuristics for planning as search in belief spaceProceedings of the Sixth International Conference on Artificial Intelligence Planning Systems10.5555/3036884.3036905(143-152)Online publication date: 23-Apr-2002
https://dl.acm.org/doi/10.5555/3036884.3036905
Corno FPrinetto PRebaudengo MReorda MSquillero G(2002)Initializability analysis of synchronous sequential circuitsACM Transactions on Design Automation of Electronic Systems10.1145/544536.5445387:2(249-264)Online publication date: 1-Apr-2002
https://dl.acm.org/doi/10.1145/544536.544538
Cimatti ARoveri MBertoli P(2001)Searching Powerset Automata by Combining Explicit-State and Symbolic Model CheckingTools and Algorithms for the Construction and Analysis of Systems10.1007/3-540-45319-9_22(313-327)Online publication date: 23-Mar-2001
https://doi.org/10.1007/3-540-45319-9_22
Singh MNowick S(2000)Synthesis for logical initializability of synchronous finite-state machinesIEEE Transactions on Very Large Scale Integration (VLSI) Systems10.1109/92.8941608:5(542-557)Online publication date: 1-Oct-2000
https://dl.acm.org/doi/10.1109/92.894160
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

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

Cited By

Index Terms

Recommendations

Synthesizing Finite State Machines for Minimum Length Synchronizing Sequence Using Partial Scan

Generalized commutativity of intuitionistic fuzzy finite state machine

Lattice-valued finite state machines and lattice-valued transformation semigroups

Comments

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Conference

Acceptance Rates

Upcoming Conference

Other Metrics

Article Metrics

Other Metrics

Cited By

PDF

eReader

Login options

Full Access

References

Cited By

Index Terms

Recommendations

Synthesizing Finite State Machines for Minimum Length Synchronizing Sequence Using Partial Scan

Generalized commutativity of intuitionistic fuzzy finite state machine

Lattice-valued finite state machines and lattice-valued transformation semigroups

Comments

Information

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Conference

Acceptance Rates

Upcoming Conference

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations