Semi-automatic distributed synthesis

International Journal of Foundations of Computer Science

Volumn 18, Issue 1, 2007, Pages 113-138

  Schewe, Sven ^a   Finkbeiner, Bernd ^a  

^a SAARLAND UNIVERSITY   (Germany)

Author keywords

Concurrency; Realizability; Synthesis; Temporal logic

Indexed keywords

EID: 33846960805     PISSN: 01290541     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0129054107004590     Document Type: Conference Paper

References (15)

1. Pnueli, A., Rosner, R.: Distributed reactive systems are hard to synthesize. In: Proc. FOCS. (1990) 746-757
2. Kupferman, O., Vardi, M.Y.: Synthesizing distributed systems. In: IEEE Symposium on Logic in Computer Science. (2001)
3. Finkbeiner, B., Schewe, S.: Uniform distributed synthesis. In: Proc. LICS, IEEE Computer Society Press (2005) 321-330
4. Clarke, E.M., Emerson, E.A.: Design and synthesis of synchronization skeletons using branching time temporal logic. In: Proc. IBM Workshop on Logics of Programs. Volume 131 of LNCS., Springer-Verlag (1981) 52-71
5. Wolper, P.: Synthesis of Communicating Processes from Temporal-Logic Specifications. PhD thesis, Stanford University (1982)
6. Kupferman, O., Vardi, M.Y.: Synthesis with incomplete informatio. In: Proc. 2nd International Conference on Temporal Logic (ICTL'97). (1997)
7. Kupferman, O., Vardi, M.Y.: μ-calculus synthesis. In: Proc. MFCS. Volume 1893 of LNCS., Springer-Verlag (2000) 497-507
8. Kupferman, O., Madhusudan, P., Thiagarajan, P., Vardi, M.Y.: Open systems in reactive environments: Control and synthesis. In: Proc. 11th Int. Conf. on Concurrency Theory. Volume 1877 of LNCS., Springer-Verlag (2000) 92-107
9. Kupferman, O., Vardi, M.Y.: Church's problem revisited. The bulletin of Symbolic Logic 5 (1999) 245-263
10. Muller, D.E., Schupp, P.E.: Alternating automata on infinite trees. Theor. Comput. Sci. 54 (1987) 267-276
11. Muller, D.E., Schupp, P.E.: Simulating alternating tree automata by nondeterministic automata: new results and new proofs of the theorems of Rabin, McNaughton and Safra. Theor. Comput. Sci. 141 (1995) 69-107
12. Jurdziński, M.: Small progress measures for solving parity games. In: Proc. STACS. Volume 1770 of LNCS., Springer-Verlag (2000) 290-301
13. de Roever, W.P., Langmaack, H., Pnueli, A., eds.: Compositionality: The Significant Difference. COMPOS'97. Volume 1536 of LNCS., Springer Verlag (1998)
14. Maier, P.: A Lattice-Theoretic Framework For Circular Assume-Guarantee Reasoning. PhD thesis, Universität des Saarlandes, Saarbrücken (2003)
15. Emerson, E.A., Jutla, C.S.: Tree automata, μ-calculus and determinacy. In: Proc. FOCS, IEEE Computer Society Press (1991) 368-377