摘要：In this paper we investigate the Timed Alternating-Time Temporal Logic (TATL), a discretetime
extension of ATL. In particular, we propose, systematize, and further study semantic variants
of TATL, based on different notions of a strategy. The notions are derived from different assumptions
about the agents’ memory and observational capabilities, and range from timed perfect recall
to untimed memoryless plans. We also introduce a new semantics based on counting the number
of visits to locations during the play. We show that all the semantics, except for the untimed memoryless
one, are equivalent when punctuality constraints are not allowed in the formulae. In fact,
abilities in all those notions of a strategy collapse to the “counting” semantics with only two actions
allowed per location. On the other hand, this simple pattern does not extend to the full TATL.
As a consequence, we establish a hierarchy of TATL semantics, based on the expressivity of the
underlying strategies, and we show when some of the semantics coincide. In particular, we prove
that more compact representations are possible for a reasonable subset of TATL specifications,
which should improve the efficiency of model checking and strategy synthesis.
其他摘要：In this paper we investigate the Timed Alternating-Time Temporal Logic (TATL), a discrete-time extension of ATL. In particular, we propose, systematize, and further study semantic variants of TATL, based on different notions of a strategy. The notions are derived from different assumptions about the agents’ memory and observational capabilities, and range from timed perfect recall to untimed memoryless plans. We also introduce a new semantics based on counting the number of visits to locations during the play. We show that all the semantics, except for the untimed memoryless one, are equivalent when punctuality constraints are not allowed in the formulae. In fact, abilities in all those notions of a strategy collapse to the “counting” semantics with only two actions allowed per location. On the other hand, this simple pattern does not extend to the full TATL. As a consequence, we establish a hierarchy of TATL semantics, based on the expressivity of the underlying strategies, and we show when some of the semantics coincide. In particular, we prove that more compact representations are possible for a reasonable subset of TATL specifications, which should improve the efficiency of model checking and strategy synthesis.
