8 research outputs found
LNCS
Imprecision in timing can sometimes be beneficial: Metric interval temporal logic (MITL), disabling the expression of punctuality constraints, was shown to translate to timed automata, yielding an elementary decision procedure. We show how this principle extends to other forms of dense-time specification using regular expressions. By providing a clean, automaton-based formal framework for non-punctual languages, we are able to recover and extend several results in timed systems. Metric interval regular expressions (MIRE) are introduced, providing regular expressions with non-singular duration constraints. We obtain that MIRE are expressively complete relative to a class of one-clock timed automata, which can be determinized using additional clocks. Metric interval dynamic logic (MIDL) is then defined using MIRE as temporal modalities. We show that MIDL generalizes known extensions of MITL, while translating to timed automata at comparable cost
Control Synthesis for Multi-Agent Systems under Metric Interval Temporal Logic Specifications
This paper presents a framework for automatic synthesis of a control sequence
for multi-agent systems governed by continuous linear dynamics under timed
constraints. First, the motion of the agents in the workspace is abstracted
into individual Transition Systems (TS). Second, each agent is assigned with an
individual formula given in Metric Interval Temporal Logic (MITL) and in
parallel, the team of agents is assigned with a collaborative team formula. The
proposed method is based on a correct-by-construction control synthesis method,
and hence guarantees that the resulting closed-loop system will satisfy the
specifications. The specifications considers boolean-valued properties under
real-time. Extended simulations has been performed in order to demonstrate the
efficiency of the proposed controllers.Comment: 8 pages version of the accepted paper to IFAC World Congres
Real-Time Synthesis is Hard!
We study the reactive synthesis problem (RS) for specifications given in
Metric Interval Temporal Logic (MITL). RS is known to be undecidable in a very
general setting, but on infinite words only; and only the very restrictive BRRS
subcase is known to be decidable (see D'Souza et al. and Bouyer et al.). In
this paper, we precise the decidability border of MITL synthesis. We show RS is
undecidable on finite words too, and present a landscape of restrictions (both
on the logic and on the possible controllers) that are still undecidable. On
the positive side, we revisit BRRS and introduce an efficient on-the-fly
algorithm to solve it