Formal Modeling and Analysis of Timed Systems

DOI10.1007/b12025zbMath1099.68674MaRDI QIDQ5717502

Sebastian Engell, Olaf Stursberg, Sebastian Panek

Publication date: 10 January 2006

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b12025

zbMATH Keywords

Scheduling; Discrete Optimization; Timed Automata; Mixed-Integer Programming; Branch-and-Bound Techniques

Mathematics Subject Classification ID

90C11: Mixed integer programming

90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut

68Q45: Formal languages and automata

90B35: Deterministic scheduling theory in operations research

68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)

Related Items

Revisiting Decidability and Optimum Reachability for Multi-Priced Timed Automata

Uses Software

• Kronos
• IF-2.0
• Uppaal