scientific article; zbMATH DE number 1973987
From MaRDI portal
Publication:4422082
Recommendations
- Bounded model checking for timed automata
- Bounded model checking for the existential fragment of \(\mathrm{TCTL}_{-G}\) and diagonal timed automata
- Unbounded, fully symbolic model checking of timed automata using Boolean methods.
- Automated Technology for Verification and Analysis
- Verification of timed automata via satisfiability checking
Cited in
(36)- Bounded model checking for knowledge and real time
- On the determinization of timed systems
- Superposition as a decision procedure for timed automata
- Zone-based verification of timed automata: extrapolations, simulations and what next?
- Efficient timed model checking for discrete-time systems
- A tool for deciding the satisfiability of continuous-time metric temporal logic
- Bounded model checking for timed automata
- Bounded model checking with parametric data structures
- Bounded Model Checking for Parametric Timed Automata
- SAT-based verification for timed component connectors
- scientific article; zbMATH DE number 2084331 (Why is no real title available?)
- Exact Incremental Analysis of Timed Automata with an SMT-Solver
- Parametric Timed Model Checking for Guaranteeing Timed Opacity
- SAT based bounded model checking with partial order semantics for timed automata
- Planning as satisfiability: heuristics
- scientific article; zbMATH DE number 1324666 (Why is no real title available?)
- SAT-based verification for timed component connectors
- Improved BDD-based discrete analysis of timed systems
- SMT-based induction methods for timed systems
- The Complexity of Bounded Synthesis for Timed Control with Partial Observability
- scientific article; zbMATH DE number 1852149 (Why is no real title available?)
- SAT-LP-IIS joint-directed path-oriented bounded reachability analysis of linear hybrid automata
- Exploiting symmetry in SMT problems
- Checking MTL Properties of Discrete Timed Automata via Bounded Model Checking
- Verification of timed automata via satisfiability checking
- Efficient Interpolant Generation in Satisfiability Modulo Theories
- Formal Techniques for Networked and Distributed Systems - FORTE 2005
- Formal Methods in Computer-Aided Design
- SAT-based unbounded model checking of timed automata
- Formal Modeling and Analysis of Timed Systems
- The automatic verification using symbolic model-checking
- Unbounded, fully symbolic model checking of timed automata using Boolean methods.
- Verification Modulo theories
- Bounded model checking distributed temporal logic
- Abstractions for the local-time semantics of timed automata: a foundation for partial-order methods
- M\textbf{ath}SAT: Tight integration of SAT and mathematical decision procedures
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4422082)
