Synchronizing words under LTL constraints

Nathalie Bertrand (1) , Hugo Francon (1) , Nicolas Markey (1)

1 SUMO - SUpervision of large MOdular and distributed systems

Synchronizing a (deterministic, finite-state) automaton is the problem of finding a sequence of actions to be played in the automaton in order to end up in the same state independently of the starting state. We consider synchronization with LTL constraints on the executions leading to synchronization, extending the results of [Petra Wolf. Synchronization under dynamic constraints. FSTTCS'20] by showing that the problem is PSPACE-complete for LTL as well as for restricted fragments (involving only modality F or G), while it is NP-complete for constraints expressed using only modality X.

Domaines: Informatique [cs]

Nathalie Bertrand, Hugo Francon, Nicolas Markey. Synchronizing words under LTL constraints. Information Processing Letters, 2023, 182, pp.106392. ⟨10.1016/j.ipl.2023.106392⟩. ⟨hal-04219120⟩