Skip to main content
SpringerLink
Log in

SAT-Based Analysis of Cellular Automata

  • Conference paper
Cellular Automata (ACRI 2004)

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

Included in the following conference series:

Abstract

In the last decade there has been a dramatic speed-up for algorithms solving the Satisfiability (SAT) problem for propositional formulas, a well known NP-complete problem. In this paper we will investigate the applicability of modern SAT solvers to the qualitative analysis of Cellular Automata. For this purpose we have defined an encoding of the evolution of Cellular Automata into formulas in propositional logic. The resulting formula can be used to test forward and inverse reachability problems for the original Cellular Automata in a modular way. In the paper we will report on experimental results obtained by applying the SAT-solver zChaff to reachability problems for classical examples of Cellular Automata like the Firing Squad Synchronization Problem.

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. Biere, A., Clarke, E.M., Raimi, R., Zhu, Y.: Verifiying Safety Properties of a Power PC Microprocessor Using Symbolic Model Checking without BDDs. In: Halbwachs, N., Peled, D.A. (eds.) CAV 1999. LNCS, vol. 1633, pp. 60–71. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  2. D’Antonio, M.: Analisi SAT-based di Automi Cellulari, Tesi di laurea, Dip. di Informatica e Scienze dell’Informazione, Universit‘a di Genova, Marzo (2004)

    Google Scholar 

  3. Davis, M., Putnam, H.: A computing procedure for quantification theory. Journal of the Association for Computing Machinery 7, 201–215 (1960)

    MATH  MathSciNet  Google Scholar 

  4. Green, F.: NP-Complete Problems in Cellular Automata. Complex Systems 1, 453–474 (1987)

    MATH  MathSciNet  Google Scholar 

  5. Groote, J., Warners, J.: The propositional formula checker HeerHugo. Journal of Automated Reasoning 24(1-2), 101–125 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  6. The ICS home page, http://www.icansolve.com

  7. Mazoyer, J.: A six-state minimal time solution to the firing squad synchronization problem. Theoretical Computer Science 50(2), 183–240 (1987)

    Article  MATH  MathSciNet  Google Scholar 

  8. Moore, E.F.: Sequential machines. In: Moore, E.F. (ed.) Selected Papers. Addison-Wesley, Reading (1964)

    Google Scholar 

  9. Moskewicz, M.W., Madigan, C.F., Zhao, Y., Zhang, L., Malik, S.: Chaff: Engineering an Efficient SAT Solver. In: Proceedings of the 38th Design Automation Conference (DAC 2001) (2001)

    Google Scholar 

  10. Plaisted, D.A., Greenbaum, S.: A Structure Preserving Clause Form Translation. Journal of Symbolic Computation 2(3), 293–304 (1986)

    Article  MATH  MathSciNet  Google Scholar 

  11. The SIMO web page, http://www.mrg.dist.unige.it/sim/simo/

  12. Sutner, K.: On the computational complexity of finite cellular automata. JCSS 50(1), 87–97 (1995)

    MATH  MathSciNet  Google Scholar 

  13. Wolfram, S.: Universality and complexity in cellular automata. Physica D 10, 1–35 (1984)

    Article  MathSciNet  Google Scholar 

  14. Wolfram, S.: Computation Theory of Cellular Automata. Communications in Mathematical Physics 96, 15–57 (1984)

    Article  MATH  MathSciNet  Google Scholar 

  15. Worsch, T.: Programming Environments for Cellular Automata,Technical report 37/96, Universitat Karlsruhe, Fakultat fur Informatik (1996)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Informatica e Scienze dell’Informazione, Università di Genova, via Dodecaneso 35, 16146, Genova, Italy

    Massimo D’Antonio & Giorgio Delzanno

Authors
  1. Massimo D’Antonio
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Giorgio Delzanno
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Faculty of Sciences, Section of Computational Science, University of Amsterdam, Kruislaan 403, 1098 SJ, Amsterdam, The Netherlands

    Peter M. A. Sloot

  2. Computer Science Department, University of Geneva, Switzerland

    Bastien Chopard

  3. Section Computational Science, University of Amsterdam, The Netherlands

    Alfons G. Hoekstra

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

D’Antonio, M., Delzanno, G. (2004). SAT-Based Analysis of Cellular Automata. In: Sloot, P.M.A., Chopard, B., Hoekstra, A.G. (eds) Cellular Automata. ACRI 2004. Lecture Notes in Computer Science, vol 3305. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30479-1_77

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-30479-1_77

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-30479-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation