3 citations · 4 across the 4 of their papers we have counts for
4 papers · 1 filter
Looking at Mean-Payoff through Foggy Windows
Paul Hunter, Guillermo A. Pérez, Jean-François Raskin
Mean-payoff games (MPGs) are infinite duration two-player zero-sum games played on weighted graphs. Under the hypothesis of perfect information, they admit memoryless optimal strat…
The expressiveness of MTL with counting
Paul Hunter
It is well known that MTL with integer endpoints is unable to express all of monadic first-order logic of order and metric (FO(<,+1)). Indeed, MTL is unable to express the counting…
When is Metric Temporal Logic Expressively Complete?
Paul Hunter, Joël Ouaknine, James Worrell
A seminal result of Kamp is that over the reals Linear Temporal Logic (LTL) has the same expressive power as first-order logic with binary order relation < and monadic predicates.…
Expressive Completeness of Metric Temporal Logic
Paul Hunter, Joël Ouaknine, James Worrell
Metric Temporal Logic (MTL) is a generalisation of Linear Temporal Logic in which the Until and Since modalities are annotated with intervals that express metric constraints. A sem…