scientific article; zbMATH DE number 7278102
From MaRDI portal
Publication:5136322
DOI10.4230/LIPIcs.FSTTCS.2017.30zbMath1491.68123arXiv1601.05176MaRDI QIDQ5136322
Publication date: 25 November 2020
Full work available at URL: https://arxiv.org/abs/1601.05176
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Formal languages and automata (68Q45) Synthesis problems (93B50) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Related Items
Distributed Asynchronous Games With Causal Memory are Undecidable ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Efficient Trace Encodings of Bounded Synthesis for Asynchronous Distributed Systems ⋮ Synthesis in presence of dynamic links
Cites Work
- Unnamed Item
- Distributed synthesis for acyclic architectures
- Automated Synthesis of Distributed Controllers
- Notes on finite asynchronous automata
- Asynchronous Games over Tree Architectures
- FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
- Automated Technology for Verification and Analysis
- FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science