Roderick Bloem, Stefan J. Galler, Barbara Jobstmann, Nir Piterman, Amir Pnueli & Martin Weiglhofer (2007):
Interactive presentation: Automatic hardware synthesis from specifications: a case study.
In: 2007 Design, Automation and Test in Europe Conference and Exposition, DATE 2007, Nice, France, April 16-20, 2007,
pp. 1188–1193,
doi:10.1145/1266366.1266622.
Alonzo Church (1963):
Application of recursive arithmetic to the problem of circuit synthesis.
Edmund M. Clarke, Orna Grumberg, Somesh Jha, Yuan Lu & Helmut Veith (2000):
Counterexample-Guided Abstraction Refinement.
In: Computer Aided Verification, 12th International Conference, CAV 2000, Chicago, IL, USA, July 15-19, 2000, Proceedings,
pp. 154–169,
doi:10.1007/10722167_15.
Javier Esparza & Keijo Heljanko (2008):
Unfoldings - A Partial-Order Approach to Model Checking.
Monographs in Theoretical Computer Science. An EATCS Series.
Springer,
doi:10.1007/978-3-540-77426-6.
Bernd Finkbeiner (2015):
Bounded Synthesis for Petri Games.
In: Correct System Design - Symposium in Honor of Ernst-Rüdiger Olderog on the Occasion of His 60th Birthday, Oldenburg, Germany, September 8-9, 2015. Proceedings,
pp. 223–237,
doi:10.1007/978-3-319-23506-6_15.
Bernd Finkbeiner, Manuel Gieseking & Ernst-Rüdiger Olderog (2015):
Adam: Causality-Based Synthesis of Distributed Systems.
In: Computer Aided Verification - 27th International Conference, CAV 2015, San Francisco, CA, USA, July 18-24, 2015, Proceedings, Part I,
pp. 433–439,
doi:10.1007/978-3-319-21690-4_25.
Bernd Finkbeiner & Ernst-Rüdiger Olderog (2014):
Petri Games: Synthesis of Distributed Systems with Causal Memory.
In: Proceedings Fifth International Symposium on Games, Automata, Logics and Formal Verification, GandALF 2014, Verona, Italy, September 10-12, 2014.,
pp. 217–230,
doi:10.4204/EPTCS.161.19.
Bernd Finkbeiner & Ernst-Rüdiger Olderog (2017):
Petri games: Synthesis of distributed systems with causal memory.
Inf. Comput. 253,
pp. 181–203,
doi:10.1016/j.ic.2016.07.006.
Bernd Finkbeiner & Sven Schewe (2005):
Uniform Distributed Synthesis.
In: 20th IEEE Symposium on Logic in Computer Science (LICS 2005), 26-29 June 2005, Chicago, IL, USA, Proceedings,
pp. 321–330,
doi:10.1109/LICS.2005.53.
Bernd Finkbeiner & Sven Schewe (2013):
Bounded synthesis.
STTT 15(5-6),
pp. 519–539,
doi:10.1007/s10009-012-0228-z.
Orna Kupferman & Moshe Y. Vardi (2001):
Synthesizing Distributed Systems.
In: 16th Annual IEEE Symposium on Logic in Computer Science, Boston, Massachusetts, USA, June 16-19, 2001, Proceedings,
pp. 389–398,
doi:10.1109/LICS.2001.932514.
P. Madhusudan, P. S. Thiagarajan & Shaofa Yang (2005):
The MSO Theory of Connectedly Communicating Processes.
In: FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science, 25th International Conference, Hyderabad, India, December 15-18, 2005, Proceedings,
pp. 201–212,
doi:10.1007/11590156_16.
Ernst-Rüdiger Olderog (1991):
Nets, Terms and Formulas: Three Views of Concurrent Processes and Their Relationship.
Cambridge University Press,
doi:10.1017/CBO9780511526589.
Amir Pnueli & Roni Rosner (1989):
On the Synthesis of a Reactive Module.
In: Conference Record of the Sixteenth Annual ACM Symposium on Principles of Programming Languages, Austin, Texas, USA, January 11-13, 1989,
pp. 179–190,
doi:10.1145/75277.75293.
Amir Pnueli & Roni Rosner (1990):
Distributed Reactive Systems Are Hard to Synthesize.
In: 31st Annual Symposium on Foundations of Computer Science, St. Louis, Missouri, USA, October 22-24, 1990, Volume II,
pp. 746–757,
doi:10.1109/FSCS.1990.89597.