3 papers
cs.FL2026
A Zielonka-type Construction for Connectedly Communicating Processes
Béatrice Bérard, Benjamin Monmege, B Srivathsan +1
Given a global specification as a trace-closed regular language, Zielonka's theorem provides a construction to synthesise a language equivalent distributed implementation represent…
cs.FL2025
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…