Publication Details
On formal reachability analysis in networks with dynamic behavior
Ryšavý Ondřej, doc. Ing., Ph.D. (DIFS)
Matoušek Petr, doc. Ing., Ph.D., M.A. (DIFS)
Švéda Miroslav, prof. Ing., CSc. (UTKO)
and others
Formal modeling and analysis, Network service reachability, Dynamic routing, Configuration validation
Recently, several researches have suggested an application of formal methods for identifying configuration errors, unveiling design problems and predicting network behavior. In this paper, we contribute to this research area by defining a method able to efficiently check reachability properties in dynamically routed networks. We define a notion of network state that captures different network conditions. Each network state represents a unique combination of link availability. The naive enumeration of network states leads quickly to intractability even for small networks as the number of possible combinations grows exponentially. Instead, we enumerate all available paths and, for each path, we search for state aggregation, in which this path is active.
@article{BUT91437,
author="Hidda Marakkala Gayan Ruchika {de Silva} and Ondřej {Ryšavý} and Petr {Matoušek} and Miroslav {Švéda}",
title="On formal reachability analysis in networks with dynamic behavior",
journal="TELECOMMUNICATION SYSTEMS",
year="2013",
volume="52",
number="2",
pages="919--929",
issn="1018-4864",
url="http://link.springer.com/article/10.1007%2Fs11235-011-9585-2"
}