Other formats:
BibTeX
LaTeX
RIS
@inproceedings{1646344,
author = {Enevoldsen, Soeren and Larsen, Kim G. and Srba, Jiří},
address = {The Nederlands},
booktitle = {Proceedings of the 26th International SPIN Symposium on Model Checking of Software (SPIN'19)},
doi = {http://dx.doi.org/10.1007/978-3-030-30923-7_1},
keywords = {dependency graph; on-the-fly algorithms; model checking; verification},
howpublished = {tištěná verze "print"},
language = {eng},
location = {The Nederlands},
isbn = {978-3-030-30922-0},
pages = {1-19},
publisher = {Springer},
title = {Model Verification Through Dependency Graphs},
year = {2019}
}
TY - JOUR
ID - 1646344
AU - Enevoldsen, Soeren - Larsen, Kim G. - Srba, Jiří
PY - 2019
TI - Model Verification Through Dependency Graphs
PB - Springer
CY - The Nederlands
SN - 9783030309220
KW - dependency graph
KW - on-the-fly algorithms
KW - model checking
KW - verification
N2 - 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. We present an overview of the recent results on extensions of dependency graphs in order to deal with verification of quantitative, probabilistic and timed systems.
ER -
ENEVOLDSEN, Soeren, Kim G. LARSEN and Jiří SRBA. Model Verification Through Dependency Graphs. In \textit{Proceedings of the 26th International SPIN Symposium on Model Checking of Software (SPIN'19)}. The Nederlands: Springer, 2019, p.~1-19. ISBN~978-3-030-30922-0. Available from: https://dx.doi.org/10.1007/978-3-030-30923-7\_{}1.
|
