Teofil Sidoruk

Teofil Sidoruk

Auto-generated profile, based on publicly available information

Teofil Sidoruk

Institute of Computer Science, Polish Academy of Sciences, Warsaw, Poland

Research Focus & Metrics

Academic Career Length

9Years (2018-Present)

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

Representative Publications

View All Publications
19 December 2020
Verified
Book Chapter
Closed access
PDF file
JAJaime Arias
Jaime Arias
CBCarlos E. Budde
Carlos E. Budde
WPWojciech Penczek
Wojciech Penczek
LPLaure Petrucci
Laure Petrucci
TSTeofil Sidoruk
Teofil Sidoruk
MSMariëlle Stoelinga
Mariëlle Stoelinga

14 March 2019 in Fundamenta Informaticae
Verified
Journal Article
Closed access
PDF file
ANArtur Niewiadomski
Artur Niewiadomski
PSPiotr Switalski
Piotr Switalski
TSTeofil Sidoruk
Teofil Sidoruk
WPWojciech Penczek
Wojciech Penczek
We present nine SAT-solvers and compare their efficiency for several decision and combinatorial problems: three classical NP-complete problems of the graph theory, bounded Post correspondence problem (BPCP), extended string correction problem (ESCP),

31 January 2024 in IEEE Transactions on Reliability
Verified
Journal Article
Closed access
JAJaime Arias
Jaime Arias
COCarlos Olarte
Carlos Olarte
LPLaure Petrucci
Laure Petrucci
ŁMŁukasz Maśko
Łukasz Maśko
WPWojciech Penczek
Wojciech Penczek
TSTeofil Sidoruk
Teofil Sidoruk
Expressing attack-defence trees in a multiagent setting allows for studying a new aspect of security scenarios, namely, how the number of agents and their task assignment impact the performance, e.g. , attack time, of strategies executed by opposing coalitions. Optimal scheduling of agents' actions, a nontrivial problem, is thus vital. We discuss associated caveats and propose an algorithm that synthesizes such an assignment, targeting minimal attack time and using the minimal number of agents for a given attack-defence tree. We also investigate an alternative approach for the same problem using rewriting logic, starting with a simple and elegant declarative model, whose correctness (in terms of schedule's optimality) is self-evident. We then refine this specification, inspired by the design of our specialized algorithm, to obtain an efficient system that can be used as a playground to explore various aspects of attack-defence trees. We compare the two approaches on different benchmarks.

9 February 2026 in Autonomous Agents and Multi-Agent Systems
Verified
Journal Article
Open access
PDF file
JAJaime Arias
Jaime Arias
WJWojciech Jamroga
Wojciech Jamroga
WPWojciech Penczek
Wojciech Penczek
LPLaure Petrucci
Laure Petrucci
TSTeofil Sidoruk
Teofil Sidoruk
We define extensions of \(\textbf{CTL}\) and TCTL with strategic operators, called Strategic \(\textbf{CTL}\) (SCTL) and Strategic TCTL (STCTL), respectively. For each of the above logics we give a synchronous and asynchronous semantics, i.e. STCTL is interpreted over networks of extended Timed Automata (TA) that either make synchronous moves or synchronise via joint actions. We consider several semantics regarding information: imperfect (i) and perfect (I), and recall: imperfect (r) and perfect (R). We prove that SCTL is more expressive than ATL for all semantics,and this holds for the timed versions as well. Moreover, the model checking problem for SCTL \(_{{\textbf {ir}}}\) is of the same complexity as for ATL \(_{{\textbf {ir}}}\), the model checking problem for STCTL \(_{{\textbf {iR}}}\) is of the same complexity as for TCTL, while for STCTL \(_{{\textbf {iR}}}\) it is undecidable as for ATL \(_{{\textbf {iR}}}\). The above results suggest to use SCTL \(_{{\textbf {ir}}}\) and STCTL \(_{{\textbf {ir}}}\) in practical applications. Therefore, we use the tool IMITATOR to support model checking of STCTL \(_{{\textbf {ir}}}\).

25 September 2018 in Scientific Annals of Computer Science
Verified
Journal Article
Open access
ANArtur Niewiadomski
Artur Niewiadomski
PSPiotr Switalski
Piotr Switalski
TSTeofil Sidoruk
Teofil Sidoruk
WPWojciech Penczek
Wojciech Penczek

9 September 2024
Verified
Conference Paper
Open access
JAJaime Arias
Jaime Arias
COCarlos Olarte
Carlos Olarte
WPWojciech Penczek
Wojciech Penczek
LPLaure Petrucci
Laure Petrucci
TSTeofil Sidoruk
Teofil Sidoruk
Strategic Timed CTL (STCTL) is an expressive logic that integrates branching time CTL with the representation of continuous time, and the notion of strategic abilities of agents. This makes STCTL suitable for specifying properties of asynchronous multi-agent systems modeled as networks of Parametric Timed Automata (PTA). Existing model checkers and synthesis procedures for STCTL are often limited in scope (bounded analyses), rely on ad-hoc implementations, and are difficult to prove correct. In this paper we propose declarative methods for STCTL model checking and synthesis using rewriting logic. Our approach uses rewriting modulo SMT to represent clock constraints and timed parameters as terms in a rewrite theory, and we adequately capture the continuous semantics of STCTL via rewriting strategies. The resulting algebraic specification is executable in the rewrite engine Maude. This is a novel application of Maude’s strategy language and, since our procedures are grounded on logical means, it is simpler to prove them correct. Our approach advances the state of the art for the analysis of multi-agent systems by allowing for the nesting of temporal operators and universal STCTL formulas, which have not been considered before. We benchmark our rewrite theory against existing procedures for STCTL, demonstrating competitive performance and even outperforming dedicated procedures for the existential fragment of STCTL. We thus provide a more robust and verifiable approach to STCTL model checking and synthesis.