Optimization of timed automata models using mixed-integer programming
From MaRDI portal
Formal languages and automata (68Q45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Deterministic scheduling theory in operations research (90B35) Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)
Recommendations
Cited in
(3)
This page was built for publication: Optimization of timed automata models using mixed-integer programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5717502)