Skip to main content
SpringerLink
Log in
SpringerLink
Log in

Emptiness Is Decidable for Asynchronous Cellular Machines

  • Conference paper
  • First Online:
CONCUR 2000 — Concurrency Theory (CONCUR 2000)

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

Included in the following conference series:

Abstract

We resume the investigation of asynchronous cellular automata. Originally, these devices were considered in the context of Mazurkiewicz traces, and later generalized to run on arbitrary pomsets without autoconcurrency by Droste and Gastin [3]. While the universality of the accepted language is known to be undecidable [11], we show here that the emptiness is decidable. Our proof relies on a result due to Finkel and Schnoebelen [7] on well-structured transition systems.

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 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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J. R. Büchi. Weak second-order arithmetic and finite automata. Z. Math. Logik Grundlagen Math., 6:66–92, 1960.

    Article  MATH  MathSciNet  Google Scholar 

  2. E. Clarke, O. Grumberg, and D. Peled. Model Checking. MIT Press, 2000.

    Google Scholar 

  3. M. Droste and P. Gastin. Asynchronous cellular automata for pomsets without autoconcurrency. In CONCUR’96, Lecture Notes in Comp. Science vol. 1119, pages 627–638. Springer, 1996.

    Google Scholar 

  4. M. Droste, P. Gastin, and D. Kuske. Asynchronous cellular automata for pomsets. Theoretical Comp. Science, 2000. To appear.

    Google Scholar 

  5. V. Diekert and G. Rozenberg. The Book of Traces. World Scientific Publ. Co., 1995.

    Google Scholar 

  6. W. Ebinger and A. Muscholl. Logical definability on infinite traces. Theoretical Comp. Science, 154:67–84, 1996.

    Article  MATH  MathSciNet  Google Scholar 

  7. A. Finkel and Ph. Schnoebelen. Well-structured transition systems everywhere! Technical Report LSV-98-4, ENS Cachan, 1998. To appear in Theoretical Computer Science.

    Google Scholar 

  8. P. Gastin and A. Petit. Asynchronous automata for infinite traces. In 19th ICALP, Lecture Notes in Comp. Science vol. 623, pages 583–594, Springer, 1992.

    Google Scholar 

  9. J.L Gischer. The equational theory of pomsets. Theoretical Comp. Science, 61:199–224, 1988.

    Article  MATH  MathSciNet  Google Scholar 

  10. G. Higman. Ordering by divisibility in abstract algebras. Proc. London Math. Soc., 2:326–336, 1952.

    Article  MATH  MathSciNet  Google Scholar 

  11. D. Kuske. Asynchronous cellular automata and asynchronous automata for pomsets. In CONCUR’98, Lecture Notes in Comp. Science vol. 1466, pages 517–532. Springer, 1998.

    Google Scholar 

  12. D. Kuske. Contributions to a trace theory beyond Mazurkiewicz traces. Submitted manuscript, TU Dresden, 1999.

    Google Scholar 

  13. V. Pratt. Modelling concurrency with partial orders. Int. J. of Parallel Programming, 15:33–71, 1986.

    Article  MATH  MathSciNet  Google Scholar 

  14. P. H. Starke. Processes in Petri nets. Elektronische Informationsverarbeitung und Kybernetik, 17:389–416, 1981.

    MATH  MathSciNet  Google Scholar 

  15. W. Zielonka. Notes on finite asynchronous automata. R. A. I. R. O.-Informatique Théorique et Applications, 21:99–135, 1987.

    MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Algebra, Technische Universität Dresden, D-01062, Dresden, Germany

    Dietrich Kuske

Authors
  1. Dietrich Kuske
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science and Engineering, Pennsylvania State University, 220 Pond Laboratory, University Park, PA, 16802-6106, USA

    Catuscia Palamidessi

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kuske, D. (2000). Emptiness Is Decidable for Asynchronous Cellular Machines. In: Palamidessi, C. (eds) CONCUR 2000 — Concurrency Theory. CONCUR 2000. Lecture Notes in Computer Science, vol 1877. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44618-4_38

Download citation

  • DOI: https://doi.org/10.1007/3-540-44618-4_38

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-67897-7

  • Online ISBN: 978-3-540-44618-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation