Dependency graphs, as introduced more than 20 years ago by Liu and Smolka, are oriented graphs with hyperedges that connect nodes with sets of target nodes in order to represent causal dependencies in the graph. Numerous verification problems can be reduced into the problem of computing a minimum or maximum fixed-point assignment on dependency graphs. In the original definition, assignments link each node with a Boolean value; however, in the recent work the assignment domains have been extended to more general setting, even including infinite domains. In this survey paper, we present an overview of the recent results on extensions of dependency graphs in order to deal with verification of quantitative, probabilistic, parameterized and timed systems.
|Journal||International Journal on Software Tools for Technology Transfer|
|Number of pages||20|
|Publication status||Published - 1 Oct 2020|
Bibliographical noteFunding Information:
We would like to thank to Hubert Garavel and Radu Mateescu for sharing the French history of on-the-fly model checking with us. The work of the second author has taken place in the context of the ERC Advanced Grant LASSO.
© 2020, Springer-Verlag GmbH Germany, part of Springer Nature.
Copyright 2020 Elsevier B.V., All rights reserved.
- Dependency graphs
- Fixed-point computation
- On-the-fly algorithms