Iskanje po katalogu digitalne knjižnice

Iskalni niz:	išči po
	išči po
	išči po
	išči po
Vrsta gradiva:	* po starem in bolonjskem študiju
Jezik:
Išči po:
Opcije:	Prikaži samo zadetke s celotnim besedilom
	Ponastavi

1 - 2 / 2

Improved formal verification of SDN-based firewalls by using TLA+
Tatjana Kapus, 2023, izvirni znanstveni članek

Opis: In an article published in IEEE Access in 2020, researchers present an approach to using TLA + for the formal verification of whether a network of SDN (Software-Defined Networking) switches implements the filtering rules of a given monolithic firewall. The distributed as well as monolithic firewalls are specified with TLA + . It is shown that the correctness of the former with respect to the latter can be verified automatically by using the TLC model checker. The main contributions of this paper are the following improvements of that approach. Firstly, by specifying switches without using any variables, the time needed for the model checking is reduced significantly. For example, the verification of the same networks takes a few seconds with the new approach and does not end after several hours with the previous one. Secondly, the following problem is solved. With the latter, if a monolithic firewall allows a packet to pass through, all the paths in the distributed firewall which the packet is routed on must allow the same. Otherwise, the model checker proclaims the distributed firewall to be in error. We present an additional approach to the verification, which gives a positive answer if at least one of the paths allows the packet to pass through.
Ključne besede: firewalls, formal specification, formal verification, logic, model checking, software defined networking
Objavljeno v DKUM: 04.12.2023; Ogledov: 285; Prenosov: 30
Celotno besedilo (1,24 MB)
Gradivo ima več datotek! Več...

Modelling medium access control in IEEE 802.15.4 nonbeacon-enabled networks with probabilistic timed automata
Tatjana Kapus, izvirni znanstveni članek

Opis: This paper concerns the formal modelling of medium access control in nonbeacon-enabled IEEE 802.15.4 wireless personal area networks with probabilistic timed automata supported by the PRISM probabilistic model checker. In these networks, the devices contend for the medium by executing an unslotted carrier sense multiple access with collision avoidance algorithm. In the literature, a model of a network which consists of two stations sending data to two different destination stations is introduced. We have improved this model and, based on it, we propose two ways of modelling a network with an arbitrary number of sending stations, each having its own destination. We show that the same models are valid representations of a star-shaped network with an arbitrary number of stations which send data to the same destination station. We also propose how to model such a network if some of the sending stations are not within radio range of the others, i.e. if they are hidden. We present some results obtained for these models by probabilistic model checking using PRISM.
Ključne besede: wireless personal area network, medium access control, hidden station, formal specification, probabilistic model checking
Objavljeno v DKUM: 15.06.2017; Ogledov: 1371; Prenosov: 377
Celotno besedilo (2,25 MB)
Gradivo ima več datotek! Več...

Iskanje izvedeno v 0.07 sek.

Na vrh