Skip to main content
SpringerLink
Log in

Strong Retiming Equivalence of Synchronous Schemes

  • Conference paper
Implementation and Application of Automata (CIAA 2005)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3845))

Included in the following conference series:

  • 412 Accesses

Abstract

Strong retiming equivalence is the join of two basic equivalence relations of synchronous schemes: strong equivalence and retiming equivalence, which play an important role in the optimization of synchronous systems. Each of these equivalences is characterized separately in an algebraic/category theoretic framework, and the characterization is carried over to the join of them. Tree-reducible schemes are introduced to facilitate the proof that strong retiming equivalence is decidable.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bartha, M.: Foundations of a theory of synchronous systems. Theoret. Comput. Sci. 100, 325–346 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  2. Bartha, M.: An algebraic model of synchronous systems. Information and Computation 97, 97–131 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  3. Bartha, M., Cirovic, B.: On some equivalence notions of synchronous systems. In: Ésik, Z., Fülöp, Z. (eds.) Proceedings, 11th International Conference on Automata and Formal Languages, Dogogókő, Hungary (2005)

    Google Scholar 

  4. Mac Lane, S.: Categories for the Working Mathematician. Springer, Berlin (1971)

    Book  MATH  Google Scholar 

  5. Grätzer, G.: Universal Algebra. Springer, Berlin (1968) (1979)

    MATH  Google Scholar 

  6. Leiserson, C.E., Saxe, J.B.: Optimizing synchronous systems. J. VLSI Comput. Systems 1, 41–67 (1983)

    MATH  Google Scholar 

  7. Gécseg, F., Peák, I.: Algebraic Theory of Automata. Akadémiai Kiadó, Budapest (1972)

    MATH  Google Scholar 

  8. Katis, P., Sabadini, N., Walters, R.F.C.: Feedback, trace, and fixed-point semantics. Theoret. Informatics Appl. 36, 181–194 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  9. Bartha, M.: An equational axiomatization of systolic systems. Theoret. Comput. Sci. 55, 265–289 (1987)

    Article  MathSciNet  MATH  Google Scholar 

  10. Elgot, C.C.: Monadic computations and iterative algebraic theories. In: Rose, H.E. (ed.) Logic Colloquium 73, pp. 175–230. North-Holland, Amsterdam (1975)

    Google Scholar 

  11. Elgot, C.C.: Selected Papers. In: Bloom, S.L. (ed.), Springer, New York (1982)

    Google Scholar 

  12. Murata, T.: Circuit theoretic analysis and synthesis of marked graphs. IEEE Transactions on Circuits and Systems CAS-24 7, 400–405 (1977)

    Article  MathSciNet  MATH  Google Scholar 

  13. Bloom, S.L., Ésik, Z.: Iteration Theories. Springer, Berlin (1993)

    Book  MATH  Google Scholar 

  14. Bloom, S.L., Tindell, R.: Algebraic and graph theoretic characterizations of structured flowchart schemes. Theoret. Comput. Sci. 9, 265–286 (1979)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Memorial University of Newfoundland, St. John’s, NL, Canada

    Miklós Bartha

Authors
  1. Miklós Bartha
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Sophia Antipolis, Laboratoire I3S, Les Algorithmes - bât. Euclide B, Université de Nice, 2000, route des lucioles, BP 121, 06903, Sophia Antipolis - Cedex, France

    Jacques Farré

  2. Sophia Antipolis, Ecole Polytechnique, Université de Nice, 930, route des colles, BP 145, 06903, Sophia Antipolis - Cedex, France

    Igor Litovsky

  3. Laboratoire I3S, Université de Nice, Sophia Antipolis & CNRS, France

    Sylvain Schmitz

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bartha, M. (2006). Strong Retiming Equivalence of Synchronous Schemes. In: Farré, J., Litovsky, I., Schmitz, S. (eds) Implementation and Application of Automata. CIAA 2005. Lecture Notes in Computer Science, vol 3845. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11605157_6

Download citation

  • DOI: https://doi.org/10.1007/11605157_6

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-31023-5

  • Online ISBN: 978-3-540-33097-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation