Asynchronous Games over Tree Architectures

Genest, Blaise; Gimbert, Hugo; Muscholl, Anca; Walukiewicz, Igor

doi:10.1007/978-3-642-39212-2_26

Cited by 29 publications

(28 citation statements)

References 24 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Our framework may carry over to Zielonka's asynchronous automata [19] with binary actions. These automata have been considered in [9] over tree architectures to get decidability of the controller-synthesis problem. This also raises the question about a parameterized formulation of the control problem.…”

Section: Resultsmentioning

confidence: 99%

Logic for communicating automata with parameterized topology

Bollig

2014

Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Nin

View full text Add to dashboard Cite

Abstract. Communicating automata (CA) are a fundamental model of systems where a fixed finite number of processes communicate via message exchange through FIFO channels. In this paper, we introduce a parameterized version of CA (PCA). The parameter is the underlying communication topology, in which processes are linked via interfaces and arranged as graphs of bounded degree such as ranked trees, grids, rings, or pipelines. A given PCA can be run on any such topology. We provide Büchi-Elgot-Trakhtenbrot theorems for PCA, continuing the logical study that has established characterizations of classical CA in terms of (fragments of) monadic second-order (MSO) logic. In particular, we give translations of existential MSO logic to PCA that are correct for large and natural classes of topologies. Our main result relies on a locality theorem for first-order logic due to Schwentick and Barthelmann, and it uses, as a black-box, a construction by Genest, Kuske, and Muscholl from the non-parameterized case.

show abstract

Section: Resultsmentioning

confidence: 99%

Logic for communicating automata with parameterized topology

Bollig

2014

Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Nin

View full text Add to dashboard Cite

show abstract

“…Alternatively, a distributed formulation of Church's problem can be formulated in Ramadge and Wonham's supervisory control setting. This problem, when plants and controllers are Zielonka automata, has been considered in [14,29,17,34]. In this formulation, local controllers exchange information when synchronizing on shared actions.…”

Section: Related Workmentioning

confidence: 99%

Automated Synthesis of Distributed Controllers

Muscholl

2015

Automata, Languages, and Programming

Self Cite

View full text Add to dashboard Cite

Abstract. Synthesis is a particularly challenging problem for concurrent programs. At the same time it is a very promising approach, since concurrent programs are difficult to get right, or to analyze with traditional verification techniques. This paper gives an introduction to distributed synthesis in the setting of Mazurkiewicz traces, and its applications to decentralized runtime monitoring. ContextModern computing systems are increasingly distributed and heterogeneous. Software needs to be able to exploit these advances, providing means for applications to be more performant. Traditional concurrent programming paradigms, as in Java, are based on threads, shared-memory, and locking mechanisms that guard access to common data. More recent paradigms like the reactive programming model of Erlang [4] and Scala [35,36] replace shared memory by asynchronous message passing, where sending a message is non-blocking.In all these concurrent frameworks, writing reliable software is a serious challenge. Programmers tend to think about code mostly in a sequential way, and it is hard to grasp all possible schedulings of events in a concurrent execution. For similar reasons, verification and analysis of concurrent programs is a difficult task. Testing, which is still the main method for error detection in software, has low coverage for concurrent programs. The reason is that bugs in such programs are difficult to reproduce: they may happen under very specific thread schedules and the likelihood of taking such corner-case schedules is very low. Automated verification, such as model-checking and other traditional exploration techniques, can handle very limited instances of concurrent programs, mostly because of the very large number of possible states and of possible interleavings of executions.Formal analysis of programs requires as a pre-requisite a clean mathematical model for programs. Verification of sequential programs starts usually with an abstraction step -reducing the value domains of variables to finite domains, viewing conditional branching as non-determinism, etc. Another major simplification consists in disallowing recursion. This leads to a very robust computational model, namely finite-state automata and regular languages. Regular languages of words (and trees) are particularly well understood notions. The deep connections between logic and automata revealed by the foundational work of Büchi, Rabin, and others, are the main ingredients in automata-based verification.

show abstract

“…Causal knowledge. This notion is related to partial order semantics [10], and has been used informally in distributed games [4,15,6]. However, as far as we know, it has not been used in an epistemic framework before.…”

Section: Definitionmentioning

confidence: 99%

Knowledge = Observation + Memory + Computation

Genest

Peled

Schewe

2015

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

International audienceWe compare three notions of knowledge in concurrent system: mem-oryless knowledge, knowledge of perfect recall, and causal knowledge. Mem-oryless knowledge is based only on the current state of a process, knowledge of perfect recall can take into account the local history of a process, and causal knowledge depends on the causal past of a process, which comprises the information a process can obtain when all processes exchange the information they have when performing joint transitions. We compare these notions in terms of knowledge strength, number of bits required to store this information, and the complexity of checking if a given process has a given knowledge. We show that all three notions of knowledge can be implemented using finite memory. Causal knowledge proves to be strictly more powerful than knowledge with perfect recall , which in turn proves to be strictly more powerful than memoryless knowledge. We show that keeping track of causal knowledge is cheaper than keeping track of knowledge of perfect recall

show abstract

Asynchronous Games over Tree Architectures

Cited by 29 publications

References 24 publications

Logic for communicating automata with parameterized topology

Logic for communicating automata with parameterized topology

Automated Synthesis of Distributed Controllers

Knowledge = Observation + Memory + Computation

Contact Info

Product

Resources

About