Modelisation of timed automata in Coq
From MaRDI portal
Recommendations
Cited in
(8)- Comparing cubes of typed and type assignment systems
- On the semantics of polychronous polytimed specifications
- Formalized timed automata
- Coinduction in concurrent timed systems
- A Formalized Theory for Verifying Stability and Convergence of Automata in PVS
- Using Coq for formal modeling and verification of timed connectors
- Verified certification of reachability checking for timed automata
- A Formal Development of a Polychronous Polytimed Coordination Language
This page was built for publication: Modelisation of timed automata in Coq
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5714446)