This unpublished note is an alternate, shorter (and hopefully more readable) proof of the decidability of all minimal models. The decidability follows a proof of the existence of a cellular term in each observational equivalence class of a minimal model. The first proof I gave of the decidability of all minimal models [3] was far from being easy to understand. I was only an inexperienced studen...

We investigate a timed extension of the class of Basic Parallel Processes (BPP), in which actions are durational and urgent and parallel components have independent local clocks. The main result is decidability of strong bisimilarity, known also as performance equivalence, in this class. This extends the earlier decidability result for plain BPP [8] as well as decidability for timed BPP with st...

Reasoning for Description logics with concrete domains and w.r.t. general TBoxes easily becomes undecidable. However, with some restriction on the concrete domain, decidability can be regained. We introduce a novel way to integrate concrete domains D into the well-known description logic ALC, we call the resulting logic ALC(D). We then identify sufficient conditions on D that guarantee decidabi...

This paper focuses on decidability problems for metric and layered temporal logics which allow one to model time granularity in various contexts. The decidability of pure metric (non-granular) fragments and of metric temporal logics endowed with nitely many layers has been already proved by reduction to the decidability problem of the well-known theory S1S. In the present work, we prove the dec...