• LASH

  • Referenced in 23 articles [sw21269]
  • Liège Automata-based Symbolic Handler (LASH): LASH is a toolset for representing infinite sets ... state representations, which rely on finite-state automata for representing and manipulating infinite sets...
  • QCADesigner

  • Referenced in 22 articles [sw22781]
  • simulation tool for quantum-dot cellular automata. QCADesigner is the product of an ongoing research ... simulation tool for Quantum Dot Cellular Automata (QCA). This tool is still under development...
  • TorX

  • Referenced in 19 articles [sw07155]
  • means of non-deterministic safety timed automata. This paper describes the basic algorithms for ioco ... necessary modifications to standard safety timed automata to make them usable as an input formalism ... test-derivation algorithm from timed automata, and the concrete algorithms implemented in TorX for timed...
  • IMITATOR

  • Referenced in 29 articles [sw00439]
  • formalism of networks of parametric timed automata, augmented with integer variables and stopwatches. It implemented...
  • JPAX

  • Referenced in 29 articles [sw09906]
  • Alternatively, temporal specifications can be translated into automata or algorithms that can efficiently check...
  • PGSolver

  • Referenced in 29 articles [sw14051]
  • infinite duration that have important applications in automata theory and decision procedures (validity as well...
  • Slide

  • Referenced in 20 articles [sw28542]
  • SLIDE - Separation Logic with Inductive Definitions. Automata-based entailment checking for Separation Logic with Inductive ... Built on top of the VATA tree automata library...
  • Vaucanson

  • Referenced in 15 articles [sw05732]
  • Vaucanson and dedicated to the computation with automata and transducers. Its main feature ... capacity of dealing with automata whose labels may belong to various algebraic structures. The paper ... Vaucanson allows to program algorithms on automata in a way which is very close ... very rich data structure used to implement automata does not weigh too much...
  • Romeo

  • Referenced in 26 articles [sw00812]
  • performs translations from TPNs to Timed Automata (TAs) that preserve the behavioural semantics (timed bisimilarity...
  • LearnLib

  • Referenced in 18 articles [sw09913]
  • LearnLib, a library of tools for automata learning, which is explicitly designed for the systematic ... magnitude, a necessary precondition to make automata learning applicable to realistic scenarios...
  • Rabbit

  • Referenced in 24 articles [sw01317]
  • time systems. The modeling language are timed automata extended with concepts for modular modeling...
  • automata

  • Referenced in 14 articles [sw07632]
  • Automata package, as its name suggests, is package with algorithms to deal with automata...
  • DCVALID

  • Referenced in 14 articles [sw20416]
  • supported. DCVALID is based on an automata theoretic decision procedure for Quantified Discrete-time Duration ... efficient multi-terminal BDD based representation of automata and has implemented algorithms for operations ... automata such as product, projection, determinisation and minimisation...
  • AMoRE

  • Referenced in 12 articles [sw20980]
  • AMoRE a program for computing with Automata, Monoids, and Regular Expressions. AMoRE is an implementation ... automata theory algorithms, including: conversion of regular expression into finite automata, determinization and minimization ... automata (including a heuristic minimization of nondeterministic automata), language operations (e.g. boolean and regular operations...
  • RFSA

  • Referenced in 15 articles [sw03315]
  • previous articles a new class of automata which is defined using the notion of residual ... languages: residual finite state automata (RFSA). RFSA representations of regular languages may have far less...
  • Stranger

  • Referenced in 15 articles [sw09152]
  • Stranger: An Automata-Based String Analysis Tool for PHP. Stranger is an automata-based string...
  • Supremica

  • Referenced in 15 articles [sw18546]
  • basic model in Supremica is finite automata where the transitions have an associated event together ... condition and an action function that updates automata variables. Supremica uses two main approaches...
  • TAXYS

  • Referenced in 21 articles [sw01389]
  • formal model of timed automata. The choice of this model allows the use of results...
  • PESSOA

  • Referenced in 20 articles [sw20123]
  • smooth differential equations and automata and a specification in a fragment of Linear Temporal Logic...
  • COMPAS

  • Referenced in 14 articles [sw00147]
  • package, dedicated to the computations on synchronizing automata. COMPAS design is based on a generic ... COMPAS allows to easily operate on synchronizing automata, verifying new synchronizing algorithms...