Recent decidability results on the satisfiability problem for temporal logics, in particular LTL, CTL∗ and ECTL∗, with constraints over external structures like the integers with the order or infinite trees are surveyed in this paper. 1998 ACM Subject Classification F.4.1 Mathematical Logic

Often when modelling systems, physical constraints on the resources available are needed. For example, we might say that at most N processes can access a particular resource at any moment or exactly M participants are needed for an agreement. Such situations are concisely modelled where propositions are constrained such that at most N , or exactly M , can hold at any moment in time. This paper ...

We introduce a temporal model for reasoning on disjunctive metric constraints on intervals and time points in temporal contexts. This temporal model is composed of a labeled temporal algebra and its reasoning algorithms. The labeled temporal algebra defines labeled disjunctive metric pointbased constraints, where each disjunct in each input disjunctive constraint is univocally associated to a l...

Clinical trial protocols include schedule of clinical trial activities such as clinical tests, procedures, and medications. The schedule specifies temporal constraints on the sequence of these activities, on their start times and duration, and on their potential repetitions. There is an enormous requirement to conform to the constraints found in the protocols during the conduct of the clinical ...

System compositioddecomposition has to be analyzed in terms of temporal constraints associated with the components' external interjiace. In this paper the analysis is focused on the propagation of temporal constraints along the structural hierarchy, thus showing that in many cases missing temporal constraints can be evaluated on the basis of the temporal constraints known. A set of criteria for...