Polynomial interrupt timed automata
From MaRDI portal
Publication:1675144
DOI10.1007/978-3-319-24537-9_3zbMath1471.68113arXiv1504.04541OpenAlexW1671650870MaRDI QIDQ1675144
Mathieu Sassolas, Serge Haddad, Claudine Picaronny, Mohab Safey El Din, Béatrice Bérard
Publication date: 27 October 2017
Full work available at URL: https://arxiv.org/abs/1504.04541
Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)
Related Items
Polynomial interrupt timed automata: verification and expressiveness, Unnamed Item, Revisiting reachability in polynomial interrupt timed automata
