We introduce a hierarchy of fast-growing complexity classes and show its suitability for
completeness statements of many nonelementary problems. This hierarchy allows the …

Well-structured systems, aka WSTS, are computational models where the set of possible
configurations is equipped with a well-quasi-ordering which is compatible with the transition …

Tractable Interval Temporal Propositional and Description Logics Page 1 Tractable Interval
Temporal Propositional and Description Logics A. Artale1 and R. Kontchakov2 and V …

We investigate the satisfiability problem for Horn fragments of the Halpern-Shoham interval
temporal logic depending on the type (box or diamond) of the interval modal operators, the …

We define and illustrate the expressiveness of the fragment of the Epistemic Halpern–
Shoham Logic as a specification language for multi-agent systems. We consider the model …

Well-quasi-orderings (wqos)(Kruskal, 1972) are a fundamental tool in logic and computer
science. ey provide termination arguments in a large number of decidability (or finiteness …

Interval temporal logics take time intervals, instead of time points, as their primitive temporal
entities. One of the most studied interval temporal logics is Halpern and Shoham's modal …

This document is dedicated to the algorithmic complexity of well-quasi-orders, with a
particular focus on their applications in verification, where they allow to tackle systems …

Interval temporal logics provide a general framework for temporal reasoning about interval
structures over linearly ordered domains, where intervals are taken as the primitive …

Cache-coherent multiprocessors are typically verified by extensive simulation with randomly
generated testcases. With this methodology, certain aspects of test coverage can be …