Verification of Timed Automata via Satisfiability Checking
From MaRDI portal
Publication:5392293
DOI10.1007/3-540-45739-9_15zbMath1278.68187MaRDI 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
68Q45: Formal languages and automata
68Q60: Specification and verification (program logics, model checking, etc.)
Related Items
One More Decidable Class of Finitely Ground Programs, Verification Modulo theories, A tool for deciding the satisfiability of continuous-time metric temporal logic, Solving parity games by a reduction to SAT, Decidable \({\exists}^*{\forall}^*\) first-order fragments of linear rational arithmetic with uninterpreted predicates, Preface to the special issue ``SI: satisfiability modulo theories, General lower bounds and improved algorithms for infinite-domain CSPs, Unnamed Item, Bounded Model Checking with Parametric Data Structures, SAT Modulo Graphs: Acyclicity, Well (and Better) Quasi-Ordered Transition Systems, Exact Incremental Analysis of Timed Automata with an SMT-Solver, Removing All Silent Transitions from Timed Automata
Uses Software