scientific article; zbMATH DE number 7297846

zbMath1457.68147arXiv1702.03450MaRDI QIDQ5144644

Karin Quaas, Mahsa Shirmohammadi, James Worrell

Publication date: 19 January 2021

Full work available at URL: https://arxiv.org/abs/1702.03450

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

reachabilitytimed automatalinear arithmeticmodel checkingdifference bound matrices

Mathematics Subject Classification ID

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

Related Items (5)

Unnamed Item ⋮ Parametric updates in parametric timed automata ⋮ Reachability relations of timed pushdown automata ⋮ Decidable \({\exists}^*{\forall}^*\) first-order fragments of linear rational arithmetic with uninterpreted predicates ⋮ Effective definability of the reachability relation in timed automata

This page was built for publication: