A Compositional Translation of Timed Automata with Deadlines to Uppaal Timed Automata

DOI10.1007/978-3-642-04368-0_15zbMath1262.68091OpenAlexW1962339992MaRDI QIDQ3648831

Rodolfo Gomez

Publication date: 1 December 2009

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

Full work available at URL: https://doi.org/10.1007/978-3-642-04368-0_15

zbMATH Keywords

Uppaaltimed automata with deadlinesurgent actions

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (1)

Statistical Model Checking for Networks of Priced Timed Automata

Uses Software

• Kronos
• MoDeST
• MOTOR
• IF-2.0
• PVS
• Uppaal

Cites Work

• Unnamed Item
• Unnamed Item
• Results on the propositional \(\mu\)-calculus
• How to stop time stopping
• Analysis of a biphase mark protocol with Uppaal and PVS
• Automatic verification of a lip-synchronisation protocol using UPPAAL
• A theory of timed automata
• Symbolic model checking for real-time systems
• The power of reachability testing for timed automata
• Kronos: A verification tool for real-time systems
• Timed automata with urgent transitions
• Compositional specification of timed systems
• Formal Methods for the Design of Real-Time Systems
• Formal Methods for the Design of Real-Time Systems
• Analysis of timed systems using time-abstracting bisimulations
• Formal design and analysis of a gear controller

This page was built for publication: A Compositional Translation of Timed Automata with Deadlines to Uppaal Timed Automata