Exact Incremental Analysis of Timed Automata with an SMT-Solver
From MaRDI portal
Publication:3172851
DOI10.1007/978-3-642-24310-3_13zbMATH Open1348.68118OpenAlexW107799027MaRDI QIDQ3172851FDOQ3172851
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
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
Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)
Cites Work
- HySAT: An efficient proof engine for bounded model checking of hybrid systems
- A theory of timed automata
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Verification of timed automata via satisfiability checking
- Formal Methods for the Design of Real-Time Systems
- Bounded model checking and induction: From refutation to verification (extended abstract, Category A)
- Verifying industrial hybrid systems with \textsc{MathSAT}
- Formal Modeling and Analysis of Timed Systems
- Universality analysis for one-clock timed automata
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (4)
- A tool for deciding the satisfiability of continuous-time metric temporal logic
- Abstractions for the local-time semantics of timed automata: a foundation for partial-order methods
- Incremental Language Inclusion Checking for Networks of Timed Automata
- A Tool That Incrementally Approximates Finite Satisfiability in Full Interval Temporal Logic
Uses Software
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)
