A finite-state approach to temporal ontology for natural language text is described under which intervals (of the real line) paired with event descriptions are encoded as strings. The approach is applied to an interval temporal logic linked to TimeML, a standard mark-up language for time and events, for which various finite-state mechanisms are proposed.

Composition of high-speed protocols from basic protocol mechanisms can help to realize the exible application-speci c selection of protocols. For the purpose of formal speci cation, functional modelling, analysis, and veri cation of composed protocols we apply L. Lamport's Temporal Logic of Actions (TLA). We propose a modular and compositional style of speci cation, which supports the analysis ...

A method is described for proving “always possibly” properties of specifications in formalisms with linear-time trace semantics. It is shown to be relatively complete for TLA (Temporal Logic of Actions) specifications.

In this paper we develop a new modal logic for spatial reasoning called Temporalized Propositional Neighborhood Logic, which is the result of the application of a known technique called temporalization to a known temporal logic for spatial reasoning (PNL). We will show that our logic is expressive enough to formalize interesting spatial statements and that it is decidable in NEXPTIME.

We propose a non-standard semantics for Alternating-time Temporal Logic with incomplete information, for which no commonly accepted semantics has been proposed yet. In our semantics, formulae are interpreted over sets of states rather than single states. We also propose a new epistemic operator for “practical” or “constructive” knowledge, and we show that the new language is strictly more expre...

Policies are increasingly used to govern the behaviour of complex distributed systems. Most policy models that allow policy composition, to address the complexity of policies, are only concerned with structural composition. In this paper we argue that it is natural to compose policies also along the temporal axis, i.e. express policies that can dynamically change over time or on the occurrence ...

from [TW96]) We reveal an intimate connection between semidirect products of nite semigroups and substitution of formulas in linear temporal logic. We use this connection to obtain an algebraic characterization of the `until' hierarchy of linear temporal logic; the k-th level of that hierarchy is comprised of all temporal properties that are expressible by a formula of nesting depth k in the `u...

We combine quantified differential dynamic logic (QdL) for reasoning about the possible behavior of distributed hybrid systems with temporal logic for reasoning about the temporal behavior during their operation. Our logic supports verification of temporal and non-temporal properties of distributed hybrid systems and provides a uniform treatment of discrete transitions, continuous evolution, an...