Model Verification Through Dependency Graphs
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14330%2F19%3A00113642" target="_blank" >RIV/00216224:14330/19:00113642 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1007/978-3-030-30923-7_1" target="_blank" >http://dx.doi.org/10.1007/978-3-030-30923-7_1</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/978-3-030-30923-7_1" target="_blank" >10.1007/978-3-030-30923-7_1</a>
Alternative languages
Result language
angličtina
Original language name
Model Verification Through Dependency Graphs
Original language description
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.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Result continuities
Project
—
Continuities
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace
Others
Publication year
2019
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
Proceedings of the 26th International SPIN Symposium on Model Checking of Software (SPIN'19)
ISBN
9783030309220
ISSN
0302-9743
e-ISSN
—
Number of pages
19
Pages from-to
1-19
Publisher name
Springer
Place of publication
The Nederlands
Event location
China
Event date
Jan 1, 2019
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—