Exact Incremental Analysis of Timed Automata with an SMT-Solver

DOI10.1007/978-3-642-24310-3_13zbMath1348.68118OpenAlexW107799027MaRDI QIDQ3172851

Bahareh Badban, Martin Lange

Publication date: 7 October 2011

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-24310-3_13

Mathematics Subject Classification ID

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

Related Items (1)

A tool for deciding the satisfiability of continuous-time metric temporal logic

Uses Software

• HySAT
• SMT-LIB
• MathSAT

Cites Work

• HySAT: An efficient proof engine for bounded model checking of hybrid systems
• A theory of timed automata
• Verification of Timed Automata via Satisfiability Checking
• Formal Methods for the Design of Real-Time Systems
• Formal Modeling and Analysis of Timed Systems
• Computer Aided Verification
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Exact Incremental Analysis of Timed Automata with an SMT-Solver