Guided search for deadlocks in actor-based models

2Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Model checking is used to uncover errors by searching the state space of a model. Informed search algorithms use heuristic strategies with problem-specific knowledge to find solutions efficiently. Generally, such heuristics estimate the distance from a given state to a goal state. In this paper, we present seven heuristics for guiding search algorithms through the state-space of actor-based models to a deadlock. In many cases, our methods can find a deadlock more efficiently than uninformed searches. The A* search algorithm guarantees an optimal solution and returns the shortest counter-example when used with an admissible heuristic. These methods are supported by a tool that performs directed search for the deadlock property. The objective is to detect errors that might not be found by simulation or by conventional model checkers before reaching an upper bound or state-space explosion. © 2013 Springer-Verlag.

Cite

CITATION STYLE

APA

Sigurdarson, S. H., Sirjani, M., Björnsson, Y., & Reynisson, A. H. (2013). Guided search for deadlocks in actor-based models. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7684 LNCS, pp. 242–259). https://doi.org/10.1007/978-3-642-35861-6_15

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free