Formal Modeling and Analysis of Timed Systems

DOI10.1007/11603009zbMATH Open1175.68255OpenAlexW2493457341MaRDI QIDQ5897955

Gerd Behrmann, Kim Guldstrand Larsen, Jacob Illum Rasmussen

Publication date: 14 November 2006

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

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

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (6)

Deadness and how to disprove liveness in hybrid dynamical systems ⋮ Accelerating worst case execution time analysis of timed automata models with cyclic behaviour ⋮ Parameter synthesis for hierarchical concurrent real-time systems ⋮ Unnamed Item ⋮ Finding minimum and maximum termination time of timed automata models with cyclic behaviour ⋮ Optimal reachability for multi-priced timed automata

Uses Software

• Uppaal

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