Login / Signup

A Sufficient Condition of Logically Constrained Term Rewrite Systems for Decidability of All-path Reachability Problems with Constant Destinations.

Misaki KojimaNaoki Nishida
Published in: J. Inf. Process. (2024)
Keyphrases
  • sufficient conditions
  • linear systems
  • linear complementarity problem
  • uniform convergence
  • genetic algorithm
  • query processing
  • semidefinite
  • asymptotic stability