Mcta: Heuristics and Search for Timed Systems

Wehrle, Martin; Kupferschmid, Sebastian

doi:10.1007/978-3-642-33365-1_18

Cited by 4 publications

(6 citation statements)

References 20 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Mcta [25,36] is a model checking tool for concurrent timed automata systems. It is released under the GPL and available at http://mcta.informatik.uni-freiburg.de.…”

Section: The Mcta Model Checkermentioning

confidence: 99%

“…In the second part, based on these criteria, we present a pattern selection algorithm based on successively abstracting the original system as long as the resulting system remains similar according to these criteria (i. e., as long as only little spurious behavior is introduced). We have implemented downward pattern refinement and the corresponding architecture for pattern databases into our model checking tool Mcta [25,36]. We demonstrate that downward pattern refinement can result in small patterns that still lead to very informed pattern database heuristics.…”

mentioning

confidence: 98%

“…Directed model checking has recently found much attention in different variants and contexts [9,12,14,19,22,23,30,32,[34][35][36][37]. For a given model M of a system, the main idea is to focus the search on those parts of the state space of M that appear to be promising to contain a reachable error state.…”

mentioning

confidence: 99%

See 2 more Smart Citations

Downward pattern refinement for timed automata

Wehrle

Kupferschmid²

2014

Int J Softw Tools Technol Transfer

Self Cite

View full text Add to dashboard Cite

Directed model checking is a well-established approach for detecting error states in concurrent systems. A popular variant to find shortest error traces is to apply the A * search algorithm with distance heuristics that never overestimate the real error distance. An important class of such distance heuristics is the class of pattern database heuristics. Pattern database heuristics are built on abstractions of the system under consideration. In this paper, we propose downward pattern refinement, a systematic approach for the construction of pattern database heuristics for concurrent systems of timed automata. First, we propose a general framework for pattern databases in the context of timed automata and show that desirable theoretical properties hold for the resulting pattern database. Afterward, we formally define a concept to measure the accuracy of abstractions. Based on this concept, we propose an algorithm for computing succinct abstractions that are still accurate to produce informed pattern databases. We evaluate our approach on large and complex industrial problems. The experiments show the practical potential of the resulting pattern database heuristic.

show abstract

“…Mcta [25,36] is a model checking tool for concurrent timed automata systems. It is released under the GPL and available at http://mcta.informatik.uni-freiburg.de.…”

Section: The Mcta Model Checkermentioning

confidence: 99%

mentioning

confidence: 98%

See 1 more Smart Citation

Downward pattern refinement for timed automata

Wehrle

Kupferschmid²

2014

Int J Softw Tools Technol Transfer

Self Cite

View full text Add to dashboard Cite

show abstract

Section: Introductionmentioning

confidence: 99%

“…Our dynamic encodings are computed based on refinement cycles, which compute translations adaptively based on the input planning problem. For the evaluation, we apply directed model checking on the translated model checking problem, based on the model checker MCTA (Kupferschmid et al 2008;Wehrle and Kupferschmid 2012). The experiments show promising performance on common temporal IPC domains.…”

Section: Introductionmentioning

confidence: 99%

Temporal Planning as Refinement-Based Model Checking

Heinz

Wehrle

Bogomolov

et al. 2019

ICAPS

Self Cite

View full text Add to dashboard Cite

Planning as model checking based on source-to-source compilations has found increasing attention. Previously proposed approaches for temporal and hybrid planning are based on static translations, in the sense that the resulting model checking problems are uniquely defined by the given input planning problems. As a drawback, the translations can become too large to be efficiently solvable. In this paper, we address propositional temporal planning, lifting static translations to a more flexible framework. Our framework is based on a refinement cycle that allows for adaptively computing suitable translations of increasing size. Our experiments on temporal IPC domains show that the resulting translations to timed automata often become succinct, resulting in promising performance when applied with the directed model checker MCTA.

show abstract

On Computer-Assisted Verification of Timed Anonymity of Multi-Agent Systems

Kawabe

Ito

2016

2016 4th Intl Conf on Applied Computing and Information Technology/3rd Intl Conf on Computational Science/Intelligence and Appl

View full text Add to dashboard Cite

Mcta: Heuristics and Search for Timed Systems

Cited by 4 publications

References 20 publications

Downward pattern refinement for timed automata

Downward pattern refinement for timed automata

Temporal Planning as Refinement-Based Model Checking

On Computer-Assisted Verification of Timed Anonymity of Multi-Agent Systems

Contact Info

Product

Resources

About