Now showing items 21-23 of 23

    • Adding Reconfiguration to Zielonka’s Asynchronous Automata 

      Lehaut, Mathieu; Piterman, Nir (Electronic Proceedings in Theoretical Computer Science, EPTCS, 88-102, 2024)
      We study an extension of Zielonka’s (fixed) asynchronous automata called reconfigurable asynchronous automata where processes can dynamically change who they communicate with. We show that reconfigurable asynchronous ...
    • Distribution of Reconfiguration Languages maintaining Tree-like Communication Topology 

      Hausmann, Daniel; Lehaut, Mathieu; Piterman, Nir (2024)
      We study how to distribute trace languages in a setting where processes communicate via reconfigurable communication channels. That is, the different processes can connect and disconnect from channels at run time. We ...
    • Faster and Smaller Solutions of Obliging Games 

      Hausmann, Daniel; Piterman, Nir (35th International Conference on Concurrency Theory (CONCUR 2024), 2024)
      Obliging games have been introduced in the context of the game perspective on reactive synthesis in order to enforce a degree of cooperation between the to-be-synthesized system and the environment. Previous approaches to ...