asynchronous automata 1connected communication 1distributed synthesis 1state complexity 1zielonka construction 1
From the 1 of 3 linked papers with an AI index.
3 papers
cs.FL2026
A Zielonka-type Construction for Connectedly Communicating Processes
Béatrice Bérard, Benjamin Monmege, B Srivathsan +1
The paper extends Zielonka’s construction to synthesize deterministic asynchronous automata from DFA specifications when processes communicate with a bounded delay, allowing some p…
cs.FL2026
Synthesising Asynchronous Automata from Fair Specifications
Béatrice Bérard, Benjamin Monmege, B Srivathsan +1
Asynchronous automata are a model of distributed finite state processes synchronising on shared actions. A celebrated result by Zielonka shows how a deterministic asynchronous auto…
cs.FL2025
Recognizing Numbers
Pranshu Gaba, Arnab Sur
The use of monoids in the study of word languages recognized by finite-state automata has been quite fruitful. In this work, we look at the same idea of "recognizability by finite…