Learn More
In this paper we calculate the minimal number of states of Buchi automata which encode some classes of linear temporal logic (LTL) formulas that are frequently used in model checking. Our results may be used for verification of the quality of algorithms which automatically translate LTL formulas into Buchi automata and for improving the quality and speed of(More)
In this paper we take a closer look at ISP networks that have a centralized SDN control plane. A heuristic algorithm for the CFA problem for such networks is proposed, that takes under account two factors: the speed of individual links and ISP network's given properties. Streszczenie. W niniejszej pracy rozważane są sieci ISP z wdrożoną warstwą sterowania(More)