Tags : Browse Projects

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

Group Autonomy for Mobile Systems

Compare

  Analyzed almost 2 years ago

The Group Autonomy for Mobile Systems (GAMS) project at Carnegie Mellon University is intended to provide a distributed operating environment for control of unmanned autonomous systems (UAS). The repository is composed of C++, Java, MADARA, and some LUA bindings that enable a single person to ... [More] control and understand information from a swarm of devices, robots, or UAS. [Less]

16.4K lines of code

3 current contributors

over 2 years since last commit

1 users on Open Hub

Activity Not Available
0.0
 
I Use This

htbaapub.fsm

Compare

  Analyzed 7 months ago

Finite State Machines for BlitzMax

389 lines of code

0 current contributors

over 7 years since last commit

1 users on Open Hub

Activity Not Available
0.0
 
I Use This

puremvc-js-fsm

Compare

  Analyzed about 1 year ago

Important! This work is in progress. Please come back for updates daily, or if you want to contribute, please contact me at - lemil77 at gmail dot com. I will be posting soon some note about the implementation and samples on my blog at - www.lemil.com.ar/blog About: PureMVC is one of ... [More] the best frameworks around to implement in RIAS/Desktop development (IMHO). I been using this since a couple of years in AS3/Flex, allways with the best results. Laterlly they made a huge improve to the framework by intriducing a finite state machine (FSM) utility, that allows you to define a graph of states in XML to govern your app behavior. That utility was available only on AS3/Flex versions, so that's why I decided to raise my sleeves and port that also to JS. Please let me know about any questions. Thanks!, Leo Milmanda Note: Parts of the code belong to puremvc.org, so please refer to them for proper licence info. [Less]

1.54K lines of code

0 current contributors

about 4 years since last commit

1 users on Open Hub

Activity Not Available
0.0
 
I Use This

Genetic Automaton Learner (GAL)

Compare

  Analyzed about 2 months ago

Learn Finite State Automata that generalize over a set of training instances. This is an (incomplete) implementation of GAL, the Genetic Automaton Learner as defined in Chapter 5 of Belz (2000). The point of this code is to learn a FSA that *generalizes* from a set of positive examples. (If ... [More] you just want to cover exactly the input, you can use any existing package for doing FSA minimization.) The input file is in text format, one sequence per line, the alphabet will be induced by tokens separated by white-spaces. [Less]

1.14K lines of code

0 current contributors

over 6 years since last commit

1 users on Open Hub

Activity Not Available
0.0
 
I Use This

Helsinki Finite-State Technology

Compare

  Analyzed 3 months ago

The Helsinki Finite-State Transducer toolkit is intended for processing natural language morphologies. The toolkit is demonstrated by wide-coverage implementations of a number of languages of varying morphological complexity.

252K lines of code

0 current contributors

about 1 year since last commit

1 users on Open Hub

Activity Not Available
0.0
 
I Use This

iFSM

Compare

  Analyzed 2 months ago

a jQuery State Machine (FSM / HSM) to design and manage web user interfaces, simulators, games...

7.05K lines of code

2 current contributors

2 months since last commit

1 users on Open Hub

Activity Not Available
0.0
 
I Use This

sarasvati

Compare

  Analyzed about 1 year ago

