• Esterel

  • Referenced in 163 articles [sw20012]
  • compiler which translates Esterel programs into finite-state machines. It is one of a family...
  • Grail

  • Referenced in 19 articles [sw00374]
  • symbolic computation environment for finite-state machines, regular expressions, and other formal language theory objects ... into the properties of machines, and for efficient computation with machines. Grail is written ... Grail enables you to manipulate parameterizable finite-state machines and regular expressions. By `parameterizable ... define the alphabet of a finite-state machine or regular expression. Version 2.4 of Grail...
  • BuDDy

  • Referenced in 22 articles [sw05791]
  • project on model checking of finite state machines by Jorn Lind-Nielsen. The package...
  • SMV

  • Referenced in 13 articles [sw04135]
  • designed to allow the description of finite state system that range from completely synchronous ... specify a system as a synchronous Mealy machine or as an asynchronous network of abstract ... Since it is intended to describe finite state machines, the only data types...
  • OPNET

  • Referenced in 10 articles [sw02616]
  • analysed by means of a finite state machine...
  • Exp.Open

  • Referenced in 10 articles [sw07702]
  • concurrent systems as a composition of finite state machines, using either synchronization vectors, or parallel...
  • TRANSIT

  • Referenced in 6 articles [sw28674]
  • traditional model of communicating extended finite-state-machines (EFSM), along with high-level invariants...
  • STAMINA

  • Referenced in 3 articles [sw07653]
  • method for minimizing Moore finite-state machines by merging two states. The problem of minimization ... Moore Finite-State Machines (FSMs) is considered. This problem often arises in designing digital devices...
  • FSM

  • Referenced in 4 articles [sw26448]
  • Library Finite-State Machine Library: The AT&T FSM library is a set of general ... building, combining, optimizing, and searching weighted finite-state acceptors and transducers. Finite-state transducers...
  • OPERAS

  • Referenced in 4 articles [sw30593]
  • integrate the most prominent characteristics of finite state machines and biological computation systems, such...
  • MuACOsm

  • Referenced in 2 articles [sw17580]
  • Colony Optimization Algorithm for Learning Finite-State Machines. In this paper we present MuACOsm ... method of learning Finite-State Machines (FSM) based on Ant Colony Optimization...
  • LOEWE

  • Referenced in 2 articles [sw29143]
  • space exploration is performed on extended finite state machines, and labelled transition graphs are used ... semantic verifier, a generator of extended finite state machines with associated interactive state exploration tools...
  • NuMesh

  • Referenced in 2 articles [sw01563]
  • precompiled into independent and carefully choreographed finite state machines running on each node. Several extensions ... 40MHz boards running locally-designed finite-state machine hardware, with 32 bit busses connecting each...
  • JSXM

  • Referenced in 2 articles [sw15041]
  • powerful modelling formalism that extends finite state machines with a memory (data) structure and function...
  • Automata

  • Referenced in 2 articles [sw19148]
  • hybrid Mathematica/C++ package that manipulates finites state machines and their syntactic semigroups. A number...
  • SMI++

  • Referenced in 2 articles [sw10141]
  • collection of objects behaving as finite state machines. These objects can represent real entities, such...
  • Vcsn

  • Referenced in 1 article [sw21339]
  • computation of, and with, finite state machines. It provides an efficient C++ library, a Python ... interface on top of IPython. Here finite state machines is to be understood...
  • RALib

  • Referenced in 1 article [sw16256]
  • register automata (a form of extended finite state machines). RALib is licensed under the Apache ... Bengt Jonsson, Bernhard Steffen: Learning Extended Finite State Machines. SEFM...
  • Dyna

  • Referenced in 11 articles [sw23357]
  • used for parsing, machine translation, morphological analysis, grammar induction, and finite-state modeling...
  • CrySSMEx

  • Referenced in 1 article [sw01960]
  • CrySSMEx, is an algorithm for extracting Finite State Machines from Recurrent Neural Networks. Input: sequential...