• LiQuor

  • Referenced in 18 articles [sw04136]
  • operational semantics based on (finite) Markov decision processes. LiQuor provides the facility to perform ... omega-regular linear time properties by means of automata-based model checking algorithms...
  • COSMOS

  • Referenced in 6 articles [sw13329]
  • Timed Automata (DTA), to describe relevant execution paths of a Discrete Event Stochastic Process (DESP...
  • TAME

  • Referenced in 5 articles [sw28703]
  • Vaandrager timed automata, and SCR automata. TAME provides templates for specifying these automata ... automata defined using the templates. Use of the TAME strategies simplifies the process of proving...
  • PECANS

  • Referenced in 6 articles [sw02161]
  • PECANS: A parallel environment for cellular automata modeling. This paper is dedicated ... methodological approach is based on a reduction process of a physical phenomenon in components; each ... cell states are represented, at each time step, by the data variation on the grid ... state of neighbor cells at the previous time step. In addition the CA approach offers...
  • LAHS

  • Referenced in 3 articles [sw16836]
  • learning automata. This study presents a learning automata-based harmony search (LAHS) for unconstrained optimization ... spur-in-time responses in the musical improvisation process, learning capabilities are employed...
  • RE2

  • Referenced in 3 articles [sw10266]
  • uses automata theory to guarantee that regular expression searches run in time linear ... what inputs or regular expressions it must process; thus RE2 is useful in multithreaded environments...
  • Zelus

  • Referenced in 3 articles [sw20166]
  • expressed as data-flow equations and hierarchical automata can be composed arbitrarily with ODEs ... code that, by construction, runs in bounded time and space. Compilation is effected by source ... into a small synchronous subset which is processed by a standard synchronous compiler architecture...
  • HyCreate

  • Referenced in 2 articles [sw20138]
  • user of HyCreate specifies a hybrid automata through the interface, using the standard hybrid automaton ... trade-off of computation time for overapproximation accuracy, both time-bounded and unbounded (complete) reachability ... output to a text file for further processing, or visualized through the tool as projections...
  • HighSpec

  • Referenced in 1 article [sw09750]
  • structures and Timed Automata’s in modelling dynamic and real-time behaviors, OZTA is well ... coherent requirement models for complex real-time systems. HighSpec supports editing, type-checking as well ... composable timed patterns to capture high level timing requirements and process behaviors and generate...
  • YAKKER

  • Referenced in 2 articles [sw17046]
  • needs of modern programmers and modern data processing applications. In particular, our new parsing engine ... such as sophisticated libraries for dates and times, may be directly incorporated into parser specifications ... compile grammars into non deterministic automata. These automata are stack-based, somewhat like conventional push...
  • Psychohod

  • Referenced in 1 article [sw39243]
  • shortest possible time, trying, at the same time, to maintain the formation, and, possibly, they ... environment “Psychohod” to simulate the above-mentioned automata. To organize the interaction of motion ... models, we start two instances of the process of the “Psychohod” software. The data exchange...
  • BOXEL

  • Referenced in 1 article [sw03239]
  • Computing Machinery, Special Interest Group on Automata and Computability Theory, with the Cooperation ... rendering. For drivethroughs, the antichains are processed in front-to-back order together with ... encoding of the boxel horizon, yielding real-time rendering of scenes with...
  • ATLAS

  • Referenced in 199 articles [sw00056]
  • This paper describes the Automatically Tuned Linear Algebra...
  • CGAL

  • Referenced in 384 articles [sw00118]
  • The goal of the CGAL Open Source Project...
  • Coq

  • Referenced in 1880 articles [sw00161]
  • Coq is a formal proof management system. It...
  • Dafny

  • Referenced in 72 articles [sw00183]
  • Dafny is an imperative object-based language with...
  • GAP

  • Referenced in 3154 articles [sw00320]
  • GAP is a system for computational discrete algebra...
  • gmp

  • Referenced in 282 articles [sw00363]
  • GMP is a free library for arbitrary precision...
  • GreatSPN

  • Referenced in 57 articles [sw00384]
  • GreatSPN2.0 is a software package for the modeling...
  • Isabelle

  • Referenced in 698 articles [sw00454]
  • Isabelle is a generic proof assistant. It allows...