Andrzej Zbrzezny

Prof. Dr. Andrzej Zbrzezny

orcid

Research Focus & Metrics

Academic Career Length

37Years (1990-Present)

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

Representative Publications

View All Publications
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.

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

27 April 2021 in Sensors
Verified
Journal Article
Open access
PDF file
SSSabina Szymoniak
Sabina Szymoniak
Olga Siedlecka-LamchOlga Siedlecka-Lamch
Olga Siedlecka-Lamch
AZAgnieszka Malgorzata Zbrzezny
Agnieszka Malgorzata Zbrzezny
AZAndrzej Zbrzezny
Andrzej Zbrzezny
MKMiroslaw Kurkowski
Miroslaw Kurkowski
For many years various types of devices equipped with sensors have guaranteed proper work in a huge amount of machines and systems. For the proper operation of sensors, devices, and complex systems, we need secure communication. Security protocols (SP) in this case, guarantee the achievement of security goals. However, the design of SP is not an easy process. Sometimes SP cannot realise their security goals because of errors in their constructions and need to be investigated and verified in the case of their correctness. Now SP uses often time primitives due to the necessity of security dependence on the passing of time. In this work, we propose and investigate the SAT-and SMT-based formal verification methods of SP used in communication between devices equipped with sensors. For this, we use a formal model based on networks of communicating timed automata. Using this, we show how the security property of SP dedicated to the sensors world can be verified. In our work, we investigate such timed properties as delays in the network and lifetimes. The delay in the network is the lower time constraint related to sending the message. Lifetime is an upper constraint related to the validity of the timestamps generated for the transmitted messages.

29 October 2015 in Studia Logica
Verified
Journal Article
Open access
PDF file
BWBożena Woźna-Szcześniak
Bożena Woźna-Szcześniak
AZAndrzej Zbrzezny
Andrzej Zbrzezny
We investigate a SAT-based bounded model checking (BMC) method for EMTLK (the existential fragment of the metric temporal logic with knowledge) that is interpreted over timed models generated by timed interpreted systems. In particular, we translate the existential model checking problem for EMTLK to the existential model checking problem for a variant of linear temporal logic (called HLTLK), and we provide a SAT-based BMC technique for HLTLK. We evaluated the performance of our BMC by means of a variant of a timed generic pipeline paradigm scenario and a timed train controller system.

1 January 2012 in Fundamenta Informaticae
Verified
Journal Article
Closed access
PDF file
AZAndrzej Zbrzezny
Andrzej Zbrzezny
In this paper we present a new translation from ECTL* to SAT and show that the proposed translation substantially increases the efficiency of verifying temporal properties using the Bounded Model Checking method. We have implemented our new translati