Formalized timed automata
From MaRDI portal
Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15) Formalization of mathematics in connection with theorem provers (68V20)
Recommendations
Cites work
- A mechanized semantic framework for real-time systems
- A theory of timed automata
- Are timed automata updatable?
- Automata for modeling real-time systems
- Forward analysis of updatable timed automata
- HyTech: A model checker for hybrid systems
- Kronos: A verification tool for real-time systems
- Modelisation of timed automata in Coq
- Parametric real-time reasoning
- Timed automata: Semantics, algorithms and tools
- Uppaal in a nutshell
Cited in
(7)- Verified model checking of timed automata
- Untameable timed automata!
- From I/O automata to timed I/O automata. A solution to the ``Generalized Railroad Crossing in Isabelle/HOLCF
- Verified certification of reachability checking for timed automata
- scientific article; zbMATH DE number 6300098 (Why is no real title available?)
- Modelisation of timed automata in Coq
- Formal Modeling and Analysis of Timed Systems
Describes a project that uses
Uses Software
This page was built for publication: Formalized timed automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2829277)