Edit distance for timed automata

DOI10.1145/2562059.2562141zbMath1360.68544OpenAlexW2004194448MaRDI QIDQ2986983

Rasmus Ibsen-Jensen, Rupak Majumdar, Krishnendu Chatterjee

Publication date: 16 May 2017

Published in: Proceedings of the 17th international conference on Hybrid systems: computation and control (Search for Journal in Brave)

Full work available at URL: https://repository.ist.ac.at/144/1/main.pdf

zbMATH Keywords

timed automataedit distancerectangular hybrid automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (3)

Edit Distance for Pushdown Automata ⋮ Testing membership for timed automata ⋮ Finite Approximations and Similarity of Languages

Uses Software

• CPLEX
• YALMIP
• MPT

Cites Work

• Minkowski terminal cost functions for MPC
• A quasi-infinite horizon nonlinear model predictive control scheme with guaranteed stability
• Constrained model predictive control: Stability and optimality
• On infinity norms as Lyapunov functions for piecewise affine systems
• Linear systems with state and control constraints: the theory and application of maximal output admissible sets
• Computation of piecewise quadratic Lyapunov functions for hybrid systems
• Lyapunov Functions, Stability and Input-to-State Stability Subtleties for Discrete-Time Discontinuous Systems
• Stability analysis of piecewise discrete-time linear systems
• Convex Analysis
• Set-theoretic methods in control

This page was built for publication: Edit distance for timed automata