Verification of Timed Automata via Satisfiability Checking
From MaRDI portal
Publication:5392293
DOI10.1007/3-540-45739-9_15zbMath1278.68187OpenAlexW1495026145MaRDI QIDQ5392293
Oded Maler, Peter Niebert, Moez Mahfoudh, Marius Bozga, Eugene Asarin
Publication date: 8 April 2011
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-45739-9_15
Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)
Related Items
Exact Incremental Analysis of Timed Automata with an SMT-Solver ⋮ One More Decidable Class of Finitely Ground Programs ⋮ SAT Modulo Graphs: Acyclicity ⋮ Verification Modulo theories ⋮ Solving parity games by a reduction to SAT ⋮ General lower bounds and improved algorithms for infinite-domain CSPs ⋮ Preface to the special issue ``SI: satisfiability modulo theories ⋮ Unnamed Item ⋮ Decidable \({\exists}^*{\forall}^*\) first-order fragments of linear rational arithmetic with uninterpreted predicates ⋮ Well (and Better) Quasi-Ordered Transition Systems ⋮ Removing All Silent Transitions from Timed Automata ⋮ Bounded Model Checking with Parametric Data Structures ⋮ A tool for deciding the satisfiability of continuous-time metric temporal logic
Uses Software
This page was built for publication: Verification of Timed Automata via Satisfiability Checking
