Theoretical Computer Science
Model checking and abstraction
ACM Transactions on Programming Languages and Systems (TOPLAS)
PLC-automata: a new class of implementable real-time automata
Theoretical Computer Science - Special issue on real-time systems and concurrent and distributed software
Directed explicit model checking with HSF-SPIN
SPIN '01 Proceedings of the 8th international SPIN workshop on Model checking of software
CMC: A Tool for Compositional Model-Checking of Real-Time Systems
FORTE XI / PSTV XVIII '98 Proceedings of the FIP TC6 WG6.1 Joint International Conference on Formal Description Techniques for Distributed Systems and Communication Protocols (FORTE XI) and Protocol Specification, Testing and Verification (PSTV XVIII)
Automata For Modeling Real-Time Systems
ICALP '90 Proceedings of the 17th International Colloquium on Automata, Languages and Programming
Counterexample-Guided Abstraction Refinement
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
An Iterative Approach to Language Containment
CAV '93 Proceedings of the 5th International Conference on Computer Aided Verification
Directed explicit-state model checking in the validation of communication protocols
International Journal on Software Tools for Technology Transfer (STTT)
Predicate abstraction for reachability analysis of hybrid systems
ACM Transactions on Embedded Computing Systems (TECS)
UPPAAL/DMC: abstraction-based heuristics for directed model checking
TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems
CAV'07 Proceedings of the 19th international conference on Computer aided verification
Refining abstractions of hybrid systems using counterexample fragments
HSCC'05 Proceedings of the 8th international conference on Hybrid Systems: computation and control
Adapting an AI planning heuristic for directed model checking
SPIN'06 Proceedings of the 13th international conference on Model Checking Software
Stochastic Games for Verification of Probabilistic Timed Automata
FORMATS '09 Proceedings of the 7th International Conference on Formal Modeling and Analysis of Timed Systems
A framework for verification of software with time and probabilities
FORMATS'10 Proceedings of the 8th international conference on Formal modeling and analysis of timed systems
Refinement-Based development of timed systems
IFM'12 Proceedings of the 9th international conference on Integrated Formal Methods
Abstraction based model-checking of stability of hybrid systems
CAV'13 Proceedings of the 25th international conference on Computer Aided Verification
Safety verification for linear systems
Proceedings of the Eleventh ACM International Conference on Embedded Software
| Hi-index | 0.00 |
We present a fully automatic approach for counterexample guided abstraction refinement of real-time systems modelled in a subset of timed automata. Our approach is implemented in the MOBY/RT tool environment, which is a CASE tool for embedded system specifications. Verification in MOBY/RT is done by constructing abstractions of the semantics in terms of timed automata which are fed into the model checker UPPAAL. Since the abstractions are over-approximations, absence of abstract counter examples implies a valid result for the full model. Our new approach deals with the situation in which an abstract counter example is found by UPPAAL. The generated abstract counter example is used to construct either a concrete counter example for the full model or to identify a slightly refined abstraction in which the found spurious counter example cannot occur anymore. Hence, the approach allows for a fully automatic abstraction refinement loop starting from the coarsest abstraction towards an abstraction for which a valid verification result is found. Nontrivial case studies demonstrate that this approach computes small abstractions fast without any user interaction.