SAT-based analysis of cellular automata

DOI10.1007/978-3-540-30479-1_77MaRDI QIDQ5464170zbMATH OpenOpenAlexFDO

Authors Massimo D'Antonio, Giorgio Delzanno

Publication date 17 August 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-30479-1_77

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80)

Recommendations

• A SAT-based technique to analyse networks of finite automata
• Symbolic reachability analysis based on SAT-solvers
• Logical cryptanalysis as a SAT problem
• Applying modern SAT-solvers to solving hard problems
• Remarks on the cellular automaton global synchronisation problem

Cited in

(4)

• Predecessor existence problems for finite discrete dynamical systems
• Brothers in arms? on AI planning and cellular automata
• Weighting strategy for non-clausal resolution
• A SAT-based technique to analyse networks of finite automata

Describes a project that uses

Uses Software

• zChaff

This page was built for publication: SAT-based analysis of cellular automata

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5464170)