Abstract

Primarily guided with the idea to express zero-time transitions by means of temporal propositional language, we have developed a temporal logic where the time flow is isomorphic to ordinal ω2ω^2 (concatenation of ωω copies of ωω). If we think of ω2ω^2 as lexicographically ordered ω×ωω\times ω, then any particular zero-time transition can be represented by states whose indices are all elements of some {n}×ω\{n\}\timesω. In order to express non-infinitesimal transitions, we have introduced a new unary temporal operator [ω][ω] (ωω-jump), whose effect on the time flow is the same as the effect of α↦α+ωα\mapsto α+ω in ω2ω^2. In terms of lexicographically ordered ω×ωω\times ω, [ω]ϕ[ω] ϕ is satisfied in  <i,j >\ < i,j\ >-th time instant iff ϕϕ is satisfied in  <i+1,0 >\ < i+1,0\ >-th time instant. Moreover, in order to formally capture the natural semantics of the until operator U\mathtt U, we have introduced a local variant u\mathtt u of the until operator. More precisely, ϕ uψϕ\,\mathtt u ψ is satisfied in  <i,j >\ < i,j\ >-th time instant iff ψψ is satisfied in  <i,j+k >\ < i,j+k\ >-th time instant for some nonnegative integer kk, and ϕϕ is satisfied in  <i,j+l >\ < i,j+l\ >-th time instant for all 0⩽l<k0\leqslant l<k. As in many of our previous publications, the leitmotif is the usage of infinitary inference rules in order to achieve the strong completeness.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.