Synthesis in presence of dynamic links

DOI10.1016/J.IC.2021.104856MaRDI QIDQ2105465zbMATH OpenOpenAlexFDO

Authors Benedikt Bollig, Patricia Bouyer, Matthias Függer, Nathalie Sznajder, Béatrice Bérard

Publication date 8 December 2022

Published in Information and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ic.2021.104856

zbMATH Keywords

game theorydistributed computingsynthesislinear-time temporal logicdynamic links

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Recommendations

• scientific article; zbMATH DE number 7455739
• Fair synthesis for asynchronous distributed systems
• Distributed synthesis for well-connected architectures
• Distributed Synthesis for Well-Connected Architectures
• Distributed synthesis for acyclic architectures

Cites work

• scientific article; zbMATH DE number 996442 (Why is no real title available?)
• scientific article; zbMATH DE number 4085004 (Why is no real title available?)
• scientific article; zbMATH DE number 3492660 (Why is no real title available?)
• scientific article; zbMATH DE number 1142314 (Why is no real title available?)
• scientific article; zbMATH DE number 1444727 (Why is no real title available?)
• scientific article; zbMATH DE number 3328724 (Why is no real title available?)
• A characterization of oblivious message adversaries for which consensus is solvable
• Approximate consensus in highly dynamic networks: the role of averaging algorithms
• Asynchronous Games over Tree Architectures
• Automata on infinite trees
• Bounds on the size and transmission rate of communications protocols
• CONCUR 2005 – Concurrency Theory
• Church synthesis problem for noisy input
• Church's Problem Revisited
• Distributed computation in dynamic networks
• Distributed synthesis for well-connected architectures
• FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
• FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
• FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
• Hierarchical information and the synthesis of distributed strategies
• Infinite games on finitely coloured graphs with applications to automata on infinite trees
• On the control of asynchronous automata
• On the synthesis of strategies in infinite games
• Reasoning about infinite computations
• Synthesis of fault-tolerant distributed systems
• The Byzantine Generals Problem
• The Heard-Of model: computing in distributed systems with benign faults
• The temporal semantics of concurrent programs

Cited in

(5)

• scientific article; zbMATH DE number 1956544 (Why is no real title available?)
• Foundations of Software Science and Computation Structures
• Synthesis with Identifiers
• MIXED LINKS: A METHOD FOR GENERATING MULTI-STRANDED STRUCTURES IN SYNTAX
• scientific article; zbMATH DE number 7455739 (Why is no real title available?)

This page was built for publication: Synthesis in presence of dynamic links

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2105465)