Distributed Asynchronous Games With Causal Memory are Undecidable

10/27/2021
by   Hugo Gimbert, et al.
0

We show the undecidability of the controller synthesis problem when both the plant and the controllers are asynchronous automata and the controllers have causal memory

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/01/2019

Translating Asynchronous Games for Distributed Synthesis (Full Version)

In distributed synthesis, we generate a set of process implementations t...
research
06/04/2023

Towards Efficient Controller Synthesis Techniques for Logical LTL Games

Two-player games are a fruitful way to represent and reason about severa...
research
07/20/2021

Global Winning Conditions in Synthesis of Distributed Systems with Causal Memory

In the synthesis of distributed systems, we automate the development of ...
research
04/22/2020

Efficient Trace Encodings of Bounded Synthesis for Asynchronous Distributed Systems

The manual implementation of distributed systems is an error-prone task ...
research
07/26/2021

Development of a 3D Digital Twin of the Swalmen Tunnel in the Rijkswaterstaat Project

In an ongoing project, a cooperation between the TU/e and the Dutch Depa...
research
08/17/2018

Extending finite-memory determinacy by Boolean combination of winning conditions

We study finite-memory (FM) determinacy in games on finite graphs, a cen...
research
03/31/2022

Multi-Agent Spatial Predictive Control with Application to Drone Flocking (Extended Version)

We introduce the novel concept of Spatial Predictive Control (SPC) to so...

Please sign up or login with your details

Forgot password? Click here to reset