Automated Synthesis: a Distributed Viewpoint
From MaRDI portal
Publication:5136292
DOI10.4230/LIPIcs.FSTTCS.2017.3zbMath1491.68049OpenAlexW2789292511MaRDI QIDQ5136292
Publication date: 25 November 2020
Full work available at URL: http://dblp.uni-trier.de/db/conf/fsttcs/fsttcs2017.html#Muscholl17
Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Distributed systems (68M14) Distributed algorithms (68W15)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Negotiation as concurrency primitive
- Using partial orders for the efficient verification of deadlock freedom and safety properties
- A brief account of runtime verification
- Distributed synthesis for acyclic architectures
- Optimal Zielonka-Type Construction of Deterministic Asynchronous Automata
- Notes on finite asynchronous automata
- Church's Problem Revisited
- Runtime Verification Logics A Language Design Perspective
- Asynchronous Games over Tree Architectures
- Church’s Problem and a Tour through Automata Theory
- 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
This page was built for publication: Automated Synthesis: a Distributed Viewpoint
