12 search results - page 1 / 3 » A Decidable Temporal Logic of Repeating Values |
LFCS
2007
Springer
13 years 10 months ago
2007
Springer
Various logical formalisms with the freeze quantifier have been recently considered to model computer systems even though this is a powerful mechanism that often leads to undecida...
CADE
2005
Springer
14 years 5 months ago
2005
Springer
In this paper we study the decidability of various fragments of monodic first-order temporal logic by temporal resolution. We focus on two resolution calculi, namely, monodic tempo...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
The paper proposes and studies temporal logics for attributed words, that is, data words with a (finite) set of (attribute,value)-pairs at each position. It considers a basic logi...
LICS
2006
IEEE
13 years 10 months ago
2006
IEEE
— In a data word each position carries a label from a finite alphabet and a data value from some infinite domain. These models have been already considered in the realm of semi...
CSL
2006
Springer
13 years 4 months ago
2006
Springer
In a data word or a data tree each position carries a label from a finite alphabet and a data value from some infinite domain. These models have been considered in the realm of sem...