SarasvatiOverviewSarasvati is a workflow/bpm engine based on graph execution. It has a simple core which allows for different implementations. For example one may change the persistence mechanism (or avoid it altogether), change token representation or build additional functionality on top. It ... [More] currently has implementations in Haskell and Java. These are being fleshed out and will hopefully be porting it to C# and a dynamic language such as ruby, python or javascript. FeaturesSimple graph execution based core Process level attributes Token attributes Efficient copy-on-write database storage of token attributes Execution history available through 'immutable' tokens Node guards allow bypassing nodes or discarding tokens for flow control Domain specific language (GuardLang) for user understandable guards XML file format for process definitions Java implementation Hibernate backed engine for DB persistence Memory backed engine for cases where persistence is not required. Haskell implementation HDBC backed engine Memory backed engine Introduction to workflowWhat is workflow? Why graph based workflow? Getting started with Sarasvati Getting the source code Sarasvati core concepts Why is the project named Sarasvati? NewsSeptember 6, 2008 - V1.0.0-beta1 of Sarasvati release for Java. Cleaned up process definition file format somewhat, including fixing validation Added support for embedding script (such as javascript) in process definition files, to be executed when the node is executed Bug fixes September 4, 2008 - v1.0.0-alpha2 of Sarasvati released for Java. Added Adaptable interface for Nodes Removed visual components into separate project Fixed several bugs August 22, 2008 - v1.0.0-alpha1 of Sarasvati released for Java. Support for event listeners (global and per-process) Support for nested processes Standardized GraphFactory and GraphRepository Allow direct bean style setting of node attributes from XML Updated model to allow better recovery from failed node execution. Paves way for transaction boundaries. August 10, 2008 - v0.3 of Sarasvati released for Haskell. Updates support for process states Changes library name from Sarasvati to sarasvati-haskell, for consistency. July 29, 2008 - v0.3 of Sarasvati released for Java Introduces explicit process states allowing for asynchronous process completions. Bug fixes July 24, 2008 - v0.2 of Sarasvati released for Java and Haskell This introduces process level variables. Previously variables were only allowed on tokens. There are also some minor fixes. June 29, 2008 - v0.1 of Sarasvati released for Java. June 23, 2008 - Examples for Sarasvati Haskell released. I refreshed the v0.1.0 release with some updates to the build, including a dependency on Cabal 1.4. June 22, 2008 - v0.1 of Sarasvati released for Haskell. This is an alpha release. Documentation is incomplete. This will be the focus of release v0.2. Some Haskell example code as well the Java version should be released in the next week or so. June 12, 2008 - Java loader complete. Work on memory backed engine is also complete. June 12, 2008 - XML Process definition file format reworked. Now has XML Schema Definition rather than DTD. This is allows embedding of elements defined in other schemas. June 2, 2008 - More documentation and packaging work on Haskell version. Once XML -> Memory and XML -> DB loaders are documented and packaged, should be ready for an alpha release. May 26, 2008 - Start memory backed engine for java version. Basic engine is implemented. However,will need memory backed graph loader before this is useful or testable. May 26, 2008 - Implemented GuardLang for java version May 21, 2008 - Documenting and building out wiki pages. May 20, 2008 - Source code imported. I used svn2svn to extract two projects out of the many in my home repository. May 18, 2008 - Project created on Google Code. Thank you to Stefan Webb, for allowing me to use the name. [Less]

250K lines of code

0 current contributors

over 2 years since last commit

1 users on Open Hub

Activity Not Available
0.0
 
I Use This

ce::StateCore

Compare

  Analyzed 7 months ago

StateCore is an generic finite state machine (FSM), based on the state pattern and written in C++. StateCore was created with the idea to helping the developers. This was created under the LGPL license. This means that it is completely free to use for commercial and non commercial applications. ... [More] Features: * Interface and Implementation class * Small and fast inline methods * Global, Current and Previous states * Enter, Execute and Exit events * Based on the state pattern * Easy-to-use Project Homepage: ceStateCore.sourceforge.net CorEngine's Blog: (Spanish blog) CorEngine.wordpress.com [Less]

271 lines of code

0 current contributors

over 6 years since last commit

1 users on Open Hub

Activity Not Available
5.0
 
I Use This

automata-tools

Compare

  Analyzed about 1 year ago

Automata Tools are a series of classes and utilities for ActionScript 3. We developed these tools to solve some common problems and now we're sharing them.

174 lines of code

0 current contributors

about 8 years since last commit

0 users on Open Hub

Activity Not Available
0.0
 
I Use This

pyfsm

Compare

  Analyzed about 1 year ago

Initial ImplementationThis is a fairly straight forward implementation of a finite state machine written in pure python. FSMs are stores in an XML file which has interspersed python code in the XML to define actions to be taken. Each state has 3 types of code. Entry code, Exit Code, and Action ... [More] Code. The entry and exit codes are called right before transitions from one state to another. The Action code is the main body of the state. Each transition can have a conditional which determines if it is a valid transition for the current context. The order of the transition processing is not guaranteed and the first transition to evaluate as true will be used, so it's advisable to use mutually exclusive conditions. New Work for version 2After discussions, we have decided to move away from XML and move towards python code generation for the state machine. Also, we are going to add a graphical editor that will allow you to design and debug your state machine all from within the graphical editor, exporting the python code, and a diagram of your state machine upon save. [Less]

0 lines of code

0 current contributors

almost 9 years since last commit

0 users on Open Hub

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