The Internet architecture uses congestion avoidance mechanisms implemented in the
transport layer protocol like TCP to provide good service under heavy load. If network nodes …

We apply the concept of formula treewidth and pathwidth to computation tree logic, linear
temporal logic, and the full branching time logic. Several representations of formulas as …

We present an almost complete classification of the parameterized complexity of all operator
fragments of the satisfiability problem in computation tree logic CTL. The investigated …

We classify the complexity of the LTL satisfiability and model checking problems for several
standard parameterisations. The investigated parameters are temporal depth, number of …

The main objective of the dissertation is to provide a detailed study of several different types
of simulations and bisimulations for Kripke models of fuzzy multimodal logics. Two types of …

This thesis aims at classifying the temporal logics CTL, LTL and CTL∗ in terms of
parameterized complexity of their satisfiability and model checking problems. The studied …

The main objective of the dissertation is to provide a detailed study of several different types
of simulations and bisimulations for Kripke models of fuzzy multimodal logics. Two types of …

Parameterized complexity is a branch of a computational complexity. The pioneers of this
new and promising research field are Downey and Fellows. They suggest to examine the …

We present an almost complete classification of the parameterized complexity of all operator
fragments of the satisfiability problem in computation tree logic CTL. The investigated …

We investigate the complexity of modal satisfiability for a family of multi-modal logics with
interdependencies among the modalities. In particular, we examine four characteristic multi …