Natural Specifications Yield Decidability for Distributed Synthesis of Asynchronous Systems
From MaRDI portal
Publication:3599069
DOI10.1007/978-3-540-95891-8_16zbMath1206.68210OpenAlexW1546061844MaRDI QIDQ3599069
Nathalie Sznajder, Thomas Chatain, Paul Gastin
Publication date: 3 February 2009
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-95891-8_16
Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Local Temporal Logic Is Expressively Complete for Cograph Dependence Alphabets
- Synthesis of Asynchronous Systems
- Church's Problem Revisited
- FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
- Distributed Synthesis for Well-Connected Architectures
- FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
- FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
This page was built for publication: Natural Specifications Yield Decidability for Distributed Synthesis of Asynchronous Systems