• UMDES

  • Referenced in 403 articles [sw09523]
  • study of discrete event systems modeled by finite-state automata (FSA). There are routines ... University of Michigan for failure diagnosis of discrete event systems. The book ”Introduction to Discrete...
  • Supremica

  • Referenced in 19 articles [sw18546]
  • discrete event systems is presented. The basic model in Supremica is finite automata where...
  • DCVALID

  • Referenced in 15 articles [sw20416]
  • based on an automata theoretic decision procedure for Quantified Discrete-time Duration Calculus (QDDC ... every formula D, we construct a finite state automaton A(D) precisely accepting the finite ... efficient multi-terminal BDD based representation of automata and has implemented algorithms for operations...
  • libFAUDES

  • Referenced in 10 articles [sw16433]
  • discrete event systems library libFAUDES implements data structures and algorithms for finite automata and regular ... implementation of methods for the control of discrete event systems, and (b) effective advertisement...
  • RAMAS

  • Referenced in 12 articles [sw10958]
  • show that the construction of the discrete quotient at each step requires only the evaluation ... partition and finding the roots of a finite set of scalar affine functions. The methodology ... easily extendable to rectangular hybrid automata with multi-affine vector fields and is expected...
  • HyDI

  • Referenced in 3 articles [sw11912]
  • automata are a clean and consolidated formal language for modeling embedded systems which include discrete ... continuous dynamics. They are based on a finite-state automaton structure enriched with invariant...
  • SPeeDI

  • Referenced in 8 articles [sw00896]
  • polygonal hybrid systems Hybrid systems combining discrete and continuous dynamics arise as mathematical models ... that lead to the existence of a finite and computable partition of the state space ... case for classes of rectangular automata and hybrid automata with linear vector fields. Most implemented...
  • pyHybrid Analysis

  • Referenced in 2 articles [sw10940]
  • Hybrid Systems. Hybrid automata naturally represent systems that exhibit a mixed discrete-continuous behaviours ... finite precision semantics, named [epsilon]-semantics, has been proposed to analyze hybrid automata. This paper...
  • SMCube

  • Referenced in 0 articles [sw04930]
  • modeling, simulation, and code generation of discrete time finite state machines (FSM) The idea driving ... include both, data-flow subsystems and finite state automatas. The Data Flow part is typically...
  • ATLAS

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

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

  • Referenced in 153 articles [sw00127]
  • An Interactive Geometry Software. Besides support for dynamic...
  • Coq

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

  • Referenced in 5 articles [sw00262]
  • FAST16: A software program for factorizing polynomials over...
  • GAP

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

  • Referenced in 144 articles [sw00344]
  • The gfun package provides tools for determining and...
  • gmp

  • Referenced in 289 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 719 articles [sw00454]
  • Isabelle is a generic proof assistant. It allows...
  • Magma

  • Referenced in 3363 articles [sw00540]
  • Computer algebra system (CAS). Magma is a large...