Bounded model checking for timed automata
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1973987
- Bounded Model Checking for Parametric Timed Automata
- Verified model checking of timed automata
- Checking MTL Properties of Discrete Timed Automata via Bounded Model Checking
- Formal Modeling and Analysis of Timed Systems
- SAT based bounded model checking with partial order semantics for timed automata
- SAT-based unbounded model checking of timed automata
- Model-checking timed temporal logics
- Bounded model-checking of discrete duration calculus
- A New Approach to Bounded Model Checking for Branching Time Logics
Cites work
- scientific article; zbMATH DE number 1973987 (Why is no real title available?)
- scientific article; zbMATH DE number 1796153 (Why is no real title available?)
- scientific article; zbMATH DE number 1798183 (Why is no real title available?)
- scientific article; zbMATH DE number 1903356 (Why is no real title available?)
- scientific article; zbMATH DE number 2090318 (Why is no real title available?)
- scientific article; zbMATH DE number 2102690 (Why is no real title available?)
- scientific article; zbMATH DE number 898449 (Why is no real title available?)
- scientific article; zbMATH DE number 1400094 (Why is no real title available?)
- scientific article; zbMATH DE number 1424030 (Why is no real title available?)
- A theory of timed automata
- Analysis of timed systems using time-abstracting bisimulations
- Bounded model checking using satisfiability solving
- Deciding Linear Inequalities by Computing Loop Residues
- Graph-Based Algorithms for Boolean Function Manipulation
- HyTech: A model checker for hybrid systems
- Model checking of safety properties
- Predicate abstraction for dense real-time systems
- Safety, liveness and fairness in temporal logic
- Symbolic model checking for real-time systems
- Towards Bounded Model Checking for the Universal Fragment of TCTL
- Uppaal in a nutshell
- Verification of timed automata via satisfiability checking
Cited in
(33)- Formal Techniques for Networked and Distributed Systems - FORTE 2005
- scientific article; zbMATH DE number 2090318 (Why is no real title available?)
- Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems
- scientific article; zbMATH DE number 1973987 (Why is no real title available?)
- scientific article; zbMATH DE number 1693437 (Why is no real title available?)
- Zone-based verification of timed automata: extrapolations, simulations and what next?
- Efficient timed model checking for discrete-time systems
- Bounded model checking for knowledge and real time
- Bounded Model Checking for Parametric Timed Automata
- Formal Modeling and Analysis of Timed Systems
- Bounded model checking for the existential fragment of \(\mathrm{TCTL}_{-G}\) and diagonal timed automata
- An Automata-Theoretic Dynamic Completeness Criterion for Bounded Model-Checking
- SAT-based unbounded model checking of timed automata
- Reducing bounded realizability analysis to reachability checking
- Checking MTL Properties of Discrete Timed Automata via Bounded Model Checking
- Verification of timed automata via satisfiability checking
- Periodicity based decidable classes in a first order timed logic
- Bounded model checking with SNF, alternating automata, and Büchi automata
- Hypervolume Approximation in Timed Automata Model Checking
- Time-Bounded Verification
- SAT based bounded model checking with partial order semantics for timed automata
- Linear completeness thresholds for bounded model checking
- scientific article; zbMATH DE number 1852149 (Why is no real title available?)
- Robust Model-Checking of Linear-Time Properties in Timed Automata
- Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems
- On bounded specifications
- Superposition as a decision procedure for timed automata
- Bounded model checking distributed temporal logic
- scientific article; zbMATH DE number 5024617 (Why is no real title available?)
- Benchmarking Model- and Satisfiability-Checking on Bi-infinite Time
- Bounded model-checking of discrete duration calculus
- Unbounded, fully symbolic model checking of timed automata using Boolean methods.
- CONCUR 2004 - Concurrency Theory
This page was built for publication: Bounded model checking for timed automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2842869)
