Formal Modeling and Analysis of Timed Systems

DOI10.1007/b12025zbMath1099.68674OpenAlexW2610516344MaRDI QIDQ5717502

Olaf Stursberg, Sebastian Engell, 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

SchedulingDiscrete OptimizationTimed AutomataMixed-Integer ProgrammingBranch-and-Bound Techniques

Mathematics Subject Classification ID

Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Formal languages and automata (68Q45) Deterministic scheduling theory in operations research (90B35) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (1)

Revisiting Decidability and Optimum Reachability for Multi-Priced Timed Automata

Uses Software

• Kronos
• IF-2.0
• Uppaal

This page was built for publication: Formal Modeling and Analysis of Timed Systems