Skip to main content
SpringerLink
Log in
Book cover

International Symposium on Fundamentals of Computation Theory

FCT 1999: Fundamentals of Computation Theory pp 362–373Cite as

Synchronized product of linear bounded machines

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1684))

Abstract

This paper introduces a class of graphs associated to linear bounded machines. It is shown that this class is closed, up to observational equivalence, under synchronized product. The first-order theory of these graphs is investegated and shown to be undecidable. The latter result extends to any logic in which the existence of sinks may be stated.

This is a preview of subscription content, 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   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A. Arnold. Finite Transition Systems. Prentice Hall Int., 1994.

    Google Scholar 

  2. A. Arnold and M. Nivat. Comportements de processus. In Colloque AFCET “Les mathèmatiques de l’Informatique”, pages 35–68, 1982.

    Google Scholar 

  3. G. Boudol. Notes of algebraic calculi of processes. In Logics and Models of Concurrent Systems, volume F-13 of NATO ASI series, pages 261–303. 1985.

    Google Scholar 

  4. R. Bryant. Binary decision diagrams and beyond: Enabling technologies for formal verification. In Proceedings of the International Conference on Computer Aided Design, ICCAD’95, 1995.

    Google Scholar 

  5. D. Caucal. On infinite transition graphs having a decidable monadic second-order theory. In F. M. auf der Heide and B. Monien, editors, 23th International Colloquium on Automata Languages and Programming, LNCS 1099, pages 194–205, 1996.

    Google Scholar 

  6. G. Chaitin. A Theory of Program Size Formally Identical to Information Theory. J. Assoc. Compt. Mach., (22):329–340, 1975.

    MATH  MathSciNet  Google Scholar 

  7. B. Courcelle. The monadic second-order logic of graphs, II: Infinite graphs of bounded width. Mathematical System Theory, 21:187–221, 1989.

    Article  MATH  MathSciNet  Google Scholar 

  8. A. Emerson. Temporal and modal logic. In J. van Leeuwen, editor, Formal Models and Semantics, volume B of Handbook of Theoretical Computer Science, pages 997–1072. Elsevier, 1990.

    Google Scholar 

  9. M. Hennessy and R. Milner. Algebraic laws for nondeterminism and concurrency. J. ACM, 32:137–162, 1985.

    Article  MATH  MathSciNet  Google Scholar 

  10. T. Knapik. Domains of word-functions and Thue specifications. Technical Report INF/96/11/05/a, IREMIA, Universitè de La Rèunion, 1997.

    Google Scholar 

  11. D. Kozen and J. Tiuryn. Logics of programs. In J. van Leeuwen, editor, Formal Models and Semantics, volume B of Handbook of Theoretical Computer Science, pages 789–840. Elsevier, 1990.

    Google Scholar 

  12. R. P. Kurshan. Computer-aided Verification of Coordinating Processes. Princeton University Press, 1994.

    Google Scholar 

  13. K. McMillan. Symbolic Model Checking. Kluwer, 1993.

    Google Scholar 

  14. R. Milner. Calculus of Communicating Systems. LNCS 82. Springer Verlag, 1980.

    MATH  Google Scholar 

  15. D. E. Muller and P. E. Schupp. The theory of ends, pushdown automata and second-order logic. Theoretical Comput. Sci., 37:51–75, 1985.

    Article  MATH  MathSciNet  Google Scholar 

  16. M. Nivat. Sur la synchronisation des processus. Revue technique Thomson-CSF, (11):899–919, 1979.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. IREMIA, Universitè de La Rèunion, BP 7151, 97715, Saint Denis Messag. Cedex 9, France

    Teodor Knapik & Ètienne Payet

Authors
  1. Teodor Knapik
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ètienne Payet
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Faculty of Computer Science, “A.I.Cuza” University, 6600, Iaşi, Romania

    Gabriel Ciobanu

  2. Institute of Mathematics of the Romanian Academy, P.O. Box 1-764, 70700, Bucharest, Romania

    Gheorghe Păun

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Knapik, T., Payet, È. (1999). Synchronized product of linear bounded machines. In: Ciobanu, G., Păun, G. (eds) Fundamentals of Computation Theory. FCT 1999. Lecture Notes in Computer Science, vol 1684. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48321-7_30

Download citation

  • DOI: https://doi.org/10.1007/3-540-48321-7_30

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-66412-3

  • Online ISBN: 978-3-540-48321-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation