Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

8

ACRI
2004
Springer

favoriteEmaildiscussreport

101views Artificial Intelligence» more ACRI 2004»

SAT-Based Analysis of Cellular Automata

13 years 10 months ago

SAT-Based Analysis of Cellular Automata

Download www.cs.unipr.it

Abstract. Cellular Automata are a powerful formal model for describing physical and computational processes. Qualitative analysis of Cellular Automata is in general a hard problem. In this paper we will investigate the applicability of modern SAT solvers to this problem. For this purpose we will deﬁne an encoding of reachability problems for Cellular Automata into SAT. The encoding is built in a modular way and can be used to test inverse reachability problems in a natural way. In the paper we will present experimental results obtained using the SAT-solver zChaﬀ.

Massimo D'Antonio, Giorgio Delzanno

Real-time Traffic

ACRI 2004 | Cellular Automata | Powerful Formal Model | Reachability Problems |

claim paper

Related Content

» Part 3 Specialized aspects of GIS and spatial analysis

» Evolutionary Sound Synthesis Rendering Spectrograms from Cellular Automata Histograms

» Progresses in the Analysis of Stochastic 2D Cellular Automata A Study of Asynchronous 2D M...

» On the analysis of simple 2D stochastic cellular automata

» A Cellular Automaton Based Fast OneWay Hash Function Suitable for Hardware Implementation

» Training Cellular Automata for Image Processing

» Mining Ecological Data with Cellular Automata

» A model based on cellular automata for the parallel simulation of 3D unsaturated flow

» Molecular quantumdot cellular automata

Post Info
More Details (n/a)

Added	30 Jun 2010
Updated	30 Jun 2010
Type	Conference
Year	2004
Where	ACRI
Authors	Massimo D'Antonio, Giorgio Delzanno

Comments (0)