Bożena Woźna-Szcześniak

Prof. Dr. Bożena Woźna-Szcześniak

orcid

Research Focus & Metrics

Academic Career Length

25Years (2002-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
30 September 2019 in Journal of Optical Communications and Networking
Verified
Journal Article
Closed access
PDF file
ISIreneusz Szcześniak
Ireneusz Szcześniak
AJAndrzej Jajszczyk
Andrzej Jajszczyk
BWBożena Woźna-Szcześniak
Bożena Woźna-Szcześniak
We present the generic Dijkstra shortest-path algorithm: an efficient algorithm for finding a shortest path in an optical network, in both a wavelength-division multiplexed network and an elastic optical network (EON). The proposed algorithm is an enabler of real-time softwarized control of large-scale networks and is not limited to optical networks. The Dijkstra algorithm is a generalization of the breadth-first search, and we generalize the Dijkstra algorithm further to resolve the continuity and contiguity constraints of the frequency slot units required in EONs. Specifically, we generalize the notion of a label, change what we iterate with, and reformulate the edge relaxation so that vertices are revisited, loops avoided, and worse labels discarded. We also use the typical constriction during edge relaxation to take care of the signal modulation constraints. The algorithm can be used with various spectrum allocation policies. We motivate and discuss the algorithm design, and provide our free, reliable, and generic implementation using the Boost Graph Library. We carried out 85,000 simulation runs for realistic and random networks (Gabriel graphs) of 75 vertices with about a billion shortest-path searches, and found that the proposed algorithm outperforms considerably three other competing optimal algorithms that are frequently used.

4 October 2002
Verified
Book Chapter
Closed access
PDF file
WPWojciech Penczek
Wojciech Penczek
BWBożena Woźna-Szcześniak
Bożena Woźna-Szcześniak
AZAndrzej Zbrzezny
Andrzej Zbrzezny

31 August 2013 in Autonomous Agents and Multi-Agent Systems
Verified
Journal Article
Open access
PDF file
AMArtur Mȩski
Artur Mȩski
WPWojciech Penczek
Wojciech Penczek
MSMaciej Szreter
Maciej Szreter
BWBożena Woźna-Szcześniak
Bożena Woźna-Szcześniak
AZAndrzej Zbrzezny
Andrzej Zbrzezny
The paper deals with symbolic approaches to bounded model checking (BMC) for the existential fragment of linear temporal logic extended with the epistemic component (ELTLK), interpreted over interleaved interpreted systems. Two translations of BMC for ELTLK to SAT and to operations on BDDs are presented. The translations have been implemented, tested, and compared with each other as well as with another tool on several benchmarks for MAS. Our experimental results reveal advantages and disadvantages of SAT- versus BDD-based BMC for ELTLK.

1 November 2007 in Artificial Intelligence
Verified
Journal Article
Closed access
ALAlessio Lomuscio
Alessio Lomuscio
WPWojciech Penczek
Wojciech Penczek
BWBożena Woźna-Szcześniak
Bożena Woźna-Szcześniak

28 February 2003
Verified
Book Chapter
Closed access
PDF file
PDPiotr Dembiński
Piotr Dembiński
AJAgata Janowska
Agata Janowska
PJPaweł Janowski
Paweł Janowski
WPWojciech Penczek
Wojciech Penczek
APAgata Półrola
Agata Półrola
AZAndrzej Zbrzezny
Andrzej Zbrzezny

1 January 2004 in Fundamenta Informaticae
Verified
Journal Article
Closed access
BWBożena Woźna-Szcześniak
Bożena Woźna-Szcześniak
The main contribution of the paper consists in showing that the bounded model checking (BMC) method is feasible for ACTLS* (the universal fragment of CTLS*) which subsumes both ACTL and LTL. The extension to ACTLS^* is obtained by redefining the function returning the sufficient number of executions over which an ACTLS* formula is checked, and then combining the two known translations to SAT for ACTL and LTL formulas. The proposed translation of ACTLS* formulas is essentially different from the existing translations of both ACTL and LTL formulas. Moreover, the formal treatment is the basis for the implementation of the technique in the symbolic model checker √erics.