Tags : Browse Projects

Select a tag to browse associated projects and drill deeper into the tag cloud.

Spot

Compare

Claimed by EPITA Research and Developm... Analyzed 22 days ago

Spot is a C++14 library for manipulating omega-automata and LTL/PSL formulas. It offers a set of bricks to experiment with and develop your own model checker, or do other formulas/automata transformations. It comes with a dozen command-line utilities, and Python bindings.

115K lines of code

13 current contributors

24 days since last commit

3 users on Open Hub

High Activity
5.0
 
I Use This

Vcsn

Compare

Claimed by EPITA Research and Developm... Analyzed 22 days ago

Vcsn is a platform for weighted automata and rational expressions. It consists of a C++ generic library, a set of bindings for Python, and a graphical interactive environment on top of IPython.

6.7M lines of code

6 current contributors

about 1 month since last commit

3 users on Open Hub

Moderate Activity
5.0
 
I Use This

libfsm

Compare

  Analyzed 14 days ago

NFA, DFA, regular expressions and a lexer generator.

66K lines of code

9 current contributors

2 months since last commit

1 users on Open Hub

High Activity
5.0
 
I Use This

jabbly

Compare

  No analysis available

Using a SAX parser, this will take an iTunes music library file and convert it using a set of states to another format.

0 lines of code

0 current contributors

0 since last commit

0 users on Open Hub

Activity Not Available
0.0
 
I Use This
Mostly written in language not available
Licenses: GPL-3.0+

leftrightzero

Compare

  No analysis available

Es una aplicacion que permite abrir gramaticas desde archivo .lr0 (ver directorio Gramaticas por ejemplos), verificar si son LR(0) y genera sus Clausuras. Si no es LR(0) muestra el tipo de error (si es conocido). Escrito en Python & PythonCard

0 lines of code

0 current contributors

0 since last commit

0 users on Open Hub

Activity Not Available
0.0
 
I Use This
Mostly written in language not available
Licenses: GPL-2.0+

liasas

Compare

  No analysis available

LIASAS is a small research project aimed at creating a tool capable of describing indexed automata strengtened by action semantics, and applying algorithms on them. For instance, this tool should be able to determine whether two ASIA are compatible, combine them if it is the case, and output TLA+ code.

0 lines of code

0 current contributors

0 since last commit

0 users on Open Hub

Activity Not Available
0.0
 
I Use This
Mostly written in language not available
Licenses: LGPL

The Object of Life

Compare

  No analysis available

The Game of Life is probably the most famous cellular automata ever since 1970 when John Horton Conway created it. This implementation is not particularly efficient but is an Object Oriented one.

0 lines of code

0 current contributors

0 since last commit

0 users on Open Hub

Activity Not Available
0.0
 
I Use This
Mostly written in language not available
Licenses: MIT

Finito State Machines

Compare

  Analyzed 15 days ago

Introspectable, language agnostic, finite state machines

967 lines of code

1 current contributors

3 months since last commit

0 users on Open Hub

Very Low Activity
0.0
 
I Use This

javagameoflife

Compare

  No analysis available

IntroductionThis is a java implementation of Conway's Game of Life. DetailsConway's Game of Life is a simple zero-person game built upon cellular automato theory. (See project links for more information on Conway's Game of Life). The game was built for a graduate school Mod & Sim course, so ... [More] many ideas came from the basis of Modeling and Simulation Theory. This project takes the game a step further, and allows the user to be more influential in the outcome of the game. The user can... Change the size of the grid. Change the neighbor coloring scheme in order to see neighbor counts of living and dead cells. Automatically spawn new life and random configurations Manually spawn life at specified cells while the game is paused or simulating Stop, pause, rewind, and fast forward the simulation at any point in time to see the causes of the current life configuration. Life RulesMost important, this implemtentation stresses the important of the rules used to generate life during the game. The rules are faily straight forward: depending on the number of living cells around a current alive cell, it can either remain alive out of comfort, die out of loneliness, or die due to overcrowding. A dead cell can remain dead, or become alive if there are enough alive neighbors to reproduce. However, our game raises the possibility, what if exact numbers were not used, but probabilities? Therefore, there is an X% chance that if there are a certain number of neighbors around a cell, it remains alive, or perhaps dies. This game allows the users to create such rules, as well as use a number of predefined rules that result in interesting and beautiful arrangements of living and dead cells within the game. Life StatisticsFirst-order Life statistics were added to the game in order to compute characteristics about each cell, such as: Birth/Death Correlation, Coefficient of variance, Life/Death Coefficeient of Skewness and Deviation. There are statistics about the entire board as well such as: Total Births/Deaths, Maximum Life/Death, and number of Generations. [Less]

0 lines of code

0 current contributors

0 since last commit

0 users on Open Hub

Activity Not Available
0.0
 
I Use This
Mostly written in language not available
Licenses: BSD-4-Cla...

ultimate

Compare

  Analyzed 13 days ago

Ultimate is a program analysis framework. Ultimate consists of several plugins that perform steps of a program analysis, e.g., parsing source code, transforming programs from one representation to another, or analyzing programs. Toolchains of these plugins can perform complex tasks, e.g., verify ... [More] that a C program fulfills a given specification. [Less]

4.81M lines of code

43 current contributors

13 days since last commit

0 users on Open Hub

Very High Activity
0.0
 
I Use This