Search Results for "automata"

LTL3BA is a translator of LTL formulae to Büchi automata. It is based on the popular tool named LTL2BA written by Denis Oddoux and Paul Gastin (available at http://www.lsv.ens-cachan.fr/~gastin/ltl2ba/). LTL3BA further improves LTL2BA's performance. Most modifications are described in the paper: T. Babiak, M. Křetínský, V. Řehák, and J. Strejček: LTL to Büchi Automata Translation: Fast and More Deterministic, in Proceedings of TACAS 2012, volume 7214 of LNCS, pages 95-109. Springer-Verlag...

Bellman, named after the character in Lewis Carroll's The Hunting of the Snark, is a program for searching for catalytic interactions in Conway's Game of Life and potentially other similar cellular automata. Results are derived directly from the automaton's evolution rule, not generated from a list of candidate catalysts as with previous searchers.

* Model-checking/simulation-checking library for real-time system with dense-time models in C with CRD (Clock-Restriction Diagrams) technology. * Parametric analysis library for linear-hybrid systems in C with HRD (Hybrid-Restriction Diagram) technol

The SIMP/STEP platform provides a fast, efficient, portable abstract framework for interactive and scripted cellular automata and lattice gas computing in the Python environment. SIMP provides a high-level 'programmable matter' laboratory built on

MASyV (Multi-Agent System Visualization) enables one to write agent-based models/cellular automata, eg. in C, visualize them in real time & capture to movie file with MASyVs GUI & message passing lib. Includes examples: Hello World, ants, viral infection

fick is fluid diffusion simulator (for both liquids and gases): it uses the Flick diffusion laws to drive the evolution of a cellular automata.

Foma is a compiler, programming language, and C library for constructing finite-state automata and transducers for various uses. It has specific support for many natural language processing applications such as producing morphological analyzers.

The purpose of this project is to create a dynamical chemistry simulation capable of creating and maintaining cellular-automata-like forms.

UltraLife simulates Conway's Game of Life, either automatically or one step at a time, with the ability to detect stable patterns and simple repeating states. It also simulates other cellular automata systems.

AMoRE is a collection of algorithms that deal with automata, monoids, regular expressions. Learn about the theory - this is not another regexp package.