Distributed synthesis for regular and contextfree specifications
From MaRDI portal
Publication:2249664
DOI10.1007/s00236-014-0194-xzbMath1360.68587OpenAlexW1996067700MaRDI QIDQ2249664
Bernd Puchala, Wladimir Fridman
Publication date: 3 July 2014
Published in: Acta Informatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00236-014-0194-x
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Specification and verification (program logics, model checking, etc.) (68Q60)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- \(\omega\)-computations on deterministic pushdown machines
- Concurrent reachability games
- Distributed Synthesis for Regular and Contextfree Specifications
- Church's Problem Revisited
- Automated Technology for Verification and Analysis
- Solving Sequential Conditions by Finite-State Strategies
- Topological properties of omega context-free languages
This page was built for publication: Distributed synthesis for regular and contextfree specifications