A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Filters
Uppaal/DMC – Abstraction-Based Heuristics for Directed Model Checking
[chapter]
Tools and Algorithms for the Construction and Analysis of Systems
Preserved Fulltext
UPPAAL/DMC is an extension of UPPAAL which provides generic heuristics for directed model checking. ...
Both are based on computing an abstraction of the system and using the error distance in this abstraction as the heuristic value. ...
See http://www.avacs.org/ for more information. ...
doi:10.1007/978-3-540-71209-1_52
dblp:conf/tacas/KupferschmidDHFDPB07
fatcat:lzjz5sb6sfdrjbn5vt6hppyf3i
Mcta: Heuristics and Search for Timed Systems
[chapter]
2012
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The new developments include both heuristics and search techniques that define the state of the art in directed model checking. ...
Mcta is a directed model checking tool for concurrent systems of timed automata. This paper reviews Mcta and its new developments from an implementation point of view. ...
We also provide results for the tools Uppaal-4.0.13 and Uppaal/Dmc [16] . ...
doi:10.1007/978-3-642-33365-1_18
fatcat:m4pkjv6p75cita5ny53slov4em
Abstractions and Pattern Databases: The Quest for Succinctness and Accuracy
[chapter]
2011
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Directed model checking is a well-established technique for detecting error states in concurrent systems efficiently. ...
In this paper, we propose a systematic approach for the construction of pattern database heuristics. We formally define a concept to measure the accuracy of abstractions. ...
We call the resulting heuristic h dpr . We compare it with various other admissible distance heuristics as implemented in the directed model checking tools UPPAAL/DMC [13] and MCTA. ...
doi:10.1007/978-3-642-19835-9_26
fatcat:j75z6rzi75hphcm563w3wwttay
Downward pattern refinement for timed automata
2014
International Journal on Software Tools for Technology Transfer (STTT)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Directed model checking is a well-established approach for detecting error states in concurrent systems. ...
Based on this concept, we propose an algorithm for computing succinct abstractions that are still accurate to produce informed pattern databases. ...
Acknowledgments This work is an extended version of the paper "Abstractions and Pattern Databases: The Quest for Succinctness and Accuracy" [24] . ...
doi:10.1007/s10009-014-0346-x
fatcat:roivl352efevljqxdr5eudjv4q
Relaxation Refinement: A New Method to Generate Heuristic Functions
[chapter]
2009
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2008; you can also visit the original URL.
The file type is application/pdf.
In model checking, overapproximations are called abstractions, and abstraction refinement is a powerful method developed to derive approximations that are sufficiently precise for verifying the system ...
We investigate how an abstraction refinement process for generating heuristic functions should differ from the process used in the verification context. ...
We could also like to thank the anonymous reviewers of this paper for their useful comments. ...
doi:10.1007/978-3-642-00431-5_10
fatcat:wzwqr7puvjfsne3pubi4ko3hwi
Automatic Abstraction Refinement for Timed Automata
[chapter]
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Since the abstractions are overapproximations, absence of abstract counterexamples implies a valid result for the full model. ...
We present a fully automatic approach for counterexample guided abstraction refinement of real-time systems modelled in a subset of timed automata. ...
For these runs we use a variant of UPPAAL called UPPAAL/DMC that allows for directed model checking [16, 17] . ...
doi:10.1007/978-3-540-75454-1_10
fatcat:ssqv4tbqhrdkrdlfchu3dbwdb4