Exact Incremental Analysis of Timed Automata with an SMT-Solver

DOI10.1007/978-3-642-24310-3_13MaRDI QIDQ3172851zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• scientific article; zbMATH DE number 2104641
• SMT-based reachability analysis for simply-timed systems
• Verification of timed automata via satisfiability checking
• SMT-based induction methods for timed systems
• Analyzing Timed Systems Using Tree Automata
• Analyzing timed systems using tree automata
• Using non-convex approximations for efficient analysis of timed automata
• Lectures on Concurrency and Petri Nets
• Forward analysis of updatable timed automata

Cites work

• scientific article; zbMATH DE number 3644821 (Why is no real title available?)
• scientific article; zbMATH DE number 1337733 (Why is no real title available?)
• scientific article; zbMATH DE number 1973987 (Why is no real title available?)
• scientific article; zbMATH DE number 1852147 (Why is no real title available?)
• scientific article; zbMATH DE number 5033900 (Why is no real title available?)
• A theory of timed automata
• Bounded model checking and induction: From refutation to verification (extended abstract, Category A)
• Formal Methods for the Design of Real-Time Systems
• Formal Modeling and Analysis of Timed Systems
• HySAT: An efficient proof engine for bounded model checking of hybrid systems
• Universality analysis for one-clock timed automata
• Verification of timed automata via satisfiability checking
• Verifying industrial hybrid systems with \textsc{MathSAT}

Cited in

(4)

• Abstractions for the local-time semantics of timed automata: a foundation for partial-order methods
• A tool for deciding the satisfiability of continuous-time metric temporal logic
• Incremental Language Inclusion Checking for Networks of Timed Automata
• A Tool That Incrementally Approximates Finite Satisfiability in Full Interval Temporal Logic

Describes a project that uses

Uses Software

• HySAT
• SMT-LIB
• MathSAT

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3172851)