Difference between revisions of "EECI 2013: Synthesis of Reactive Control Protocols"

From MurrayWiki
Jump to: navigation, search
(Further Reading)
(Further Reading)
Line 9: Line 9:
  
 
== Further Reading ==
 
== Further Reading ==
* <p>[http://portal.acm.org/citation.cfm?id=101990 On the development of reactive systems], D. Harel and A. Pnueli,
+
* <p>[http://portal.acm.org/citation.cfm?id=101990 On the development of reactive systems], D. Harel and A. Pnueli </p>
 
* <p>[http://ysaar.net/data/synth.pdf Synthesis of Reactive(1) Designs.], Nir Priterman, Amir Pnueli, and Yaniv Sa'ar.  
 
* <p>[http://ysaar.net/data/synth.pdf Synthesis of Reactive(1) Designs.], Nir Priterman, Amir Pnueli, and Yaniv Sa'ar.  
In Proc. 7th International Conference on Verification, Model Checking and Abstract Interpretation, volume 3855 of Lecture Notes in Computer Science, pages 364-380, 2006.
+
In Proc. 7th International Conference on Verification, Model Checking and Abstract Interpretation, volume 3855 of Lecture Notes in Computer Science, pages 364-380, 2006.</p>

Revision as of 08:04, 21 March 2013

Prev: Algorithmic Verification Course home Next: Computer Session: TuLiP

This lecture discusses planner synthesis from LTL specification. In particular, we focus on systems that maintain an ongoing interaction with their environment. For the system to be correct, the planner needs to ensure that the specification holds for all the possible behaviors of the environment. This "reactive" system synthesis problem originates from Church's problem formulated in 1965 and can be viewed as a two-person game between the system and the environment. In general, the complexity of reactive system synthesis problem is double exponential. However, for certain special cases, the problem can be solved in polynomial time. We discuss those special cases, with the emphasis on the case where the problem can be formulated as a Generalized Reactivity(1) game.

Lecture Materials

Further Reading

In Proc. 7th International Conference on Verification, Model Checking and Abstract Interpretation, volume 3855 of Lecture Notes in Computer Science, pages 364-380, 2006.