https://murray.cds.caltech.edu/api.php?action=feedcontributions&user=Utopcu&feedformat=atomMurray Wiki - User contributions [en]2021-12-04T02:13:27ZUser contributionsMediaWiki 1.35.3https://murray.cds.caltech.edu/index.php?title=EECI_2013:_Computer_Session:_TuLiP&diff=15634EECI 2013: Computer Session: TuLiP2013-03-20T19:59:18Z<p>Utopcu: /* Lecture Materials */</p>
<hr />
<div>{{eeci-sp12 header|prev=RHTLP|next=Advanced Topcis}}<br />
<br />
This lecture provides an overview of TuLiP, a Python-based software toolbox for the synthesis of embedded control software that is provably correct with respect to a GR[1] specifications. TuLiP combines routines for (1) finite state abstraction of control systems, (2) digital design synthesis from GR[1] specifications, and (3) receding horizon planning. The underlying digital design synthesis routine treats the environment as adversary; hence, the resulting controller is guaranteed to be correct for any admissible environment profile. TuLiP applies the receding horizon framework, allowing the synthesis problem to be broken into a set of smaller problems, and consequently alleviating the computational complexity of the synthesis procedure, while preserving the correctness guarantee.<br />
<br />
A brief overview of TuLiP will be followed by hands-on exercises using the toolbox. <br />
<br />
<br />
== Lecture Materials ==<br />
* Lecture slides: [http://www.cds.caltech.edu/~utopcu/eeci13/C2_TuLiP-2013.pdf TuLiP]<br />
* MATLAB plotting: [http://www.cds.caltech.edu/~murray/courses/eeci-sp12/plotRobotSim.m plotRobotSim.m], [http://www.cds.caltech.edu/~murray/courses/eeci-sp12/plotCarSim.m plotCarSim.m]<br />
* [http://www.cds.caltech.edu/~murray/courses/eeci-sp12/tulip_examples.zip Example TuLiP files] (zip file): <br />
** 6 cell robot, discrete state space: [http://www.cds.caltech.edu/~murray/courses/eeci-sp12/robot_discrete_simple.py robot_discrete_simple.py]<br />
** 6 cell robot, with dynamics: [http://www.cds.caltech.edu/~murray/courses/eeci-sp12/robot_simple.py robot_simple.py], [http://www.cds.caltech.edu/~murray/courses/eeci-sp12/robot_simple2.py robot_simple2.py] (alternative formulation)<br />
<br />
== Further Reading ==<br />
<br />
* <p>[http://www.cds.caltech.edu/~murray/papers/2010n_wtoxm11-hscc.html TuLiP: A Software Toolbox for Receding Horizon Temporal Logic Planning], T. Wongpiromsarn, U. Topcu, N. Ozay, H. Xu and R. M. Murray, Hybrid Systems: Computation and Control, 2011. </p><br />
<br />
== Additional Information ==<br />
* <p>[http://sourceforge.net/apps/mediawiki/tulip-control/index.php?title=Main_Page TuLiP on SourceForge] </p><br />
* <p>[http://tulip-control.sourceforge.net/doc/ TuLiP Documentation] and [http://tulip-control.sourceforge.net/doc/install.html Installation instructions] </p><br />
* <p>[http://jtlv.ysaar.net/ JTLV Project Home Site] JTLV provides the framework for the underlying digital design synthesis routine used in TuLiP. </p></div>Utopcuhttps://murray.cds.caltech.edu/index.php?title=EECI_2013:_Computer_Session:_TuLiP&diff=15633EECI 2013: Computer Session: TuLiP2013-03-20T19:59:04Z<p>Utopcu: </p>
<hr />
<div>{{eeci-sp12 header|prev=RHTLP|next=Advanced Topcis}}<br />
<br />
This lecture provides an overview of TuLiP, a Python-based software toolbox for the synthesis of embedded control software that is provably correct with respect to a GR[1] specifications. TuLiP combines routines for (1) finite state abstraction of control systems, (2) digital design synthesis from GR[1] specifications, and (3) receding horizon planning. The underlying digital design synthesis routine treats the environment as adversary; hence, the resulting controller is guaranteed to be correct for any admissible environment profile. TuLiP applies the receding horizon framework, allowing the synthesis problem to be broken into a set of smaller problems, and consequently alleviating the computational complexity of the synthesis procedure, while preserving the correctness guarantee.<br />
<br />
A brief overview of TuLiP will be followed by hands-on exercises using the toolbox. <br />
<br />
<br />
== Lecture Materials ==<br />
* Lecture slides: [http://www.cds.caltech.edu/~utopcu/eeci13/C2_TuLiP-2013.pdf TuLiP] (Exercises are at the end of the slides.)<br />
* MATLAB plotting: [http://www.cds.caltech.edu/~murray/courses/eeci-sp12/plotRobotSim.m plotRobotSim.m], [http://www.cds.caltech.edu/~murray/courses/eeci-sp12/plotCarSim.m plotCarSim.m]<br />
* [http://www.cds.caltech.edu/~murray/courses/eeci-sp12/tulip_examples.zip Example TuLiP files] (zip file): <br />
** 6 cell robot, discrete state space: [http://www.cds.caltech.edu/~murray/courses/eeci-sp12/robot_discrete_simple.py robot_discrete_simple.py]<br />
** 6 cell robot, with dynamics: [http://www.cds.caltech.edu/~murray/courses/eeci-sp12/robot_simple.py robot_simple.py], [http://www.cds.caltech.edu/~murray/courses/eeci-sp12/robot_simple2.py robot_simple2.py] (alternative formulation)<br />
<br />
== Further Reading ==<br />
<br />
* <p>[http://www.cds.caltech.edu/~murray/papers/2010n_wtoxm11-hscc.html TuLiP: A Software Toolbox for Receding Horizon Temporal Logic Planning], T. Wongpiromsarn, U. Topcu, N. Ozay, H. Xu and R. M. Murray, Hybrid Systems: Computation and Control, 2011. </p><br />
<br />
== Additional Information ==<br />
* <p>[http://sourceforge.net/apps/mediawiki/tulip-control/index.php?title=Main_Page TuLiP on SourceForge] </p><br />
* <p>[http://tulip-control.sourceforge.net/doc/ TuLiP Documentation] and [http://tulip-control.sourceforge.net/doc/install.html Installation instructions] </p><br />
* <p>[http://jtlv.ysaar.net/ JTLV Project Home Site] JTLV provides the framework for the underlying digital design synthesis routine used in TuLiP. </p></div>Utopcuhttps://murray.cds.caltech.edu/index.php?title=EECI_2013:_Computer_Session:_TuLiP&diff=15632EECI 2013: Computer Session: TuLiP2013-03-20T19:58:20Z<p>Utopcu: </p>
<hr />
<div>{{eeci-sp12 header|prev=RHTLP|next=Advanced Topcis}}<br />
<br />
This lecture provides an overview of TuLiP, a Python-based software toolbox for the synthesis of embedded control software that is provably correct with respect to a GR[1] specifications. TuLiP combines routines for (1) finite state abstraction of control systems, (2) digital design synthesis from GR[1] specifications, and (3) receding horizon planning. The underlying digital design synthesis routine treats the environment as adversary; hence, the resulting controller is guaranteed to be correct for any admissible environment profile. TuLiP applies the receding horizon framework, allowing the synthesis problem to be broken into a set of smaller problems, and consequently alleviating the computational complexity of the synthesis procedure, while preserving the correctness guarantee.<br />
<br />
A brief overview of TuLiP will be followed by hands-on exercises using the toolbox. <br />
<br />
<br />
== Lecture Materials ==<br />
* Lecture slides: [http://www.cds.caltech.edu/~murray/courses/eeci-sp12/C2_tulip-17May12.pdf TuLiP] (Exercises are at the end of the slides.)<br />
* MATLAB plotting: [http://www.cds.caltech.edu/~murray/courses/eeci-sp12/plotRobotSim.m plotRobotSim.m], [http://www.cds.caltech.edu/~murray/courses/eeci-sp12/plotCarSim.m plotCarSim.m]<br />
* [http://www.cds.caltech.edu/~murray/courses/eeci-sp12/tulip_examples.zip Example TuLiP files] (zip file): <br />
** 6 cell robot, discrete state space: [http://www.cds.caltech.edu/~murray/courses/eeci-sp12/robot_discrete_simple.py robot_discrete_simple.py]<br />
** 6 cell robot, with dynamics: [http://www.cds.caltech.edu/~murray/courses/eeci-sp12/robot_simple.py robot_simple.py], [http://www.cds.caltech.edu/~murray/courses/eeci-sp12/robot_simple2.py robot_simple2.py] (alternative formulation)<br />
<br />
== Further Reading ==<br />
<br />
* <p>[http://www.cds.caltech.edu/~murray/papers/2010n_wtoxm11-hscc.html TuLiP: A Software Toolbox for Receding Horizon Temporal Logic Planning], T. Wongpiromsarn, U. Topcu, N. Ozay, H. Xu and R. M. Murray, Hybrid Systems: Computation and Control, 2011. </p><br />
<br />
== Additional Information ==<br />
* <p>[http://sourceforge.net/apps/mediawiki/tulip-control/index.php?title=Main_Page TuLiP on SourceForge] </p><br />
* <p>[http://tulip-control.sourceforge.net/doc/ TuLiP Documentation] and [http://tulip-control.sourceforge.net/doc/install.html Installation instructions] </p><br />
* <p>[http://jtlv.ysaar.net/ JTLV Project Home Site] JTLV provides the framework for the underlying digital design synthesis routine used in TuLiP. </p></div>Utopcuhttps://murray.cds.caltech.edu/index.php?title=EECI_2013:_Computer_Session:_TuLiP&diff=15631EECI 2013: Computer Session: TuLiP2013-03-20T19:57:38Z<p>Utopcu: Created page with "{{eeci-sp12 header|prev=Protocol Synthesis|next=RHTLP}} This lecture provides an overview of TuLiP, a Python-based software toolbox for the synthesis of embedded control soft..."</p>
<hr />
<div>{{eeci-sp12 header|prev=Protocol Synthesis|next=RHTLP}}<br />
<br />
This lecture provides an overview of TuLiP, a Python-based software toolbox for the synthesis of embedded control software that is provably correct with respect to a GR[1] specifications. TuLiP combines routines for (1) finite state abstraction of control systems, (2) digital design synthesis from GR[1] specifications, and (3) receding horizon planning. The underlying digital design synthesis routine treats the environment as adversary; hence, the resulting controller is guaranteed to be correct for any admissible environment profile. TuLiP applies the receding horizon framework, allowing the synthesis problem to be broken into a set of smaller problems, and consequently alleviating the computational complexity of the synthesis procedure, while preserving the correctness guarantee.<br />
<br />
A brief overview of TuLiP will be followed by hands-on exercises using the toolbox. <br />
<br />
<br />
== Lecture Materials ==<br />
* Lecture slides: [http://www.cds.caltech.edu/~murray/courses/eeci-sp12/C2_tulip-17May12.pdf TuLiP] (Exercises are at the end of the slides.)<br />
* MATLAB plotting: [http://www.cds.caltech.edu/~murray/courses/eeci-sp12/plotRobotSim.m plotRobotSim.m], [http://www.cds.caltech.edu/~murray/courses/eeci-sp12/plotCarSim.m plotCarSim.m]<br />
* [http://www.cds.caltech.edu/~murray/courses/eeci-sp12/tulip_examples.zip Example TuLiP files] (zip file): <br />
** 6 cell robot, discrete state space: [http://www.cds.caltech.edu/~murray/courses/eeci-sp12/robot_discrete_simple.py robot_discrete_simple.py]<br />
** 6 cell robot, with dynamics: [http://www.cds.caltech.edu/~murray/courses/eeci-sp12/robot_simple.py robot_simple.py], [http://www.cds.caltech.edu/~murray/courses/eeci-sp12/robot_simple2.py robot_simple2.py] (alternative formulation)<br />
<br />
== Further Reading ==<br />
<br />
* <p>[http://www.cds.caltech.edu/~murray/papers/2010n_wtoxm11-hscc.html TuLiP: A Software Toolbox for Receding Horizon Temporal Logic Planning], T. Wongpiromsarn, U. Topcu, N. Ozay, H. Xu and R. M. Murray, Hybrid Systems: Computation and Control, 2011. </p><br />
<br />
== Additional Information ==<br />
* <p>[http://sourceforge.net/apps/mediawiki/tulip-control/index.php?title=Main_Page TuLiP on SourceForge] </p><br />
* <p>[http://tulip-control.sourceforge.net/doc/ TuLiP Documentation] and [http://tulip-control.sourceforge.net/doc/install.html Installation instructions] </p><br />
* <p>[http://jtlv.ysaar.net/ JTLV Project Home Site] JTLV provides the framework for the underlying digital design synthesis routine used in TuLiP. </p></div>Utopcuhttps://murray.cds.caltech.edu/index.php?title=EECI_2013:_Algorithmic_Verification_of_Hybrid_Systems&diff=15630EECI 2013: Algorithmic Verification of Hybrid Systems2013-03-20T19:54:34Z<p>Utopcu: /* Further Reading */</p>
<hr />
<div>{{eeci-sp13 header|prev=Deductive Verification|next=Protocol Synthesis}}<br />
<br />
This lecture focuses on the verification of hybrid systems. We first discuss finite-state under- and over-approximations of hybrid dynamics and how these finite-state models coupled with the model checking tools can be used to verify temporal logic properties against hybrid dynamics. Then, we present a procedure for constructing finite-state, under-approximations which will later be used in the course in the synthesis of hierarchical control protocols. We finally introduce the notions of approximate bisimulations and bisimulation functions and how they can be used in verification of temporal properties.<br />
<br />
== Lecture Materials ==<br />
* Lecture slides: [http://www.cds.caltech.edu/~utopcu/eeci13/L6_Abstractions-2013.pdf Abstractions for the Analysis and Synthesis of Control Protocols for Hybrid Systems]<br />
<br />
== Further Reading ==<br />
* <p> [http://robotics.eecs.berkeley.edu/~sastry/ee291e/lygeros.pdf Lecture Notes on Hybrid Systems] (by John Lygeros): A rough introduction to hybrid systems. Chapters 5 and 6 are on various analysis techniques relevant for this short course. </p><br />
* <p>[http://www.cds.caltech.edu/~utopcu/images//4/4d/WTM-itac10R.pdf Receding horizon temporal logic planning],T. Wongpiromsarn, U. Topcu, and R. Murray, submitted to IEEE Transactions on Automatic Control, 2010. Details on the receding horizon temporal logic planning. </p> <br />
* <p> [http://www.cds.caltech.edu/~murray/wiki/index.php/EECI08:_Optimization-Based_Control Optimization based control]. A page prepared for EECI 2008 with information and material on basic receding horizon control.</p><br />
* <p>[http://control.ee.ethz.ch/~mpt/ Multiparametric Toolbox] The Multi-Parametric Toolbox (MPT) is a free Matlab toolbox for design, analysis and deployment of optimal controllers for constrained linear, nonlinear and hybrid systems. [http://www.cds.caltech.edu/tulip The receding horizon temporal logic planning toolbox] uses the polytope manipulation (intersection, union, set difference, projection, etc.) functionalities of MPT. </p><br />
* <p>[http://www.cds.caltech.edu/~utopcu/images//9/98/WTM-aaai10.pdf Automatic synthesis of robust embedded control software], T. Wongpiromsarn, U. Topcu, and R. Murray, AAAI 2010 Spring Symposium on Embedded Reasoning: Intelligence in Embedded Systems, 2010. Details on the abstraction procedure covered in this lecture. </p><br />
*<p> [http://www.mpc.berkeley.edu/mpc-course-material/BBMbook_Cambridge.pdf?attredirects=0&d=1 Predictive Control]: A book draft by Bemporap, Borrelli, and Morari. Details on some of the ideas in the implementation of the abstraction procedure presented in the slides can be found in this book. </p><br />
*<p> [http://www.mpc.berkeley.edu/mpc-course-material/BBMbook_Cambridge.pdf?attredirects=0&d=1 Predictive Control]: A book draft by Bemporap, Borrelli, and Morari. Details on some of the ideas in the implementation of the abstraction procedure presented in the slides can be found in this book. </p><br />
* <p>[http://www.cds.caltech.edu/~utopcu/eeci13/ltom-12-cdc.pdf Reactive controllers for differentially flat systems with temporal logic constraints], J. Liu, N. Ozay, U. Topcu, and R. Murray, Control and Decision Conference, 2012. </p></div>Utopcuhttps://murray.cds.caltech.edu/index.php?title=EECI_2013:_Receding_Horizon_Temporal_Logic_Planning&diff=15615EECI 2013: Receding Horizon Temporal Logic Planning2013-03-16T09:24:16Z<p>Utopcu: </p>
<hr />
<div>{{eeci-sp13 header|prev=Synthesis of Reactive Control Protocols|next=Computer Session: TuliP}}<br />
<br />
The first part of this lecture introduces the receding horizon temporal logic planning. Introductory material on high computational complexity of reactive control protocol synthesis is followed by the statement and discussion of a main result and a small example. We discuss implementation details, further extensions, and a hierarchical control structure that utilizes the proposed receding horizon temporal logic planning procedure. <br />
<br />
== Lecture Materials ==<br />
* Lecture slides: [http://www.cds.caltech.edu/~utopcu/eeci13/L8_RHTLP-2013.pdf Receding Horizon Temporal Logic Planning and Compositional Synthesis]<br />
<br />
== Further Reading and Additional Information ==<br />
* <p>[http://www.cds.caltech.edu/~utopcu/images//4/4d/WTM-itac10R.pdf Receding horizon temporal logic planning],T. Wongpiromsarn, U. Topcu, and R. Murray, submitted to IEEE Transactions on Automatic Control, 2012. Details on the receding horizon temporal logic planning. </p></div>Utopcuhttps://murray.cds.caltech.edu/index.php?title=EECI_2013:_Receding_Horizon_Temporal_Logic_Planning&diff=15614EECI 2013: Receding Horizon Temporal Logic Planning2013-03-16T09:23:38Z<p>Utopcu: </p>
<hr />
<div>{{eeci-sp13 header|prev=Computer Session: TuLiP|next=Computer Session: TuliP}}<br />
<br />
The first part of this lecture introduces the receding horizon temporal logic planning. Introductory material on high computational complexity of reactive control protocol synthesis is followed by the statement and discussion of a main result and a small example. We discuss implementation details, further extensions, and a hierarchical control structure that utilizes the proposed receding horizon temporal logic planning procedure. <br />
<br />
== Lecture Materials ==<br />
* Lecture slides: [http://www.cds.caltech.edu/~utopcu/eeci13/L8_RHTLP-2013.pdf Receding Horizon Temporal Logic Planning and Compositional Synthesis]<br />
<br />
== Further Reading and Additional Information ==<br />
* <p>[http://www.cds.caltech.edu/~utopcu/images//4/4d/WTM-itac10R.pdf Receding horizon temporal logic planning],T. Wongpiromsarn, U. Topcu, and R. Murray, submitted to IEEE Transactions on Automatic Control, 2012. Details on the receding horizon temporal logic planning. </p></div>Utopcuhttps://murray.cds.caltech.edu/index.php?title=EECI_2013:_Receding_Horizon_Temporal_Logic_Planning&diff=15613EECI 2013: Receding Horizon Temporal Logic Planning2013-03-16T09:23:16Z<p>Utopcu: Created page with "{{eeci-sp13 header|prev=Computer Session: TuLiP|next=Computer Session}} The first part of this lecture introduces the receding horizon temporal logic planning. Introductory m..."</p>
<hr />
<div>{{eeci-sp13 header|prev=Computer Session: TuLiP|next=Computer Session}}<br />
<br />
The first part of this lecture introduces the receding horizon temporal logic planning. Introductory material on high computational complexity of reactive control protocol synthesis is followed by the statement and discussion of a main result and a small example. We discuss implementation details, further extensions, and a hierarchical control structure that utilizes the proposed receding horizon temporal logic planning procedure. <br />
<br />
== Lecture Materials ==<br />
* Lecture slides: [http://www.cds.caltech.edu/~utopcu/eeci13/L8_RHTLP-2013.pdf Receding Horizon Temporal Logic Planning and Compositional Synthesis]<br />
<br />
== Further Reading and Additional Information ==<br />
* <p>[http://www.cds.caltech.edu/~utopcu/images//4/4d/WTM-itac10R.pdf Receding horizon temporal logic planning],T. Wongpiromsarn, U. Topcu, and R. Murray, submitted to IEEE Transactions on Automatic Control, 2012. Details on the receding horizon temporal logic planning. </p></div>Utopcuhttps://murray.cds.caltech.edu/index.php?title=HYCON-EECI,_Spring_2013&diff=15612HYCON-EECI, Spring 20132013-03-16T09:19:38Z<p>Utopcu: /* Lecture Schedule */</p>
<hr />
<div><table width="100%" cellspacing=0><br />
<tr valign=top><br />
<td rowspan=4 align=center> [[Image:eecilogo.png|90px]]</td><br />
<td align=center><font color='blue' size='+2'>Specification, Design, and Verification <br> &nbsp;</font></td><br />
<td rowspan=4 align=center"> [[Image:cdslogo.png|90px]]</td></tr><br />
<tr><td align=center><font color='blue' size='+2'>of Networked Control Systems<br> &nbsp; </font></td></tr><br />
<tr valign=top><td align=center><font color='blue' size='+0'><p> Richard M. Murray, Ufuk Topcu, and Nok Wongpiromsarn </p></font></td></tr><br />
<tr valign=top><td align=center><font color='blue' size='+0'><p>18-22 May 2013, Belgrade (Serbia)</p></font></td></tr><br />
</table> __NOTOC__<br />
<br />
== Course Description ==<br />
Increases in fast and inexpensive computing and communications have enabled a new generation of information-rich control systems that rely on multi-threaded networked execution, distributed optimization, sensor fusion and protocol stacks in increasingly sophisticated ways. This course will provide working knowledge of a collection of methods and tools for specifying, designing and verifying networked control systems. We combine methods from computer science (temporal logic, model checking, synthesis of control protocols) with those from dynamical systems and control (Lyapunov functions, trajectory generation, receding horizon control) to analyze and design partially asynchronous control protocols for continuous systems. In addition to introducing the mathematical techniques required to formulate problems and prove properties, we also describe a software toolbox (TuLiP) that is designed for analyzing and synthesizing hybrid control systems using linear temporal logic and robust performance specifications.<br />
<br />
== Reading ==<br />
The following papers and textbooks will be used heavily throughout the course:<br />
* <p>[http://mitpress.mit.edu/catalog/item/default.asp?ttype=2&tid=11481 Principles of Model Checking], C. Baier and J.-P. Katoen, The MIT Press, 2008. </p><br />
* <p>[http://www.cds.caltech.edu/~murray/papers/2012z_wtm12-us.html Synthesis of Control Protocols for Autonomous Systems], N. Wongpiromsarn, U. Topcu and R. M. Murray. ''Unmanned Systems'', 2013 (submitted)<br />
Additional references for individual topics are included on the individual lecture pages.<br />
<br />
== Course information ==<br />
* Instructors: [http://www.cds.caltech.edu/~murray/wiki/Main_Page Richard M. Murray] (Caltech, CDS) and [http://www.cds.caltech.edu/~utopcu/index.php/Main_Page Ufuk Topcu] (Caltech, CDS), and [http://www.cds.caltech.edu/~nok/ Nok Wongpiromsarn] (MIT-Singapore)<br />
* Date and location: 18-22 May 2013, Belgrade (Serbia)<br />
* Sponsor: [http://www.eeci-institute.eu/GSC2013 HYCON-EECI Graduate School on Control]<br />
<br />
== Lecture Schedule ==<br />
<br />
The schedule below lists the lectures that will be given as part of the course. Each lecture will last approximately 90 minutes. The individual lecture pages give an overview of the lecture and links to additional information.<br />
<br />
{|border=1 cellpadding=2<br />
|-<br />
|align=center|Lec<br />
|align=center|Date/time <br />
|Title <br />
|Topics<br />
{{eeci13 entry|L1|RM|Mon, 9:00|Introduction: Protocol-Based Control Systems|<br />
* Introduction to networked control systems (NCS)<br />
* Overview of control "protocols"<br />
* Examples: Alice, RoboFlag<br />
}}<br />
{{eeci13 entry|L2|UT|Mon, 11:00|Automata Theory|<br />
* Finite transition systems<br />
* Paths, traces and composition of finite transition systems<br />
* Linear time properties; safety and liveness<br />
* Examples: traffic light<br />
}}<br />
{{eeci13 entry|L3|RM|Mon, 14:00|Temporal Logic|<br />
* Linear temporal logic<br />
* Omega regular properties<br />
* Buchi automata, representation of LTL using NBA<br />
* Examples: traffic light, (RoboFlag), autonomous driving<br />
}}<br />
{{eeci13 entry|L4|UT|Mon, 16:00|Model Checking and Logic Synthesis|<br />
* Basic concepts in model checking<br />
* Use of model checking for logic synthesis<br />
* Examples: traffic light, farmer puzzle<br />
}}<br />
{{eeci13 entry|C1|RM|Tue, 9:00 <br> Tue, 11:00|Computer Session: Spin|<br />
* Introduction to Promela and Spin (statements, processes, messages)<br />
* Verification examples: traffic light, distributed traffic light, gcdrive<br />
* Synthesis examples: traffic light, farmer puzzle, robot navigation<br />
}}<br />
{{eeci13 entry|L5|RM (1h)|Wed, 9:00|Deductive Verification of Hybrid Systems|<br />
* Brief introduction to hybrid systems and verification techniques (deductive, algorithmic)<br />
* Deductive verification using barrier certificates<br />
* Guarded command languages and CCL for asynchronous control protocols<br />
* Examples: multi-agent systems, RoboFlag<br />
}}<br />
{{eeci13 entry|L6|UT (2h)|Wed, 11:00|Algorithmic Verification of Hybrid Systems|<br />
* Abstraction hierarchies for control systems<br />
* Finite state abstractions (discretization) and model checking<br />
* Discretization of continuous state systems<br />
* Approximate bi-simulation (if time)<br />
* Examples: gear changing (?), ???<br />
}}<br />
{{eeci13 entry|L7|RM (2h)|Wed, 14:00|Synthesis of Reactive Control Protocols|<br />
* Open system and reactive system synthesis<br />
* Satisfiability, realizability<br />
* Game structures, reachability/safety games<br />
* Mu-calculus (if time) and GR(1) games<br />
* Examples: runner-blocker<br />
}}<br />
{{eeci13 entry|L8|UT(1h)|Wed, 16:00|Receding Horizon Temporal Logic Planning|<br />
* Receding horizon control<br />
* Examples: reactive motion planning<br />
}}<br />
{{eeci13 entry|C2|UT|Thu, 9:00 <br> Thu, 11:00|Computer Session: TuLiP|<br />
* Introduction to TuLiP<br />
* Synthesis of protocols for discrete systems<br />
* Discretization of continuous systems (and protocol synthesis)<br />
* Examples: reactive motion planning<br />
}}<br />
{{eeci13 entry|L9|UT|Fri, 9:00|Advanced Topics in Protocol Synthesis|<br />
* Distributed control<br />
* Switching <br />
* Examples: reactive motion planning, electric power systems (distributed)<br />
}}<br />
{{eeci13 entry|L10|RM|Fri, 11:00|Extensions, Applications, Open Questions|<br />
* Review of control trends and course contents<br />
* Discussion of open problem areas and preliminary results<br />
** Optimization-based techniques<br />
** Probabilistic techniques<br />
** Others: Robustness, switching systems, timed systems<br />
* Examples: robot motion planning, electric power systems (timed)<br />
}}<br />
|}<br />
<br />
== Software Installation ==<br />
<br />
We will make use of two programs during the lab sessions:<br />
* [http://spinroot.com Spin] - model checker for formal verification of distributed systems<br />
* [http://tulip-control.sf.net TuLiP] - python-based toolbox for temporal logic planning and controller synthesis<br />
During the course, we will access these programs on a remote machine using ssh. For some parts of the course it will be useful to have a local installation of MATLAB that can be used for visualizing some simulation results.<br />
<br />
If you would like to install the software on your own, here are some basic directions for installing the two packages:<br />
* Spin: if you are using Windows, you can download a [http://spinroot.com/spin/Bin/index.html binary installation]. For Mac's, you need to compile from source. For this you will need a C compiler, such as the one that is part of the [https://developer.apple.com/technologies/tools/ Xcode developer toolbox]<br />
* TuLiP: you will need a python installation (2.6 or greater) with SciPy (0.9 or greater) installed. You might consider using the [http://enthought.com Enthought Python distribution]. Once you have scipy installed, you will need to install several other python packages, including cvxopt and yices. A [http://sourceforge.net/apps/mediawiki/tulip-control/index.php?title=Main_Page list of required package] is available on the TuLiP project page.<br />
<br />
[[Category:Courses]]<br />
[[Category:2012-13 Courses]]</div>Utopcuhttps://murray.cds.caltech.edu/index.php?title=EECI_2013:_Algorithmic_Verification_of_Hybrid_Systems&diff=15611EECI 2013: Algorithmic Verification of Hybrid Systems2013-03-16T09:11:56Z<p>Utopcu: Created page with "{{eeci-sp13 header|prev=Deductive Verification|next=Protocol Synthesis}} This lecture focuses on the verification of hybrid systems. We first discuss finite-state under- and ..."</p>
<hr />
<div>{{eeci-sp13 header|prev=Deductive Verification|next=Protocol Synthesis}}<br />
<br />
This lecture focuses on the verification of hybrid systems. We first discuss finite-state under- and over-approximations of hybrid dynamics and how these finite-state models coupled with the model checking tools can be used to verify temporal logic properties against hybrid dynamics. Then, we present a procedure for constructing finite-state, under-approximations which will later be used in the course in the synthesis of hierarchical control protocols. We finally introduce the notions of approximate bisimulations and bisimulation functions and how they can be used in verification of temporal properties.<br />
<br />
== Lecture Materials ==<br />
* Lecture slides: [http://www.cds.caltech.edu/~utopcu/eeci13/L6_Abstractions-2013.pdf Abstractions for the Analysis and Synthesis of Control Protocols for Hybrid Systems]<br />
<br />
== Further Reading ==<br />
* <p> [http://robotics.eecs.berkeley.edu/~sastry/ee291e/lygeros.pdf Lecture Notes on Hybrid Systems] (by John Lygeros): A rough introduction to hybrid systems. Chapters 5 and 6 are on various analysis techniques relevant for this short course. </p><br />
* <p>[http://www.cds.caltech.edu/~utopcu/images//4/4d/WTM-itac10R.pdf Receding horizon temporal logic planning],T. Wongpiromsarn, U. Topcu, and R. Murray, submitted to IEEE Transactions on Automatic Control, 2010. Details on the receding horizon temporal logic planning. </p> <br />
* <p> [http://www.cds.caltech.edu/~murray/wiki/index.php/EECI08:_Optimization-Based_Control Optimization based control]. A page prepared for EECI 2008 with information and material on basic receding horizon control.</p><br />
* <p>[http://control.ee.ethz.ch/~mpt/ Multiparametric Toolbox] The Multi-Parametric Toolbox (MPT) is a free Matlab toolbox for design, analysis and deployment of optimal controllers for constrained linear, nonlinear and hybrid systems. [http://www.cds.caltech.edu/tulip The receding horizon temporal logic planning toolbox] uses the polytope manipulation (intersection, union, set difference, projection, etc.) functionalities of MPT. </p><br />
* <p>[http://www.cds.caltech.edu/~utopcu/images//9/98/WTM-aaai10.pdf Automatic synthesis of robust embedded control software], T. Wongpiromsarn, U. Topcu, and R. Murray, AAAI 2010 Spring Symposium on Embedded Reasoning: Intelligence in Embedded Systems, 2010. Details on the abstraction procedure covered in this lecture. </p><br />
*<p> [http://www.mpc.berkeley.edu/mpc-course-material/BBMbook_Cambridge.pdf?attredirects=0&d=1 Predictive Control]: A book draft by Bemporap, Borrelli, and Morari. Details on some of the ideas in the implementation of the abstraction procedure presented in the slides can be found in this book. </p></div>Utopcuhttps://murray.cds.caltech.edu/index.php?title=EECI_2013:_Model_Checking&diff=15610EECI 2013: Model Checking2013-03-16T08:53:07Z<p>Utopcu: /* Lecture Materials */</p>
<hr />
<div>{{eeci-sp13 header|prev=Temporal Logic |next=Computer Session: Spin}}<br />
<br />
{{righttoc}}<br />
<br />
This lecture provides an introduction to automata based model checking and its use for closed system synthesis. We first discuss what model checking is, how it works (in particular how automata based model checking works), and how it is used for verification of linear temporal logic specifications against finite transition system models. We then move to its use for synthesizing (open-loop) control strategies. We also provide examples using the SPIN model checker (discussed in the [[EECI 2012: Computer Session: Spin|Spin]] lecture) and discuss the computational complexity of model checking. <br />
<br />
== Lecture Materials ==<br />
* Lecture slides: [http://www.cds.caltech.edu/~utopcu/eeci13/L4_model-checking-2013.pdf Model Checking and Logic Synthesis] (Presentation and notation follow that in "Model Checking" chapter 5.2 by Baier and Katoen.)<br />
<br />
== Further Reading ==<br />
* <p>[http://mitpress.mit.edu/catalog/item/default.asp?ttype=2&tid=11481 Principles of Model Checking], C. Baier and J.-P. Katoen, The MIT Press, 2008. A detailed reference on model checking. Slides for this lecture follow Chapter 6 of this reference. </p><br />
* <p>[http://www.amazon.com/Model-Checking-Edmund-Clarke-Jr/dp/0262032708/ref=sr_1_1?s=books&ie=UTF8&qid=1297071898&sr=1-1 Model Checking], E. M. Clarke, O. Grumberg and D. A. Peled, The MIT Press, 1999. A very good reference on automata based model checking. </p><br />
* <p>[http://portal.acm.org/citation.cfm?id=101990 On the development of reactive systems], D. Harel and A. Pnueli, Logics and models of concurrent systems, Springer-Verlag New York, Inc., 1985, pp. 477–498. For discussion about closed and open systems</p><br />
<br />
== Additional Information ==</div>Utopcuhttps://murray.cds.caltech.edu/index.php?title=EECI_2013:_Automata_Theory&diff=15609EECI 2013: Automata Theory2013-03-16T08:38:26Z<p>Utopcu: /* Lecture Materials */</p>
<hr />
<div>{{eeci-sp13 header|prev=Introduction |next=Temporal Logic}}<br />
<br />
This lecture gives an introduction to some concepts and tools in computer science that are used in the remainder of the course. We start with finite transition systems as a mathematical model to describe behavior of systems with finite, discrete states. We use linear-time properties serve as the specification language (e.g., to specify safety or liveness properties) and we discuss the preliminaries that lead to model checking, a commonly used, powerful verification tool.<br />
<br />
== Lecture Materials ==<br />
* Lecture slides: [http://www.cds.caltech.edu/~utopcu/eeci13/L2_automata-theory-2013.pdf Automata Theory] (presentation and notation follow that in "Principles of Model Checking" chapters 2.1, 2.2, 3.2-3.4 by Baier and Katoen.)<br />
<br />
== Further Reading ==<br />
* <p>[http://mitpress.mit.edu/catalog/item/default.asp?ttype=2&tid=11481 Principles of Model Checking], C. Baier and J.-P. Katoen, The MIT Press, 2008. A detailed reference on model checking. Early chapters provide an exposition to automata theory. Slides for this lecture follow this reference. </p> <br />
* <p>[http://www.amazon.com/Introduction-Theory-Computation-Michael-Sipser/dp/053494728X Introduction to the Theory of Computation], M. Sipser, PWS Publishing Company, 1997. This is a textbook on theory of computation covering preliminaries in automata theory. </p> <br />
* <p> [http://www.cds.caltech.edu/~utopcu/VerInCtrl/VerInCtrl.html CDS 270: Verification in Controls]: The second half of the course taught in Fall 2009 at Caltech also covered the material in this lecture. There are brief lecture notes and exercises.</div>Utopcuhttps://murray.cds.caltech.edu/index.php?title=Group_Schedule,_Summer_2012&diff=14256Group Schedule, Summer 20122012-06-08T04:35:43Z<p>Utopcu: /* Week 13: 10-14 September */</p>
<hr />
<div>This page contains information about various upcoming events that are of interest to the group. __NOTOC__<br />
{| width=60%<br />
|- valign=top<br />
| width=50% |<br />
* [http://www.cds.caltech.edu/~murray/calendar.html Richard's calendar (travel)]<br />
| width=50% |<br />
* [[Group Schedule, Spring 2012]]<br />
|}<br />
<br />
The schedule for group and subgroup meetings is given below. Everyone should sign up for times to talk in the subgroup meetings.<br />
<br />
{| width=100% border=1<br />
|- valign=top<br />
| width=30% |<br />
<br />
=== Week 1: 18-22 June ===<br />
<br />
'''Biocircuits: 21 Jun (Thu), 10 am - 12 pm'''<br />
* SURF introductions (40 min)<br />
* Ophelia (20-30 min)<br />
* Shaunak K (10-15 min)<br />
* Lab updates<br />
<br />
'''Group meeting: 21 Jun (Thu), 12-1'''<br />
* Richard (research overview)<br />
<br />
'''NCS/Robotics: 21 Jun (Thu), 4-6 pm'''<br />
* SURF introductions (20 min)<br />
* Eric (15-20 min)<br />
* Clemens (15-20 min)<br />
* Project updates<br />
<br />
<hr><br />
* Richard out of town Mon-Tue<br />
* SURF students start on Tue<br />
| width=30% |<br />
<br />
=== Week 2: 25-29 June ===<br />
* American Control Conference (Montreal)<br />
* Richard out of town all week<br />
| width=30% |<br />
<br />
=== Week 3: 2-6 July ===<br />
* Richard out of town all week<br />
* Institute holiday on Wed<br />
|- valign=top<br />
|<br />
<br />
=== Week 4: 9-13 July ===<br />
'''Biocircuits: 10 Jul (Tue), 10 am - 12 pm'''<br />
* <font color=blue>Meeting may shift to Mon, 10a-12p</font><br />
* Victoria (25-30 min)<br />
* Anu (10-15 min)<br />
* Jongmin (10-15 min)<br />
* Instrument: Microscope/CellASIC<br />
* Lab updates<br />
<br />
'''Group meeting: 13 Jul (Fri), 12-1:15'''<br />
* Tim Sullivan (Owhadi group)<br />
<br />
'''NCS/Robotics: 13 Jul (Fri), 1:15-3 pm'''<br />
* Stephanie (15-20 min)<br />
* Research update (15-20 min)<br />
* Research update (15-20 min)<br />
* Project updates<br />
<br />
<hr><br />
* Richard out of town Tue pm - Thu (Living Foundries PI meeting)<br />
|<br />
<br />
=== Week 5: 16-20 July ===<br />
'''Biocircuits: 17 Jul (Tue), 10 am - 12 pm'''<br />
* Anu (30-40 min)<br />
* Zach (10-15 min)<br />
* SURF: Vinay V (10-15 min)<br />
* SURF update (10-15 min)<br />
* Instrument: Computing<br />
* Lab updates<br />
<br />
'''NCS/Robotics: 18 Jul (Wed), 4-6 pm'''<br />
* Mumu (15-20 min)<br />
* Research update (15-20 min)<br />
* SURF update (10-15 min)<br />
* SURF update (10-15 min)<br />
* Project updates<br />
<br />
'''Group meeting: 19 Jul (Thu), 12-1:15'''<br />
* Chin-Lin Guo (BE)<br />
<hr><br />
* Shaunak K SURF presentation<br />
|<br />
<br />
=== Week 6: 23-27 July ===<br />
'''Biocircuits: 24 Jul (Tue), 10 am - 12 pm'''<br />
* Emzo (30-40 min)<br />
* Enoch (10-15 min)<br />
* SURF update (10-15 min)<br />
* SURF update (10-15 min)<br />
* Instrument: FACSCalibur/Quanta<br />
* Lab updates<br />
<br />
'''Group meeting: 25 Jul (Wed), 12-1:15'''<br />
* Open<br />
<br />
'''NCS/Robotics: 25 Jul (Wed), 4-6 pm'''<br />
* Pavithra (15-20 min)<br />
* Clemens (10-15 min)<br />
* SURF update (10-15 min)<br />
* SURF update (10-15 min)<br />
* Project updates<br />
<hr><br />
* Richard out of town Thu-Fri<br />
|- valign=top<br />
|<br />
<br />
=== Week 7: 30 July - 3 August ===<br />
'''Biocircuits: 31 Jul (Tue), 12-1:30 pm'''<br />
* <font color=blue>Lunch meeting; may shift to Thu</font><br />
* Research presentation (30-40 min)<br />
* SURF update (10-15 min)<br />
* SURF update (10-15 min)<br />
* Lab updates<br />
<br />
'''NCS/Robotics: 1 Aug (Wed), 12-1:30 pm'''<br />
* <font color=blue>Lunch meeting; may shift to Thu</font><br />
* Eric (15-20 min)<br />
* Ufuk (15-20 min)<br />
* Project updates<br />
<br />
<hr><br />
* KISS workshop; Richard unavailable<br />
|<br />
<br />
=== Week 8: 6-10 August ===<br />
'''Biocircuits: 7 Aug (Tue), 10 am - 12 pm'''<br />
* Dan (30-40 min)<br />
* Victoria (10-15 min)<br />
* Marcella (10-15 min)<br />
* Instrument: Victor X3/BioTek H1MF<br />
* Lab updates<br />
<br />
'''Group meeting: 8 Aug (Wed), 12-1:15'''<br />
* Open<br />
<br />
'''NCS/Robotics: 8 Aug (Wed), 4-6 pm'''<br />
* Research update (15-20 min)<br />
* Research update (15-20 min)<br />
* Research update (15-20 min)<br />
* Project updates<br />
<br />
|<br />
<br />
=== Week 9: 13-17 August ===<br />
* Richard out all week<br />
|- valign=top<br />
|<br />
<br />
=== Week 10: 20-24 August ===<br />
'''Biocircuits: 22 Aug (Wed), 10 am - 12 pm'''<br />
* Research presentation [non-MPP] (30-40 min)<br />
* Research presentation [non-MPP] (10-15 min)<br />
* Research update [non-MPP] (10-15 min)<br />
* Instrument: freezers/cold room<br />
* Lab updates<br />
<br />
'''NCS/Robotics: 22 Aug (Wed), 4-6 pm'''<br />
* Research update (15-20 min)<br />
* Research update (15-20 min)<br />
* Research update (15-20 min)<br />
* Project updates<br />
<br />
'''Group meeting: 23 Aug (Thu), 12-1:15'''<br />
* Lea Goentoro (Bi)<br />
<hr><br />
* MPP retreat, Sun-Tue<br />
|<br />
<br />
=== Week 11: 27-31 August ===<br />
'''Biocircuits: 28 Aug (Tue), 10 am - 12 pm'''<br />
* Jongmin (30-40 min)<br />
* Research update (10-15 min)<br />
* Research update (10-15 min)<br />
* Instruments: Nanodrop/electroporator<br />
* Lab updates<br />
<br />
'''NCS/Robotics: 29 Aug (Wed), 4-6 pm'''<br />
* Mumu (15-20 min)<br />
* Research update (15-20 min)<br />
* Research update (15-20 min)<br />
* Project updates<br />
<br />
'''Group meeting: 30 Aug (Thu), 12-1:15'''<br />
* Open<br />
<hr><br />
* Richard out of town on Fri<br />
|<br />
<br />
=== Week 12: 3-7 September ===<br />
'''Biocircuits: 4 Sep (Tue), 10 am - 12 pm'''<br />
* Marcella (30-40 min)<br />
* Research update (10-15 min)<br />
* Research update (10-15 min)<br />
* Instrument: gel rigs/gel imager<br />
* Lab updates<br />
<br />
'''NCS/Robotics: 5 Sep (Wed), 4-6 pm'''<br />
* Research update (15-20 min)<br />
* Research update (15-20 min)<br />
* Research update (15-20 min)<br />
* Project updates<br />
<br />
'''Group meeting: 6 Sep (Thu), 12-1:15'''<br />
* Open<br />
<hr><br />
* Institute holiday on Mon<br />
|- valign=top<br />
|<br />
<br />
=== Week 13: 10-14 September ===<br />
'''Biocircuits: 11 Sep (Tue), 10 am - 12 pm'''<br />
* Zach (30-40 min)<br />
* Research update (10-15 min)<br />
* Research update (10-15 min)<br />
* Instrument: PCR machines/centrifuges<br />
* Lab updates<br />
<br />
'''NCS/Robotics: 12 Sep (Wed), 4-6 pm'''<br />
* Ufuk (15-20 min)<br />
* Research update (15-20 min)<br />
* Research update (15-20 min)<br />
* Project updates<br />
<br />
'''Group meeting: 13 Sep (Thu), 12-1:15'''<br />
* Open<br />
<hr><br />
* Richard out on Fri<br />
|<br />
<br />
=== Week 14: 17-21 September ===<br />
* Richard out all week<br />
|<br />
=== Week 15: 24-28 September ===<br />
'''Biocircuits: 25 Sep (Tue), 10 am - 12 pm'''<br />
* Enoch (30-40 min)<br />
* Emzo (10-15 min)<br />
* Dan (10-15 min)<br />
* Lab updates<br />
<br />
'''NCS/Robotics: 26 Sep (Wed), 4-6 pm'''<br />
* Stephanie (15-20 min)<br />
* Research update (15-20 min)<br />
* Research update (15-20 min)<br />
* Project updates<br />
<br />
'''Group meeting: 26 Sep (Thu), 12-1:15'''<br />
* Open<br />
<hr><br />
* Richard out on Mon<br />
|}</div>Utopcuhttps://murray.cds.caltech.edu/index.php?title=Group_Schedule,_Summer_2012&diff=14255Group Schedule, Summer 20122012-06-08T04:35:00Z<p>Utopcu: /* Week 7: 30 July - 3 August */</p>
<hr />
<div>This page contains information about various upcoming events that are of interest to the group. __NOTOC__<br />
{| width=60%<br />
|- valign=top<br />
| width=50% |<br />
* [http://www.cds.caltech.edu/~murray/calendar.html Richard's calendar (travel)]<br />
| width=50% |<br />
* [[Group Schedule, Spring 2012]]<br />
|}<br />
<br />
The schedule for group and subgroup meetings is given below. Everyone should sign up for times to talk in the subgroup meetings.<br />
<br />
{| width=100% border=1<br />
|- valign=top<br />
| width=30% |<br />
<br />
=== Week 1: 18-22 June ===<br />
<br />
'''Biocircuits: 21 Jun (Thu), 10 am - 12 pm'''<br />
* SURF introductions (40 min)<br />
* Ophelia (20-30 min)<br />
* Shaunak K (10-15 min)<br />
* Lab updates<br />
<br />
'''Group meeting: 21 Jun (Thu), 12-1'''<br />
* Richard (research overview)<br />
<br />
'''NCS/Robotics: 21 Jun (Thu), 4-6 pm'''<br />
* SURF introductions (20 min)<br />
* Eric (15-20 min)<br />
* Clemens (15-20 min)<br />
* Project updates<br />
<br />
<hr><br />
* Richard out of town Mon-Tue<br />
* SURF students start on Tue<br />
| width=30% |<br />
<br />
=== Week 2: 25-29 June ===<br />
* American Control Conference (Montreal)<br />
* Richard out of town all week<br />
| width=30% |<br />
<br />
=== Week 3: 2-6 July ===<br />
* Richard out of town all week<br />
* Institute holiday on Wed<br />
|- valign=top<br />
|<br />
<br />
=== Week 4: 9-13 July ===<br />
'''Biocircuits: 10 Jul (Tue), 10 am - 12 pm'''<br />
* <font color=blue>Meeting may shift to Mon, 10a-12p</font><br />
* Victoria (25-30 min)<br />
* Anu (10-15 min)<br />
* Jongmin (10-15 min)<br />
* Instrument: Microscope/CellASIC<br />
* Lab updates<br />
<br />
'''Group meeting: 13 Jul (Fri), 12-1:15'''<br />
* Tim Sullivan (Owhadi group)<br />
<br />
'''NCS/Robotics: 13 Jul (Fri), 1:15-3 pm'''<br />
* Stephanie (15-20 min)<br />
* Research update (15-20 min)<br />
* Research update (15-20 min)<br />
* Project updates<br />
<br />
<hr><br />
* Richard out of town Tue pm - Thu (Living Foundries PI meeting)<br />
|<br />
<br />
=== Week 5: 16-20 July ===<br />
'''Biocircuits: 17 Jul (Tue), 10 am - 12 pm'''<br />
* Anu (30-40 min)<br />
* Zach (10-15 min)<br />
* SURF: Vinay V (10-15 min)<br />
* SURF update (10-15 min)<br />
* Instrument: Computing<br />
* Lab updates<br />
<br />
'''NCS/Robotics: 18 Jul (Wed), 4-6 pm'''<br />
* Mumu (15-20 min)<br />
* Research update (15-20 min)<br />
* SURF update (10-15 min)<br />
* SURF update (10-15 min)<br />
* Project updates<br />
<br />
'''Group meeting: 19 Jul (Thu), 12-1:15'''<br />
* Chin-Lin Guo (BE)<br />
<hr><br />
* Shaunak K SURF presentation<br />
|<br />
<br />
=== Week 6: 23-27 July ===<br />
'''Biocircuits: 24 Jul (Tue), 10 am - 12 pm'''<br />
* Emzo (30-40 min)<br />
* Enoch (10-15 min)<br />
* SURF update (10-15 min)<br />
* SURF update (10-15 min)<br />
* Instrument: FACSCalibur/Quanta<br />
* Lab updates<br />
<br />
'''Group meeting: 25 Jul (Wed), 12-1:15'''<br />
* Open<br />
<br />
'''NCS/Robotics: 25 Jul (Wed), 4-6 pm'''<br />
* Pavithra (15-20 min)<br />
* Clemens (10-15 min)<br />
* SURF update (10-15 min)<br />
* SURF update (10-15 min)<br />
* Project updates<br />
<hr><br />
* Richard out of town Thu-Fri<br />
|- valign=top<br />
|<br />
<br />
=== Week 7: 30 July - 3 August ===<br />
'''Biocircuits: 31 Jul (Tue), 12-1:30 pm'''<br />
* <font color=blue>Lunch meeting; may shift to Thu</font><br />
* Research presentation (30-40 min)<br />
* SURF update (10-15 min)<br />
* SURF update (10-15 min)<br />
* Lab updates<br />
<br />
'''NCS/Robotics: 1 Aug (Wed), 12-1:30 pm'''<br />
* <font color=blue>Lunch meeting; may shift to Thu</font><br />
* Eric (15-20 min)<br />
* Ufuk (15-20 min)<br />
* Project updates<br />
<br />
<hr><br />
* KISS workshop; Richard unavailable<br />
|<br />
<br />
=== Week 8: 6-10 August ===<br />
'''Biocircuits: 7 Aug (Tue), 10 am - 12 pm'''<br />
* Dan (30-40 min)<br />
* Victoria (10-15 min)<br />
* Marcella (10-15 min)<br />
* Instrument: Victor X3/BioTek H1MF<br />
* Lab updates<br />
<br />
'''Group meeting: 8 Aug (Wed), 12-1:15'''<br />
* Open<br />
<br />
'''NCS/Robotics: 8 Aug (Wed), 4-6 pm'''<br />
* Research update (15-20 min)<br />
* Research update (15-20 min)<br />
* Research update (15-20 min)<br />
* Project updates<br />
<br />
|<br />
<br />
=== Week 9: 13-17 August ===<br />
* Richard out all week<br />
|- valign=top<br />
|<br />
<br />
=== Week 10: 20-24 August ===<br />
'''Biocircuits: 22 Aug (Wed), 10 am - 12 pm'''<br />
* Research presentation [non-MPP] (30-40 min)<br />
* Research presentation [non-MPP] (10-15 min)<br />
* Research update [non-MPP] (10-15 min)<br />
* Instrument: freezers/cold room<br />
* Lab updates<br />
<br />
'''NCS/Robotics: 22 Aug (Wed), 4-6 pm'''<br />
* Research update (15-20 min)<br />
* Research update (15-20 min)<br />
* Research update (15-20 min)<br />
* Project updates<br />
<br />
'''Group meeting: 23 Aug (Thu), 12-1:15'''<br />
* Lea Goentoro (Bi)<br />
<hr><br />
* MPP retreat, Sun-Tue<br />
|<br />
<br />
=== Week 11: 27-31 August ===<br />
'''Biocircuits: 28 Aug (Tue), 10 am - 12 pm'''<br />
* Jongmin (30-40 min)<br />
* Research update (10-15 min)<br />
* Research update (10-15 min)<br />
* Instruments: Nanodrop/electroporator<br />
* Lab updates<br />
<br />
'''NCS/Robotics: 29 Aug (Wed), 4-6 pm'''<br />
* Mumu (15-20 min)<br />
* Research update (15-20 min)<br />
* Research update (15-20 min)<br />
* Project updates<br />
<br />
'''Group meeting: 30 Aug (Thu), 12-1:15'''<br />
* Open<br />
<hr><br />
* Richard out of town on Fri<br />
|<br />
<br />
=== Week 12: 3-7 September ===<br />
'''Biocircuits: 4 Sep (Tue), 10 am - 12 pm'''<br />
* Marcella (30-40 min)<br />
* Research update (10-15 min)<br />
* Research update (10-15 min)<br />
* Instrument: gel rigs/gel imager<br />
* Lab updates<br />
<br />
'''NCS/Robotics: 5 Sep (Wed), 4-6 pm'''<br />
* Research update (15-20 min)<br />
* Research update (15-20 min)<br />
* Research update (15-20 min)<br />
* Project updates<br />
<br />
'''Group meeting: 6 Sep (Thu), 12-1:15'''<br />
* Open<br />
<hr><br />
* Institute holiday on Mon<br />
|- valign=top<br />
|<br />
<br />
=== Week 13: 10-14 September ===<br />
'''Biocircuits: 11 Sep (Tue), 10 am - 12 pm'''<br />
* Zach (30-40 min)<br />
* Research update (10-15 min)<br />
* Research update (10-15 min)<br />
* Instrument: PCR machines/centrifuges<br />
* Lab updates<br />
<br />
'''NCS/Robotics: 12 Sep (Wed), 4-6 pm'''<br />
* Research update (15-20 min)<br />
* Research update (15-20 min)<br />
* Research update (15-20 min)<br />
* Project updates<br />
<br />
'''Group meeting: 13 Sep (Thu), 12-1:15'''<br />
* Open<br />
<hr><br />
* Richard out on Fri<br />
|<br />
<br />
=== Week 14: 17-21 September ===<br />
* Richard out all week<br />
|<br />
=== Week 15: 24-28 September ===<br />
'''Biocircuits: 25 Sep (Tue), 10 am - 12 pm'''<br />
* Enoch (30-40 min)<br />
* Emzo (10-15 min)<br />
* Dan (10-15 min)<br />
* Lab updates<br />
<br />
'''NCS/Robotics: 26 Sep (Wed), 4-6 pm'''<br />
* Stephanie (15-20 min)<br />
* Research update (15-20 min)<br />
* Research update (15-20 min)<br />
* Project updates<br />
<br />
'''Group meeting: 26 Sep (Thu), 12-1:15'''<br />
* Open<br />
<hr><br />
* Richard out on Mon<br />
|}</div>Utopcuhttps://murray.cds.caltech.edu/index.php?title=EECI_2012:_Deductive_Verification_of_Hybrid_Systems&diff=14072EECI 2012: Deductive Verification of Hybrid Systems2012-05-16T08:11:49Z<p>Utopcu: /* Lecture Materials */</p>
<hr />
<div>{{eeci-sp12 header|prev=Computer Session: Spin|next=Algorithmic Verification}}<br />
<br />
This lecture focuses on the verification of hybrid systems using deductive (theorem proving) methods. We describe hybrid systems that combine continuous and discrete states. We then describe two methods for deductive verification. First, we discuss a computational procedure for constructing Lyapunov-type functions (e.g., barrier certificates) that witness the fact that a hybrid system satisfies certain temporal specifications. Second, we consider control protocols for cooperation and decision making in multi-agent systems, as illustrated by the RoboFlag example introduced in the first lecture. We show how to implement a simple protocol for distributed target assignment in a simplified version of the problem (the "RoboFlag drill") and prove stability of the protocol. <br />
<br />
== Lecture Materials ==<br />
* Lecture slides: [http://www.cds.caltech.edu/~murray/courses/eeci-sp12/L5_deductive-16May12.pdf Deductive Verification of Hybrid Systems]<br />
<br />
Some of the slides are from a short course ([http://www.cds.caltech.edu/~utopcu/index.php/Short_Course:_Quantitative_Local_Analysis_of_Nonlinear_Systems_Using_Sum-of-Squares_Decompositions Quantitative Local Analysis of Nonlinear Systems Using Sum-of-Squares Decompositions]) by Balas, Packard, Seiler, and Topcu.<br />
<br />
== Further Reading ==<br />
* <p>[http://resolver.caltech.edu/CaltechETD:etd-05272005-144358 Stephen Prajna's dissertation] on verifying temporal properties for hybrid dynamical systems. </p><br />
* <p> [http://www.cds.caltech.edu/~utopcu/images//9/9b/TPSB-CSM-2010.pdf Help on SOS]: a paper on the very basics of sum-of-squares programming and their use in nonlinear system verification.</p><br />
* <p> [http://arxiv.org/abs/math.OC/0103170 Minimizing Polynomial Functions] by P. Parrilo and B. Sturmfels on global optimization of polynomial functions and Positivstellensatz (generalizations of the S-procedure). </p><br />
* <p> [http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=1271797 A Computation and Control Language for Multi-Vehicle Systems], E. Klavins. Int’l Conference on Robotics and Automation, 2004. </p><br />
* <p> [http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=1269132 Distributed Algorithms for Cooperative Control], E. Klavins and R. M. Murray. ''IEEE Pervasive Computing'', 2004. </p><br />
<br />
== Additional Materials ==</div>Utopcuhttps://murray.cds.caltech.edu/index.php?title=EECI_2012:_Deductive_Verification_of_Hybrid_Systems&diff=14071EECI 2012: Deductive Verification of Hybrid Systems2012-05-16T08:10:01Z<p>Utopcu: /* Further Reading */</p>
<hr />
<div>{{eeci-sp12 header|prev=Computer Session: Spin|next=Algorithmic Verification}}<br />
<br />
This lecture focuses on the verification of hybrid systems using deductive (theorem proving) methods. We describe hybrid systems that combine continuous and discrete states. We then describe two methods for deductive verification. First, we discuss a computational procedure for constructing Lyapunov-type functions (e.g., barrier certificates) that witness the fact that a hybrid system satisfies certain temporal specifications. Second, we consider control protocols for cooperation and decision making in multi-agent systems, as illustrated by the RoboFlag example introduced in the first lecture. We show how to implement a simple protocol for distributed target assignment in a simplified version of the problem (the "RoboFlag drill") and prove stability of the protocol. <br />
<br />
== Lecture Materials ==<br />
* Lecture slides: [http://www.cds.caltech.edu/~murray/courses/eeci-sp12/L5_deductive-16May12.pdf Deductive Verification of Hybrid Systems]<br />
<br />
== Further Reading ==<br />
* <p>[http://resolver.caltech.edu/CaltechETD:etd-05272005-144358 Stephen Prajna's dissertation] on verifying temporal properties for hybrid dynamical systems. </p><br />
* <p> [http://www.cds.caltech.edu/~utopcu/images//9/9b/TPSB-CSM-2010.pdf Help on SOS]: a paper on the very basics of sum-of-squares programming and their use in nonlinear system verification.</p><br />
* <p> [http://arxiv.org/abs/math.OC/0103170 Minimizing Polynomial Functions] by P. Parrilo and B. Sturmfels on global optimization of polynomial functions and Positivstellensatz (generalizations of the S-procedure). </p><br />
* <p> [http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=1271797 A Computation and Control Language for Multi-Vehicle Systems], E. Klavins. Int’l Conference on Robotics and Automation, 2004. </p><br />
* <p> [http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=1269132 Distributed Algorithms for Cooperative Control], E. Klavins and R. M. Murray. ''IEEE Pervasive Computing'', 2004. </p><br />
<br />
== Additional Materials ==</div>Utopcuhttps://murray.cds.caltech.edu/index.php?title=EECI_2012:_Computer_Session:_Spin&diff=14068EECI 2012: Computer Session: Spin2012-05-15T14:49:11Z<p>Utopcu: </p>
<hr />
<div>{{eeci-sp12 header|prev=Model Checking|next=Deductive Verification}}<br />
<br />
{{righttoc}}<br />
Hands-on model checking exercises using SPIN.<br />
<br />
== Lecture Materials ==<br />
* [http://www.cds.caltech.edu/~murray/courses/eeci-sp12/C1_spin-15May12.pdf Lecture slides]<br />
* Example promela files: [http://www.cds.caltech.edu/~murray/courses/eeci-sp12/lights_simple.pml lights_simple.pml], [http://www.cds.caltech.edu/~murray/courses/eeci-sp12/lights_distributed.pml lights_distributed.pml], [http://www.cds.caltech.edu/~utopcu/EECI2012/lights_synthesis.pml lights_synthesis.pml]<br />
* [http://www.cds.caltech.edu/~utopcu/eeci2011/SPIN_cheat_sheet.pdf Sample SPIN commands]<br />
<br />
== Further Reading ==<br />
* <p>[http://www.amazon.com/SPIN-Model-Checker-Primer-Reference/dp/0321228626/ref=sr_1_1?ie=UTF8&qid=1297068669&sr=8-1 The SPIN Model Checker: Primer and Reference Manual], G. J. Holzmann, Addison-Wesley Professional, 2003. A comprehensive reference on Spin model checker </p><br />
<br />
== Additional Materials ==<br />
* <p>[http://spinroot.com/spin/whatispin.html SPIN web site] </p><br />
* [http://www.lsv.ens-cachan.fr/~gastin/ltl2ba/ LTL2BA] - a web page (and program) for converting LTL formulas to Buchi automata.</div>Utopcuhttps://murray.cds.caltech.edu/index.php?title=EECI_2012:_Receding_Horizon_Temporal_Logic_Planning&diff=14055EECI 2012: Receding Horizon Temporal Logic Planning2012-05-14T10:24:14Z<p>Utopcu: </p>
<hr />
<div>{{AFRL12 header|prev=Synthesis of Reactive Control Protocols |next=TuLiP}}<br />
<br />
The first part of this lecture introduces the receding horizon temporal logic planning. Introductory material on high computational complexity of reactive control protocol synthesis is followed by the statement and discussion of a main result and a small example. We discuss implementation details, further extensions, and a hierarchical control structure that utilizes the proposed receding horizon temporal logic planning procedure. In the second part, we present some of our recent results on the compositional synthesis of distributed, reactive control protocols.<br />
<br />
{{righttoc}}<br />
<br />
<br />
== Lecture Materials ==<br />
* Lecture slides: [http://www.cds.caltech.edu/~utopcu/EECI2012/L8_rhtlp_18May12.pdf Receding Horizon Temporal Logic Planning and Compositional Synthesis]<br />
<br />
== Further Reading and Additional Information ==<br />
* <p>[http://www.cds.caltech.edu/~utopcu/images//4/4d/WTM-itac10R.pdf Receding horizon temporal logic planning],T. Wongpiromsarn, U. Topcu, and R. Murray, submitted to IEEE Transactions on Automatic Control, 2010. Details on the receding horizon temporal logic planning. </p><br />
* <p>[http://www.cds.caltech.edu/~utopcu/images//0/0a/OTM-cdc11.pdf Distributed power allocation for vehicle management systems], N. Ozay, U. Topcu, and R. Murray, CDC 2011. Details on compositional synthesis. </p></div>Utopcuhttps://murray.cds.caltech.edu/index.php?title=EECI_2012:_Receding_Horizon_Temporal_Logic_Planning&diff=14054EECI 2012: Receding Horizon Temporal Logic Planning2012-05-14T10:19:57Z<p>Utopcu: </p>
<hr />
<div>{{AFRL12 header|prev=Synthesis of Reactive Control Protocols |next=TuLiP}}<br />
<br />
The first part of this lecture introduces the receding horizon temporal logic planning. Introductory material on high computational complexity of reactive control protocol synthesis is followed by the statement and discussion of a main result and a small example. We discuss implementation details, further extensions, and a hierarchical control structure that utilizes the proposed receding horizon temporal logic planning procedure. In the second part, we present some of our recent results on the compositional synthesis of distributed, reactive control protocols.<br />
<br />
{{righttoc}}<br />
<br />
<br />
== Lecture Materials ==<br />
* Lecture slides: [http://www.cds.caltech.edu/~utopcu/EECI2012/L8_rhtlp_18May12.pdf Receding Horizon Temporal Logic Planning and Compositional Synthesis]<br />
<br />
== Further Reading and Additional Information ==<br />
* <p>[http://www.cds.caltech.edu/~utopcu/images//4/4d/WTM-itac10R.pdf Receding horizon temporal logic planning],T. Wongpiromsarn, U. Topcu, and R. Murray, submitted to IEEE Transactions on Automatic Control, 2010. Details on the receding horizon temporal logic planning. </p></div>Utopcuhttps://murray.cds.caltech.edu/index.php?title=EECI_2012:_Receding_Horizon_Temporal_Logic_Planning&diff=14053EECI 2012: Receding Horizon Temporal Logic Planning2012-05-14T10:17:45Z<p>Utopcu: </p>
<hr />
<div>{{AFRL12 header|prev=Synthesis of Reactive Control Protocols |next=TuLiP}}<br />
<br />
The first part of this lecture introduces the receding horizon temporal logic planning. Introductory material on high computational complexity of reactive control protocol synthesis is followed by the statement and discussion of a main result and a small example. We discuss implementation details, further extensions, and a hierarchical control structure that utilizes the proposed receding horizon temporal logic planning procedure. In the second part, we present some of our recent results on the compositional synthesis of distributed, reactive control protocols.<br />
<br />
{{righttoc}}<br />
<br />
<br />
== Lecture Materials ==<br />
* Lecture slides: [http://www.cds.caltech.edu/~utopcu/EECI2012/L8_rhtlp_18May12.pdf Receding Horizon Temporal Logic Planning and Compositional Synthesis]<br />
<br />
== Further Reading and Additional Information ==<br />
* <p>[http://www.cds.caltech.edu/~utopcu/images//4/4d/WTM-itac10R.pdf Receding horizon temporal logic planning],T. Wongpiromsarn, U. Topcu, and R. Murray, submitted to IEEE Transactions on Automatic Control, 2010. Details on the receding horizon temporal logic planning. </p> <br />
* <p> [http://www.cds.caltech.edu/~murray/wiki/index.php/EECI08:_Optimization-Based_Control Optimization based control]. A page prepared for EECI 2008 with information and material on basic receding horizon control.</p><br />
* <p>[http://control.ee.ethz.ch/~mpt/ Multiparametric Toolbox] The Multi-Parametric Toolbox (MPT) is a free Matlab toolbox for design, analysis and deployment of optimal controllers for constrained linear, nonlinear and hybrid systems. [http://www.cds.caltech.edu/tulip The receding horizon temporal logic planning toolbox] uses the polytope manipulation (intersection, union, set difference, projection, etc.) functionalities of MPT. </p><br />
<br />
* <p>[http://www.cds.caltech.edu/~utopcu/images//9/98/WTM-aaai10.pdf Automatic synthesis of robust embedded control software], T. Wongpiromsarn, U. Topcu, and R. Murray, AAAI 2010 Spring Symposium on Embedded Reasoning: Intelligence in Embedded Systems, 2010. Details on the abstraction procedure covered in this lecture. </p><br />
<br />
*<p> [http://www.mpc.berkeley.edu/mpc-course-material/BBMbook_Cambridge.pdf?attredirects=0&d=1 Predictive Control]: A book draft by Bemporap, Borrelli, and Morari. Details on some of the ideas in the implementation of the abstraction procedure presented in the slides can be found in this book. </p></div>Utopcuhttps://murray.cds.caltech.edu/index.php?title=EECI_2012:_Receding_Horizon_Temporal_Logic_Planning&diff=14052EECI 2012: Receding Horizon Temporal Logic Planning2012-05-14T10:15:50Z<p>Utopcu: </p>
<hr />
<div>{{AFRL12 header|prev=Synthesis of Reactive Control Protocols |next=TuLiP}}<br />
<br />
The first part of this lecture introduces the receding horizon temporal logic planning. Introductory material on high computational complexity of reactive control protocol synthesis is followed by the statement and discussion of a main result and a small example. We discuss implementation details, further extensions, and a hierarchical control structure that utilizes the proposed receding horizon temporal logic planning procedure. In the second part, we present some of our recent results on the compositional synthesis of distributed, reactive control protocols.<br />
<br />
{{righttoc}}<br />
<br />
<br />
== Lecture Materials ==<br />
* Lecture slides: [http://www.cds.caltech.edu/~utopcu/EECI2012/L8_rhtlp_18May12.pdf Receding Horizon Temporal Logic Planning]<br />
<br />
== Further Reading and Additional Information ==<br />
* <p>[http://www.cds.caltech.edu/~utopcu/images//4/4d/WTM-itac10R.pdf Receding horizon temporal logic planning],T. Wongpiromsarn, U. Topcu, and R. Murray, submitted to IEEE Transactions on Automatic Control, 2010. Details on the receding horizon temporal logic planning. </p> <br />
* <p> [http://www.cds.caltech.edu/~murray/wiki/index.php/EECI08:_Optimization-Based_Control Optimization based control]. A page prepared for EECI 2008 with information and material on basic receding horizon control.</p><br />
* <p>[http://control.ee.ethz.ch/~mpt/ Multiparametric Toolbox] The Multi-Parametric Toolbox (MPT) is a free Matlab toolbox for design, analysis and deployment of optimal controllers for constrained linear, nonlinear and hybrid systems. [http://www.cds.caltech.edu/tulip The receding horizon temporal logic planning toolbox] uses the polytope manipulation (intersection, union, set difference, projection, etc.) functionalities of MPT. </p><br />
<br />
* <p>[http://www.cds.caltech.edu/~utopcu/images//9/98/WTM-aaai10.pdf Automatic synthesis of robust embedded control software], T. Wongpiromsarn, U. Topcu, and R. Murray, AAAI 2010 Spring Symposium on Embedded Reasoning: Intelligence in Embedded Systems, 2010. Details on the abstraction procedure covered in this lecture. </p><br />
<br />
*<p> [http://www.mpc.berkeley.edu/mpc-course-material/BBMbook_Cambridge.pdf?attredirects=0&d=1 Predictive Control]: A book draft by Bemporap, Borrelli, and Morari. Details on some of the ideas in the implementation of the abstraction procedure presented in the slides can be found in this book. </p></div>Utopcuhttps://murray.cds.caltech.edu/index.php?title=HYCON-EECI,_Spring_2012&diff=14051HYCON-EECI, Spring 20122012-05-14T10:14:03Z<p>Utopcu: Undo revision 14048 by Utopcu (Talk)</p>
<hr />
<div><table width="100%" cellspacing=0><br />
<tr valign=top><br />
<td rowspan=4 align=center> [[Image:eecilogo.png|90px]]</td><br />
<td align=center><font color='blue' size='+2'>Specification, Design, and Verification <br> &nbsp;</font></td><br />
<td rowspan=4 align=center"> [[Image:cdslogo.png|90px]]</td></tr><br />
<tr><td align=center><font color='blue' size='+2'>of Distributed Embedded Systems<br> &nbsp; </font></td></tr><br />
<tr valign=top><td align=center><font color='blue' size='+0'><p> Richard M. Murray, Ufuk Topcu, and Nok Wongpiromsarn </p></font></td></tr><br />
<tr valign=top><td align=center><font color='blue' size='+0'><p>14-18 May 2012, L'Aquila (Italy)</p></font></td></tr><br />
</table> __NOTOC__<br />
<br />
== Course Description ==<br />
Increases in fast and inexpensive computing and communications have enabled a new generation of information-rich control systems that rely on multi-threaded networked execution, distributed optimization, sensor fusion and protocol stacks in increasingly sophisticated ways. This course will provide working knowledge of a collection of methods and tools for specifying, designing and verifying networked control systems. We combine methods from computer science (temporal logic, model checking, synthesis of control protocols) with those from dynamical systems and control (Lyapunov functions, trajectory generation, receding horizon control) to analyze and design partially asynchronous control protocols for continuous systems. In addition to introducing the mathematical techniques required to formulate problems and prove properties, we also describe a software toolbox (TuLiP) that is designed for analyzing and synthesizing hybrid control systems using linear temporal logic and robust performance specifications.<br />
<br />
== Course information ==<br />
* Instructors: [http://www.cds.caltech.edu/~murray/wiki/Main_Page Richard M. Murray] (Caltech, CDS) and [http://www.cds.caltech.edu/~utopcu/index.php/Main_Page Ufuk Topcu] (Caltech, CDS), and [http://www.cds.caltech.edu/~nok/ Nok Wongpiromsarn] (MIT-Singapore)<br />
* Date and location: 14-18 May 2012, L'Aquila (Italy)<br />
* Sponsor: [http://www.eeci-institute.eu/GSC2011 HYCON-EECI Graduate School on Control]<br />
<br />
== Lecture Schedule ==<br />
<br />
The schedule below lists the lectures that will be given as part of the course. Each lecture will last approximately 90 minutes. The individual lecture pages give an overview of the lecture and links to additional information.<br />
<br />
{|border=1 cellpadding=2<br />
|-<br />
|align=center|Lec<br />
|align=center|Date/time <br />
|Title <br />
|Topics<br />
{{eeci12 entry|L1|RM|Mon, 9:00|Introduction: Protocol-Based Control Systems|<br />
* Introduction to networked control systems (NCS)<br />
* Overview of control "protocols"<br />
* Examples: Alice, RoboFlag<br />
}}<br />
{{eeci12 entry|L2|NW|Mon, 11:00|Automata Theory|<br />
* Finite transition systems<br />
* Paths, traces and composition of finite transition systems<br />
* Linear time properties; safety and liveness<br />
* Examples: traffic light<br />
}}<br />
{{eeci12 entry|L3|UT|Mon, 14:00|Temporal Logic|<br />
* Linear temporal logic<br />
* Omega regular properties<br />
* Buchi automata, representation of LTL using NBA<br />
* Examples: traffic light, (RoboFlag), autonomous driving<br />
}}<br />
{{eeci12 entry|L4|NW|Mon, 16:00|Model Checking and Logic Synthesis|<br />
* Basic concepts in model checking<br />
* Use of model checking for logic synthesis<br />
* Examples: traffic light, farmer puzzle<br />
}}<br />
{{eeci12 entry|C1|RM|Tue, 14:00 <br> Tue, 16:00|Computer Session: Spin|<br />
* Introduction to Promela and Spin (statements, processes, messages)<br />
* Verification examples: traffic light, distributed traffic light, gcdrive<br />
* Synthesis examples: traffic light, farmer puzzle, robot navigation<br />
}}<br />
{{eeci12 entry|L5|RM|Wed, 9:00|Deductive Verification of Hybrid Systems|<br />
* Brief introduction to hybrid systems and verification techniques (deductive, algorithmic)<br />
* Deductive verification using barrier certificates<br />
* Guarded command languages and CCL for asynchronous control protocols<br />
* Examples: multi-agent systems, RoboFlag<br />
}}<br />
{{eeci12 entry|L6|UT|Wed, 11:00|Algorithmic Verification of Hybrid Systems|<br />
* Abstraction hierarchies for control systems<br />
* Finite state abstractions (discretization) and model checking<br />
* Discretization of continuous state systems<br />
* Approximate bi-simulation (if time)<br />
* Examples: gear changing (?), ???<br />
}}<br />
{{eeci12 entry|L7|NW|Wed, 14:00|Synthesis of Reactive Control Protocols|<br />
* Open system and reactive system synthesis<br />
* Satisfiability, realizability<br />
* Game structures, reachability/safety games<br />
* Mu-calculus (if time) and GR(1) games<br />
* Examples: runner-blocker<br />
}}<br />
{{eeci12 entry|C2|NW|Thu, 9:00 <br> Thu, 11:00|Computer Session: TuLiP|<br />
* Introduction to TuLiP<br />
* Synthesis of protocols for discrete systems<br />
* Discretization of continuous systems (and protocol synthesis)<br />
* Examples: reactive motion planning<br />
}}<br />
{{eeci12 entry|L8|UT|Fri, 9:00|Receding Horizon Temporal Logic Planning|<br />
* Receding horizon control<br />
* Distributed control<br />
* Examples: reactive motion planning, electric power systems (distributed)<br />
}}<br />
{{eeci12 entry|L9|RM|Fri, 11:00|Extensions, Applications, Open Questions|<br />
* Review of control trends and course contents<br />
* Discussion of open problem areas and preliminary results<br />
** Optimization-based techniques<br />
** Probabilistic techniques<br />
** Others: Robustness, switching systems, timed systems<br />
* Examples: robot motion planning, electric power systems (timed)<br />
}}<br />
|}<br />
<br />
== Software Installation ==<br />
<br />
We will make use of two programs during the lab sessions:<br />
* [http://spinroot.com Spin] - model checker for formal verification of distributed systems<br />
* [http://tulip-control.sf.net TuLiP] - python-based toolbox for temporal logic planning and controller synthesis<br />
During the course, we will access these programs on a remote machine using ssh. For some parts of the course it will be useful to have a local installation of MATLAB that can be used for visualizing some simulation results.<br />
<br />
If you would like to install the software on your own, here are some basic directions for installing the two packages:<br />
* Spin: if you are using Windows, you can download a [http://spinroot.com/spin/Bin/index.html binary installation]. For Mac's, you need to compile from source. For this you will need a C compiler, such as the one that is part of the [https://developer.apple.com/technologies/tools/ Xcode developer toolbox]<br />
* TuLiP: you will need a python installation (2.6 or greater) with SciPy (0.9 or greater) installed. You might consider using the [http://enthought.com Enthought Python distribution]. Once you have scipy installed, you will need to install several other python packages, including cvxopt and yices. A [http://sourceforge.net/apps/mediawiki/tulip-control/index.php?title=Main_Page list of required package] is available on the TuLiP project page.<br />
<br />
[[Category:Courses]]<br />
[[Category:2011-12 Courses]]</div>Utopcuhttps://murray.cds.caltech.edu/index.php?title=HYCON-EECI,_Spring_2012&diff=14048HYCON-EECI, Spring 20122012-05-14T10:12:40Z<p>Utopcu: /* Lecture Schedule */</p>
<hr />
<div><table width="100%" cellspacing=0><br />
<tr valign=top><br />
<td rowspan=4 align=center> [[Image:eecilogo.png|90px]]</td><br />
<td align=center><font color='blue' size='+2'>Specification, Design, and Verification <br> &nbsp;</font></td><br />
<td rowspan=4 align=center"> [[Image:cdslogo.png|90px]]</td></tr><br />
<tr><td align=center><font color='blue' size='+2'>of Distributed Embedded Systems<br> &nbsp; </font></td></tr><br />
<tr valign=top><td align=center><font color='blue' size='+0'><p> Richard M. Murray, Ufuk Topcu, and Nok Wongpiromsarn </p></font></td></tr><br />
<tr valign=top><td align=center><font color='blue' size='+0'><p>14-18 May 2012, L'Aquila (Italy)</p></font></td></tr><br />
</table> __NOTOC__<br />
<br />
== Course Description ==<br />
Increases in fast and inexpensive computing and communications have enabled a new generation of information-rich control systems that rely on multi-threaded networked execution, distributed optimization, sensor fusion and protocol stacks in increasingly sophisticated ways. This course will provide working knowledge of a collection of methods and tools for specifying, designing and verifying networked control systems. We combine methods from computer science (temporal logic, model checking, synthesis of control protocols) with those from dynamical systems and control (Lyapunov functions, trajectory generation, receding horizon control) to analyze and design partially asynchronous control protocols for continuous systems. In addition to introducing the mathematical techniques required to formulate problems and prove properties, we also describe a software toolbox (TuLiP) that is designed for analyzing and synthesizing hybrid control systems using linear temporal logic and robust performance specifications.<br />
<br />
== Course information ==<br />
* Instructors: [http://www.cds.caltech.edu/~murray/wiki/Main_Page Richard M. Murray] (Caltech, CDS) and [http://www.cds.caltech.edu/~utopcu/index.php/Main_Page Ufuk Topcu] (Caltech, CDS), and [http://www.cds.caltech.edu/~nok/ Nok Wongpiromsarn] (MIT-Singapore)<br />
* Date and location: 14-18 May 2012, L'Aquila (Italy)<br />
* Sponsor: [http://www.eeci-institute.eu/GSC2011 HYCON-EECI Graduate School on Control]<br />
<br />
== Lecture Schedule ==<br />
<br />
The schedule below lists the lectures that will be given as part of the course. Each lecture will last approximately 90 minutes. The individual lecture pages give an overview of the lecture and links to additional information.<br />
<br />
{|border=1 cellpadding=2<br />
|-<br />
|align=center|Lec<br />
|align=center|Date/time <br />
|Title <br />
|Topics<br />
{{eeci12 entry|L1|RM|Mon, 9:00|Introduction: Protocol-Based Control Systems|<br />
* Introduction to networked control systems (NCS)<br />
* Overview of control "protocols"<br />
* Examples: Alice, RoboFlag<br />
}}<br />
{{eeci12 entry|L2|NW|Mon, 11:00|Automata Theory|<br />
* Finite transition systems<br />
* Paths, traces and composition of finite transition systems<br />
* Linear time properties; safety and liveness<br />
* Examples: traffic light<br />
}}<br />
{{eeci12 entry|L3|UT|Mon, 14:00|Temporal Logic|<br />
* Linear temporal logic<br />
* Omega regular properties<br />
* Buchi automata, representation of LTL using NBA<br />
* Examples: traffic light, (RoboFlag), autonomous driving<br />
}}<br />
{{eeci12 entry|L4|NW|Mon, 16:00|Model Checking and Logic Synthesis|<br />
* Basic concepts in model checking<br />
* Use of model checking for logic synthesis<br />
* Examples: traffic light, farmer puzzle<br />
}}<br />
{{eeci12 entry|C1|RM|Tue, 14:00 <br> Tue, 16:00|Computer Session: Spin|<br />
* Introduction to Promela and Spin (statements, processes, messages)<br />
* Verification examples: traffic light, distributed traffic light, gcdrive<br />
* Synthesis examples: traffic light, farmer puzzle, robot navigation<br />
}}<br />
{{eeci12 entry|L5|RM|Wed, 9:00|Deductive Verification of Hybrid Systems|<br />
* Brief introduction to hybrid systems and verification techniques (deductive, algorithmic)<br />
* Deductive verification using barrier certificates<br />
* Guarded command languages and CCL for asynchronous control protocols<br />
* Examples: multi-agent systems, RoboFlag<br />
}}<br />
{{eeci12 entry|L6|UT|Wed, 11:00|Algorithmic Verification of Hybrid Systems|<br />
* Abstraction hierarchies for control systems<br />
* Finite state abstractions (discretization) and model checking<br />
* Discretization of continuous state systems<br />
* Approximate bi-simulation (if time)<br />
* Examples: gear changing (?), ???<br />
}}<br />
{{eeci12 entry|L7|NW|Wed, 14:00|Synthesis of Reactive Control Protocols|<br />
* Open system and reactive system synthesis<br />
* Satisfiability, realizability<br />
* Game structures, reachability/safety games<br />
* Mu-calculus (if time) and GR(1) games<br />
* Examples: runner-blocker<br />
}}<br />
{{eeci12 entry|C2|NW|Thu, 9:00 <br> Thu, 11:00|Computer Session: TuLiP|<br />
* Introduction to TuLiP<br />
* Synthesis of protocols for discrete systems<br />
* Discretization of continuous systems (and protocol synthesis)<br />
* Examples: reactive motion planning<br />
}}<br />
{{eeci12 entry|L8|UT|Fri, 9:00|Receding Horizon Temporal Logic Planning and Compositional Synthesis|<br />
* Receding horizon control<br />
* Distributed control<br />
* Examples: reactive motion planning, electric power systems (distributed)<br />
}}<br />
{{eeci12 entry|L9|RM|Fri, 11:00|Extensions, Applications, Open Questions|<br />
* Review of control trends and course contents<br />
* Discussion of open problem areas and preliminary results<br />
** Optimization-based techniques<br />
** Probabilistic techniques<br />
** Others: Robustness, switching systems, timed systems<br />
* Examples: robot motion planning, electric power systems (timed)<br />
}}<br />
|}<br />
<br />
== Software Installation ==<br />
<br />
We will make use of two programs during the lab sessions:<br />
* [http://spinroot.com Spin] - model checker for formal verification of distributed systems<br />
* [http://tulip-control.sf.net TuLiP] - python-based toolbox for temporal logic planning and controller synthesis<br />
During the course, we will access these programs on a remote machine using ssh. For some parts of the course it will be useful to have a local installation of MATLAB that can be used for visualizing some simulation results.<br />
<br />
If you would like to install the software on your own, here are some basic directions for installing the two packages:<br />
* Spin: if you are using Windows, you can download a [http://spinroot.com/spin/Bin/index.html binary installation]. For Mac's, you need to compile from source. For this you will need a C compiler, such as the one that is part of the [https://developer.apple.com/technologies/tools/ Xcode developer toolbox]<br />
* TuLiP: you will need a python installation (2.6 or greater) with SciPy (0.9 or greater) installed. You might consider using the [http://enthought.com Enthought Python distribution]. Once you have scipy installed, you will need to install several other python packages, including cvxopt and yices. A [http://sourceforge.net/apps/mediawiki/tulip-control/index.php?title=Main_Page list of required package] is available on the TuLiP project page.<br />
<br />
[[Category:Courses]]<br />
[[Category:2011-12 Courses]]</div>Utopcuhttps://murray.cds.caltech.edu/index.php?title=EECI_2012:_Algorithmic_Verification_of_Hybrid_Systems&diff=14046EECI 2012: Algorithmic Verification of Hybrid Systems2012-05-14T10:10:20Z<p>Utopcu: </p>
<hr />
<div>{{eeci-sp12 header|prev=Deductive Verification of Hybrid Systems|next=Synthesis of Reactive Control Protocols}}<br />
<br />
This lecture focuses on the verification of hybrid systems. We first discuss finite-state under- and over-approximations of hybrid dynamics and how these finite-state models coupled with the model checking tools can be used to verify temporal logic properties against hybrid dynamics. Then, we present a procedure for constructing finite-state, under-approximations which will later be used in the course in the synthesis of hierarchical control protocols. We finally introduce the notions of approximate bisimulations and bisimulation functions and how they can be used in verification of temporal properties.<br />
<br />
<br />
{{righttoc}}<br />
<br />
<br />
== Lecture Materials ==<br />
* Lecture slides: [http://www.cds.caltech.edu/~utopcu/EECI2012/L5_abstractions_16May12.pdf Abstractions for the Analysis and Synthesis of Control Protocols for Hybrid Systems]<br />
<br />
== Additional Material and Further Reading ==<br />
* <p> [http://robotics.eecs.berkeley.edu/~sastry/ee291e/lygeros.pdf Lecture Notes on Hybrid Systems] (by John Lygeros): A rough introduction to hybrid systems. Chapters 5 and 6 are on various analysis techniques relevant for this short course. </p><br />
* <p>[http://www.cds.caltech.edu/~utopcu/images//4/4d/WTM-itac10R.pdf Receding horizon temporal logic planning],T. Wongpiromsarn, U. Topcu, and R. Murray, submitted to IEEE Transactions on Automatic Control, 2010. Details on the receding horizon temporal logic planning. </p> <br />
* <p> [http://www.cds.caltech.edu/~murray/wiki/index.php/EECI08:_Optimization-Based_Control Optimization based control]. A page prepared for EECI 2008 with information and material on basic receding horizon control.</p><br />
* <p>[http://control.ee.ethz.ch/~mpt/ Multiparametric Toolbox] The Multi-Parametric Toolbox (MPT) is a free Matlab toolbox for design, analysis and deployment of optimal controllers for constrained linear, nonlinear and hybrid systems. [http://www.cds.caltech.edu/tulip The receding horizon temporal logic planning toolbox] uses the polytope manipulation (intersection, union, set difference, projection, etc.) functionalities of MPT. </p><br />
* <p>[http://www.cds.caltech.edu/~utopcu/images//9/98/WTM-aaai10.pdf Automatic synthesis of robust embedded control software], T. Wongpiromsarn, U. Topcu, and R. Murray, AAAI 2010 Spring Symposium on Embedded Reasoning: Intelligence in Embedded Systems, 2010. Details on the abstraction procedure covered in this lecture. </p><br />
*<p> [http://www.mpc.berkeley.edu/mpc-course-material/BBMbook_Cambridge.pdf?attredirects=0&d=1 Predictive Control]: A book draft by Bemporap, Borrelli, and Morari. Details on some of the ideas in the implementation of the abstraction procedure presented in the slides can be found in this book. </p></div>Utopcuhttps://murray.cds.caltech.edu/index.php?title=EECI_2012:_Algorithmic_Verification_of_Hybrid_Systems&diff=14045EECI 2012: Algorithmic Verification of Hybrid Systems2012-05-14T10:09:17Z<p>Utopcu: </p>
<hr />
<div>{{eeci-sp12 header|prev=Deductive Verification of Hybrid Systems|next=Synthesis of Reactive Control Protocols}}<br />
<br />
This lecture focuses on the verification of hybrid systems. We first discuss finite-state under- and over-approximations of hybrid dynamics and how these finite-state models coupled with the model checking tools can be used to verify temporal logic properties against hybrid dynamics. Then, we present a procedure for constructing finite-state, under-approximations which will later be used in the course in the synthesis of hierarchical control protocols. We finally introduce the notions of approximate bisimulations and bisimulation functions and how they can be used in verification of temporal properties.<br />
<br />
<br />
{{righttoc}}<br />
<br />
<br />
== Lecture Materials ==<br />
* Lecture slides: [http://www.cds.caltech.edu/~utopcu/EECI2012/L5_abstractions_16May12.pdf Abstractions for the Analysis and Synthesis of Control Protocols for Hybrid Systems]<br />
<br />
== Additional Material and Further Reading ==<br />
* <p> [http://robotics.eecs.berkeley.edu/~sastry/ee291e/lygeros.pdf Lecture Notes on Hybrid Systems] (by John Lygeros): A rough introduction to hybrid systems. Chapters 5 and 6 are on various analysis techniques relevant for this short course. </p></div>Utopcuhttps://murray.cds.caltech.edu/index.php?title=EECI_2012:_Algorithmic_Verification_of_Hybrid_Systems&diff=14044EECI 2012: Algorithmic Verification of Hybrid Systems2012-05-14T10:08:44Z<p>Utopcu: </p>
<hr />
<div>{{eeci-sp12 header|prev=Deductive Verification of Hybrid Systems|next=Synthesis of Reactive Control Protocols}}<br />
<br />
This lecture focuses on the verification of hybrid systems. We first discuss finite-state under- and over-approximations of hybrid dynamics and how these finite-state models coupled with the model checking tools can be used to verify temporal logic properties against hybrid dynamics. Then, we present a procedure for constructing finite-state, under-approximations which will later be used in the course in the synthesis of hierarchical control protocols. We finally introduce the notions of approximate bisimulations and bisimulation functions and how they can be used in verification of temporal properties.<br />
<br />
<br />
{{righttoc}}<br />
<br />
<br />
== Lecture Materials ==<br />
* Lecture slides: [http://www.cds.caltech.edu/~utopcu/EECI2012/L5_abstractions_16May12.pdf Abstractions for the Analysis and Synthesis of Control Protocols for Hybrid Systems]<br />
<br />
== Additional Material and Further Reading ==<br />
* <p> [http://www.cds.caltech.edu/~utopcu/index.php/Short_Course:_Quantitative_Local_Analysis_of_Nonlinear_Systems_Using_Sum-of-Squares_Decompositions Material on part III]. Links to software packages, slides, and notes on quantitative analysis of nonlinear systems. Shorter version is in these [http://www.cds.caltech.edu/~utopcu/cdc10vvslides/UfukTopcu.pdf slides]</p><br />
* <p>[http://etd.caltech.edu/etd/available/etd-05272005-144358/ Stephen Prajna's dissertation] on verifying temporal properties for hybrid dynamical systems. </p><br />
* <p> [http://www.cds.caltech.edu/~utopcu/images//9/9b/TPSB-CSM-2010.pdf Help on SOS]: a paper on the very basics of sum-of-squares programming and their use in nonlinear system verification.</p><br />
* <p> [http://arxiv.org/abs/math.OC/0103170 Minimizing Polynomial Functions] by P. Parrilo and B. Sturmfels on global optimization of polynomial functions and Positivstellensatz (generalizations of the S-procedure). </p><br />
* <p> [http://robotics.eecs.berkeley.edu/~sastry/ee291e/lygeros.pdf Lecture Notes on Hybrid Systems] (by John Lygeros): A rough introduction to hybrid systems. Chapters 5 and 6 are on various analysis techniques relevant for this short course. </p></div>Utopcuhttps://murray.cds.caltech.edu/index.php?title=EECI_2012:_Algorithmic_Verification_of_Hybrid_Systems&diff=14041EECI 2012: Algorithmic Verification of Hybrid Systems2012-05-14T10:04:40Z<p>Utopcu: Created page with '{{eeci-sp12 header|prev=Deductive Verification of Hybrid Systems|next=Synthesis of Reactive Control Protocols}} This lecture focuses on the verification of hybrid systems. We fi…'</p>
<hr />
<div>{{eeci-sp12 header|prev=Deductive Verification of Hybrid Systems|next=Synthesis of Reactive Control Protocols}}<br />
<br />
This lecture focuses on the verification of hybrid systems. We first discuss finite-state under- and over-approximations of hybrid dynamics and how these finite-state models coupled with the model checking tools can be used to verify temporal logic properties against hybrid dynamics. Then, we move to deductive verification and a computational procedure for constructing Lyapunov-type functions (e.g., barrier certificates) which witness the fact that a hybrid system satisfies certain temporal specifications. We finally introduce the notions of approximate bisimulations and bisimulation functions and how they can be used in verification of temporal properties.<br />
<br />
<br />
{{righttoc}}<br />
<br />
<br />
<br />
== Lecture Materials ==<br />
* Lecture slides: [http://www.cds.caltech.edu/~utopcu/AFRL2012/L6_Hybrid_Systems_Verification.pdf Hybrid Systems Verification]<br />
<br />
== Additional Material and Further Reading ==<br />
* <p> [http://www.cds.caltech.edu/~utopcu/index.php/Short_Course:_Quantitative_Local_Analysis_of_Nonlinear_Systems_Using_Sum-of-Squares_Decompositions Material on part III]. Links to software packages, slides, and notes on quantitative analysis of nonlinear systems. Shorter version is in these [http://www.cds.caltech.edu/~utopcu/cdc10vvslides/UfukTopcu.pdf slides]</p><br />
* <p>[http://etd.caltech.edu/etd/available/etd-05272005-144358/ Stephen Prajna's dissertation] on verifying temporal properties for hybrid dynamical systems. </p><br />
* <p> [http://www.cds.caltech.edu/~utopcu/images//9/9b/TPSB-CSM-2010.pdf Help on SOS]: a paper on the very basics of sum-of-squares programming and their use in nonlinear system verification.</p><br />
* <p> [http://arxiv.org/abs/math.OC/0103170 Minimizing Polynomial Functions] by P. Parrilo and B. Sturmfels on global optimization of polynomial functions and Positivstellensatz (generalizations of the S-procedure). </p><br />
* <p> [http://robotics.eecs.berkeley.edu/~sastry/ee291e/lygeros.pdf Lecture Notes on Hybrid Systems] (by John Lygeros): A rough introduction to hybrid systems. Chapters 5 and 6 are on various analysis techniques relevant for this short course. </p></div>Utopcuhttps://murray.cds.caltech.edu/index.php?title=EECI_2012:_Temporal_Logic&diff=14007EECI 2012: Temporal Logic2012-05-13T15:38:38Z<p>Utopcu: </p>
<hr />
<div>{{AFRL12 header|prev=Automata Theory|next=Model Checking}}<br />
{{righttoc}}<br />
<br />
In this lecture we introduce ''linear temporal logic'' (LTL), a mathematical language for describing linear time properties of transition systems. After a short introduction to the concept of temporal logics, we introduce the syntax and semantics of LTL, including examples. Examples of LTL specifications for control protocols are drawn from the applications given in the introductory lecture. If time permits, we will also briefly introduce other temporal logics and describe some of the differences between various formulations.<br />
<br />
== Lecture Materials ==<br />
* Lecture slides: [http://www.cds.caltech.edu/~utopcu/EECI2012/L2_ltl_14May12.pdf Linear Temporal Logic] (Presentation and notation follow that in "Principles of Model Checking" chapter 5.1 by Baier and Katoen.)<br />
<br />
== Further Reading ==<br />
* <p>[http://mitpress.mit.edu/catalog/item/default.asp?ttype=2&tid=11481 Principles of Model Checking], C. Baier and J.-P. Katoen, The MIT Press, 2008. A detailed reference on model checking. Slides for this lecture follow Chapter 6 of this reference. </p><br />
* <p>[http://research.microsoft.com/en-us/um/people/lamport/tla/book.html ''Specifying Systems''], L. Lamport.. Addison-Wesley, 2002. This is a very readable text on specification using temporal logic of actions (LTA).</p><br />
<br />
== Additional Information ==<br />
* [http://www.lsv.ens-cachan.fr/~gastin/ltl2ba/ LTL2BA] - a web page (and program) for converting LTL formulas to Buchi automata.</div>Utopcuhttps://murray.cds.caltech.edu/index.php?title=EECI_2012:_Receding_Horizon_Temporal_Logic_Planning&diff=13920EECI 2012: Receding Horizon Temporal Logic Planning2012-04-22T06:13:11Z<p>Utopcu: </p>
<hr />
<div>{{AFRL12 header|prev=Synthesis of Reactive Control Protocols |next=TuLiP}}<br />
<br />
This lecture introduces the receding horizon temporal logic planning. Introductory material on high computational complexity of reactive control protocol synthesis is followed by the statement and discussion of a main result and a small example. We discuss implementation details, further extensions, and a hierarchical control structure that utilizes the proposed receding horizon temporal logic planning procedure. At the end, we discuss an abstraction procedure based on finite-time reachability from control theory for constructing finite-state approximations of the underlying continuous dynamics. <br />
<br />
{{righttoc}}<br />
<br />
<br />
== Lecture Materials ==<br />
* Lecture slides: [http://www.cds.caltech.edu/~utopcu/AFRL2012/L8_RHTLP.pdf Receding Horizon Temporal Logic Planning]<br />
<br />
== Further Reading and Additional Information ==<br />
* <p>[http://www.cds.caltech.edu/~utopcu/images//4/4d/WTM-itac10R.pdf Receding horizon temporal logic planning],T. Wongpiromsarn, U. Topcu, and R. Murray, submitted to IEEE Transactions on Automatic Control, 2010. Details on the receding horizon temporal logic planning. </p> <br />
* <p> [http://www.cds.caltech.edu/~murray/wiki/index.php/EECI08:_Optimization-Based_Control Optimization based control]. A page prepared for EECI 2008 with information and material on basic receding horizon control.</p><br />
* <p>[http://control.ee.ethz.ch/~mpt/ Multiparametric Toolbox] The Multi-Parametric Toolbox (MPT) is a free Matlab toolbox for design, analysis and deployment of optimal controllers for constrained linear, nonlinear and hybrid systems. [http://www.cds.caltech.edu/tulip The receding horizon temporal logic planning toolbox] uses the polytope manipulation (intersection, union, set difference, projection, etc.) functionalities of MPT. </p><br />
<br />
* <p>[http://www.cds.caltech.edu/~utopcu/images//9/98/WTM-aaai10.pdf Automatic synthesis of robust embedded control software], T. Wongpiromsarn, U. Topcu, and R. Murray, AAAI 2010 Spring Symposium on Embedded Reasoning: Intelligence in Embedded Systems, 2010. Details on the abstraction procedure covered in this lecture. </p><br />
<br />
*<p> [http://www.mpc.berkeley.edu/mpc-course-material/BBMbook_Cambridge.pdf?attredirects=0&d=1 Predictive Control]: A book draft by Bemporap, Borrelli, and Morari. Details on some of the ideas in the implementation of the abstraction procedure presented in the slides can be found in this book. </p></div>Utopcuhttps://murray.cds.caltech.edu/index.php?title=EECI_2012:_Receding_Horizon_Temporal_Logic_Planning&diff=13919EECI 2012: Receding Horizon Temporal Logic Planning2012-04-22T06:13:00Z<p>Utopcu: Created page with '{{AFRL header|prev=Synthesis of Reactive Control Protocols |next=TuLiP}} This lecture introduces the receding horizon temporal logic planning. Introductory material on high co…'</p>
<hr />
<div>{{AFRL header|prev=Synthesis of Reactive Control Protocols |next=TuLiP}}<br />
<br />
This lecture introduces the receding horizon temporal logic planning. Introductory material on high computational complexity of reactive control protocol synthesis is followed by the statement and discussion of a main result and a small example. We discuss implementation details, further extensions, and a hierarchical control structure that utilizes the proposed receding horizon temporal logic planning procedure. At the end, we discuss an abstraction procedure based on finite-time reachability from control theory for constructing finite-state approximations of the underlying continuous dynamics. <br />
<br />
{{righttoc}}<br />
<br />
<br />
== Lecture Materials ==<br />
* Lecture slides: [http://www.cds.caltech.edu/~utopcu/AFRL2012/L8_RHTLP.pdf Receding Horizon Temporal Logic Planning]<br />
<br />
== Further Reading and Additional Information ==<br />
* <p>[http://www.cds.caltech.edu/~utopcu/images//4/4d/WTM-itac10R.pdf Receding horizon temporal logic planning],T. Wongpiromsarn, U. Topcu, and R. Murray, submitted to IEEE Transactions on Automatic Control, 2010. Details on the receding horizon temporal logic planning. </p> <br />
* <p> [http://www.cds.caltech.edu/~murray/wiki/index.php/EECI08:_Optimization-Based_Control Optimization based control]. A page prepared for EECI 2008 with information and material on basic receding horizon control.</p><br />
* <p>[http://control.ee.ethz.ch/~mpt/ Multiparametric Toolbox] The Multi-Parametric Toolbox (MPT) is a free Matlab toolbox for design, analysis and deployment of optimal controllers for constrained linear, nonlinear and hybrid systems. [http://www.cds.caltech.edu/tulip The receding horizon temporal logic planning toolbox] uses the polytope manipulation (intersection, union, set difference, projection, etc.) functionalities of MPT. </p><br />
<br />
* <p>[http://www.cds.caltech.edu/~utopcu/images//9/98/WTM-aaai10.pdf Automatic synthesis of robust embedded control software], T. Wongpiromsarn, U. Topcu, and R. Murray, AAAI 2010 Spring Symposium on Embedded Reasoning: Intelligence in Embedded Systems, 2010. Details on the abstraction procedure covered in this lecture. </p><br />
<br />
*<p> [http://www.mpc.berkeley.edu/mpc-course-material/BBMbook_Cambridge.pdf?attredirects=0&d=1 Predictive Control]: A book draft by Bemporap, Borrelli, and Morari. Details on some of the ideas in the implementation of the abstraction procedure presented in the slides can be found in this book. </p></div>Utopcuhttps://murray.cds.caltech.edu/index.php?title=EECI_2012:_Computer_Session:_TuLiP&diff=13918EECI 2012: Computer Session: TuLiP2012-04-22T03:48:56Z<p>Utopcu: </p>
<hr />
<div>{{AFRL12 header|prev=Receding Horizon Temporal Logic Planning |next=....}}<br />
<br />
This lecture provides an overview of TuLiP, a Python-based software toolbox for the synthesis of embedded control software that is provably correct with respect to a GR[1] specifications. TuLiP combines routines for (1) finite state abstraction of control systems, (2) digital design synthesis from GR[1] specifications, and (3) receding horizon planning. The underlying digital design synthesis routine treats the environment as adversary; hence, the resulting controller is guaranteed to be correct for any admissible environment profile. TuLiP applies the receding horizon framework, allowing the synthesis problem to be broken into a set of smaller problems, and consequently alleviating the computational complexity of the synthesis procedure, while preserving the correctness guarantee.<br />
<br />
A brief overview of TuLiP will be followed by hands-on exercises using the toolbox. <br />
<br />
<br />
== Lecture Materials ==<br />
* Lecture slides: [http://www.cds.caltech.edu/~utopcu/AFRL2012/C2_TuLiP.pdf TuLiP] (Exercises are at the end of the slides.)<br />
<br />
== Further Reading ==<br />
<br />
* <p>TuLiP: A Software Toolbox for Receding Horizon Temporal Logic Planning, T. Wongpiromsarn, U. Topcu, N. Ozay, H. Xu and R. M. Murray, Hybrid Systems: Computation and Control, 2011. </p><br />
<br />
== Additional Information ==<br />
* <p>[http://sourceforge.net/apps/mediawiki/tulip-control/index.php?title=Main_Page TuLiP on SourceForge] </p><br />
* <p>[http://tulip-control.sourceforge.net/doc/ TuLiP Documentation] and [http://tulip-control.sourceforge.net/doc/install.html Installation instructions] </p><br />
* <p>[http://jtlv.ysaar.net/ JTLV Project Home Site] JTLV provides the framework for the underlying digital design synthesis routine used in TuLiP. </p></div>Utopcuhttps://murray.cds.caltech.edu/index.php?title=EECI_2012:_Computer_Session:_TuLiP&diff=13917EECI 2012: Computer Session: TuLiP2012-04-22T03:48:26Z<p>Utopcu: </p>
<hr />
<div>{{AFRL12 header|prev=Receding Horizon Temporal Logic Planning |next=....}}<br />
<br />
This lecture provides an overview of TuLiP, a Python-based software toolbox for the synthesis of embedded control software that is provably correct with respect to a GR[1] specifications. TuLiP combines routines for (1) finite state abstraction of control systems, (2) digital design synthesis from GR[1] specifications, and (3) receding horizon planning. The underlying digital design synthesis routine treats the environment as adversary; hence, the resulting controller is guaranteed to be correct for any admissible environment profile. TuLiP applies the receding horizon framework, allowing the synthesis problem to be broken into a set of smaller problems, and consequently alleviating the computational complexity of the synthesis procedure, while preserving the correctness guarantee.<br />
<br />
A brief overview of TuLiP will be followed by hands-on exercises using the toolbox. <br />
<br />
<br />
== Lecture Materials ==<br />
* Lecture slides: [http://www.cds.caltech.edu/~utopcu/AFRL2012/C2_TuLiP.pdf TuLiP]<br />
<br />
== Further Reading ==<br />
<br />
* <p>TuLiP: A Software Toolbox for Receding Horizon Temporal Logic Planning, T. Wongpiromsarn, U. Topcu, N. Ozay, H. Xu and R. M. Murray, Hybrid Systems: Computation and Control, 2011. </p><br />
<br />
== Additional Information ==<br />
* <p>[http://sourceforge.net/apps/mediawiki/tulip-control/index.php?title=Main_Page TuLiP on SourceForge] </p><br />
* <p>[http://tulip-control.sourceforge.net/doc/ TuLiP Documentation] and [http://tulip-control.sourceforge.net/doc/install.html Installation instructions] </p><br />
* <p>[http://jtlv.ysaar.net/ JTLV Project Home Site] JTLV provides the framework for the underlying digital design synthesis routine used in TuLiP. </p></div>Utopcuhttps://murray.cds.caltech.edu/index.php?title=EECI_2012:_Computer_Session:_TuLiP&diff=13916EECI 2012: Computer Session: TuLiP2012-04-22T03:40:11Z<p>Utopcu: /* Additional Information */</p>
<hr />
<div>{{AFRL12 header|prev=Receding Horizon Temporal Logic Planning |next=....}}<br />
<br />
This lecture provides an overview of TuLiP, a Python-based software toolbox for the synthesis of embedded control software that is provably correct with respect to a GR[1] specifications. TuLiP combines routines for (1) finite state abstraction of control systems, (2) digital design synthesis from GR[1] specifications, and (3) receding horizon planning. The underlying digital design synthesis routine treats the environment as adversary; hence, the resulting controller is guaranteed to be correct for any admissible environment profile. TuLiP applies the receding horizon framework, allowing the synthesis problem to be broken into a set of smaller problems, and consequently alleviating the computational complexity of the synthesis procedure, while preserving the correctness guarantee.<br />
<br />
A brief overview of TuLiP will be followed by hands-on exercises using the toolbox. <br />
<br />
<br />
== Lecture Materials ==<br />
* Lecture slides: [http://www.cds.caltech.edu/~utopcu/AFRL2012/L11_tulip-24Mar11.pdf TuLiP]<br />
<br />
== Further Reading ==<br />
<br />
* <p>TuLiP: A Software Toolbox for Receding Horizon Temporal Logic Planning, T. Wongpiromsarn, U. Topcu, N. Ozay, H. Xu and R. M. Murray, Hybrid Systems: Computation and Control, 2011. </p><br />
<br />
== Additional Information ==<br />
* <p>[http://sourceforge.net/apps/mediawiki/tulip-control/index.php?title=Main_Page TuLiP on SourceForge] </p><br />
* <p>[http://tulip-control.sourceforge.net/doc/ TuLiP Documentation] and [http://tulip-control.sourceforge.net/doc/install.html Installation instructions] </p><br />
* <p>[http://jtlv.ysaar.net/ JTLV Project Home Site] JTLV provides the framework for the underlying digital design synthesis routine used in TuLiP. </p></div>Utopcuhttps://murray.cds.caltech.edu/index.php?title=EECI_2012:_Computer_Session:_TuLiP&diff=13915EECI 2012: Computer Session: TuLiP2012-04-22T03:39:10Z<p>Utopcu: /* Additional Information */</p>
<hr />
<div>{{AFRL12 header|prev=Receding Horizon Temporal Logic Planning |next=....}}<br />
<br />
This lecture provides an overview of TuLiP, a Python-based software toolbox for the synthesis of embedded control software that is provably correct with respect to a GR[1] specifications. TuLiP combines routines for (1) finite state abstraction of control systems, (2) digital design synthesis from GR[1] specifications, and (3) receding horizon planning. The underlying digital design synthesis routine treats the environment as adversary; hence, the resulting controller is guaranteed to be correct for any admissible environment profile. TuLiP applies the receding horizon framework, allowing the synthesis problem to be broken into a set of smaller problems, and consequently alleviating the computational complexity of the synthesis procedure, while preserving the correctness guarantee.<br />
<br />
A brief overview of TuLiP will be followed by hands-on exercises using the toolbox. <br />
<br />
<br />
== Lecture Materials ==<br />
* Lecture slides: [http://www.cds.caltech.edu/~utopcu/AFRL2012/L11_tulip-24Mar11.pdf TuLiP]<br />
<br />
== Further Reading ==<br />
<br />
* <p>TuLiP: A Software Toolbox for Receding Horizon Temporal Logic Planning, T. Wongpiromsarn, U. Topcu, N. Ozay, H. Xu and R. M. Murray, Hybrid Systems: Computation and Control, 2011. </p><br />
<br />
== Additional Information ==<br />
* <p>[http://sourceforge.net/apps/mediawiki/tulip-control/index.php?title=Main_Page TuLiP on SourceForge] </p><br />
* <p>[https://www.cds.caltech.edu/subversion/nok/rhtlp/trunk/doc/build/html/index.html TuLiP Documentation] For guest access, use ''anonymous'' as username with no password </p><br />
* <p>[http://jtlv.ysaar.net/ JTLV Project Home Site] JTLV provides the framework for the underlying digital design synthesis routine used in TuLiP. </p></div>Utopcuhttps://murray.cds.caltech.edu/index.php?title=EECI_2012:_Computer_Session:_TuLiP&diff=13914EECI 2012: Computer Session: TuLiP2012-04-22T03:38:34Z<p>Utopcu: </p>
<hr />
<div>{{AFRL12 header|prev=Receding Horizon Temporal Logic Planning |next=....}}<br />
<br />
This lecture provides an overview of TuLiP, a Python-based software toolbox for the synthesis of embedded control software that is provably correct with respect to a GR[1] specifications. TuLiP combines routines for (1) finite state abstraction of control systems, (2) digital design synthesis from GR[1] specifications, and (3) receding horizon planning. The underlying digital design synthesis routine treats the environment as adversary; hence, the resulting controller is guaranteed to be correct for any admissible environment profile. TuLiP applies the receding horizon framework, allowing the synthesis problem to be broken into a set of smaller problems, and consequently alleviating the computational complexity of the synthesis procedure, while preserving the correctness guarantee.<br />
<br />
A brief overview of TuLiP will be followed by hands-on exercises using the toolbox. <br />
<br />
<br />
== Lecture Materials ==<br />
* Lecture slides: [http://www.cds.caltech.edu/~utopcu/AFRL2012/L11_tulip-24Mar11.pdf TuLiP]<br />
<br />
== Further Reading ==<br />
<br />
* <p>TuLiP: A Software Toolbox for Receding Horizon Temporal Logic Planning, T. Wongpiromsarn, U. Topcu, N. Ozay, H. Xu and R. M. Murray, Hybrid Systems: Computation and Control, 2011. </p><br />
<br />
== Additional Information ==<br />
* <p>[http://www.cds.caltech.edu/tulip/ TuLiP] </p><br />
* <p>[https://www.cds.caltech.edu/subversion/nok/rhtlp/trunk/doc/build/html/index.html TuLiP Documentation] For guest access, use ''anonymous'' as username with no password </p><br />
* <p>[http://jtlv.ysaar.net/ JTLV Project Home Site] JTLV provides the framework for the underlying digital design synthesis routine used in TuLiP. </p></div>Utopcuhttps://murray.cds.caltech.edu/index.php?title=EECI_2012:_Computer_Session:_TuLiP&diff=13913EECI 2012: Computer Session: TuLiP2012-04-22T03:37:58Z<p>Utopcu: Created page with '{{AFRL header|prev=Receding Horizon Temporal Logic Planning |next=....}} This lecture provides an overview of TuLiP, a Python-based software toolbox for the synthesis of embedde…'</p>
<hr />
<div>{{AFRL header|prev=Receding Horizon Temporal Logic Planning |next=....}}<br />
<br />
This lecture provides an overview of TuLiP, a Python-based software toolbox for the synthesis of embedded control software that is provably correct with respect to a GR[1] specifications. TuLiP combines routines for (1) finite state abstraction of control systems, (2) digital design synthesis from GR[1] specifications, and (3) receding horizon planning. The underlying digital design synthesis routine treats the environment as adversary; hence, the resulting controller is guaranteed to be correct for any admissible environment profile. TuLiP applies the receding horizon framework, allowing the synthesis problem to be broken into a set of smaller problems, and consequently alleviating the computational complexity of the synthesis procedure, while preserving the correctness guarantee.<br />
<br />
A brief overview of TuLiP will be followed by hands-on exercises using the toolbox. <br />
<br />
<br />
== Lecture Materials ==<br />
* Lecture slides: [http://www.cds.caltech.edu/~utopcu/AFRL2012/L11_tulip-24Mar11.pdf TuLiP]<br />
<br />
== Further Reading ==<br />
<br />
* <p>TuLiP: A Software Toolbox for Receding Horizon Temporal Logic Planning, T. Wongpiromsarn, U. Topcu, N. Ozay, H. Xu and R. M. Murray, Hybrid Systems: Computation and Control, 2011. </p><br />
<br />
== Additional Information ==<br />
* <p>[http://www.cds.caltech.edu/tulip/ TuLiP] </p><br />
* <p>[https://www.cds.caltech.edu/subversion/nok/rhtlp/trunk/doc/build/html/index.html TuLiP Documentation] For guest access, use ''anonymous'' as username with no password </p><br />
* <p>[http://jtlv.ysaar.net/ JTLV Project Home Site] JTLV provides the framework for the underlying digital design synthesis routine used in TuLiP. </p></div>Utopcuhttps://murray.cds.caltech.edu/index.php?title=EECI_2012:_Automata_Theory&diff=13912EECI 2012: Automata Theory2012-04-22T03:08:54Z<p>Utopcu: </p>
<hr />
<div>{{AFRL12 header|prev=Introduction |next=Temporal Logic}}<br />
<br />
This lecture gives an introduction to some concepts and tools in computer science that are used in the remainder of the course. We start with finite transition systems as a mathematical model to describe behavior of systems with finite, discrete states. We use linear-time properties serve as the specification language (e.g., to specify safety or liveness properties) and we discuss the preliminaries that lead to model checking, a commonly used, powerful verification tool.<br />
<br />
{{righttoc}}<br />
<br />
<br />
== Lecture Materials ==<br />
* Lecture slides: [http://www.cds.caltech.edu/~utopcu/AFRL2012/L2_Automata_Theory.pdf Automata Theory] (presentation and notation follow that in "Principles of Model Checking" chapters 2.1, 2.21, 3.2-3.5, and 4.1-4.3 by Baier and Katoen.)<br />
<br />
== Further Reading and Additional Information==<br />
* <p>[http://mitpress.mit.edu/catalog/item/default.asp?ttype=2&tid=11481 Principles of Model Checking], C. Baier and J.-P. Katoen, The MIT Press, 2008. A detailed reference on model checking. Early chapters provide an exposition to automata theory. Slides for this lecture follow this reference. </p> <br />
* <p>[http://www.amazon.com/Introduction-Theory-Computation-Michael-Sipser/dp/053494728X Introduction to the Theory of Computation], M. Sipser, PWS Publishing Company, 1997. This is a textbook on theory of computation covering preliminaries in automata theory. </p> <br />
* <p> [http://www.cds.caltech.edu/~utopcu/VerInCtrl/VerInCtrl.html CDS 270: Verification in Controls]: The second half of the course taught in Fall 2009 at Caltech also covered the material in this lecture. There are brief lecture notes and exercises.</div>Utopcuhttps://murray.cds.caltech.edu/index.php?title=EECI_2012:_Automata_Theory&diff=13911EECI 2012: Automata Theory2012-04-22T03:06:04Z<p>Utopcu: </p>
<hr />
<div>{{AFRL12 header|prev=Introduction |next=Temporal Logic}}<br />
<br />
This lecture gives an introduction to some concepts and tools in computer science that are used in the remainder of the course. We start with finite transition systems as a mathematical model to describe behavior of systems with finite, discrete states. We use linear-time properties serve as the specification language (e.g., to specify safety or liveness properties) and we discuss the preliminaries that lead to model checking, a commonly used, powerful verification tool.<br />
<br />
{{righttoc}}<br />
<br />
<br />
== Lecture Materials ==<br />
* Lecture slides: [http://www.cds.caltech.edu/~utopcu/eeci2011/L2_Automata_Theory.pdf Automata Theory] (presentation and notation follow that in "Principles of Model Checking" chapters 2.1, 2.21, 3.2-3.5, and 4.1-4.3 by Baier and Katoen.)<br />
<br />
== Further Reading and Additional Information==<br />
* <p>[http://mitpress.mit.edu/catalog/item/default.asp?ttype=2&tid=11481 Principles of Model Checking], C. Baier and J.-P. Katoen, The MIT Press, 2008. A detailed reference on model checking. Early chapters provide an exposition to automata theory. Slides for this lecture follow this reference. </p> <br />
* <p>[http://www.amazon.com/Introduction-Theory-Computation-Michael-Sipser/dp/053494728X Introduction to the Theory of Computation], M. Sipser, PWS Publishing Company, 1997. This is a textbook on theory of computation covering preliminaries in automata theory. </p> <br />
* <p> [http://www.cds.caltech.edu/~utopcu/VerInCtrl/VerInCtrl.html CDS 270: Verification in Controls]: The second half of the course taught in Fall 2009 at Caltech also covered the material in this lecture. There are brief lecture notes and exercises.</div>Utopcuhttps://murray.cds.caltech.edu/index.php?title=EECI_2012:_Automata_Theory&diff=13910EECI 2012: Automata Theory2012-04-22T03:04:55Z<p>Utopcu: Created page with '{{eeci-sp11 header|prev=Introduction |next=Temporal Logic}} This lecture gives an introduction to some concepts and tools in computer science that are used in the remainder of t…'</p>
<hr />
<div>{{eeci-sp11 header|prev=Introduction |next=Temporal Logic}}<br />
<br />
This lecture gives an introduction to some concepts and tools in computer science that are used in the remainder of the course. We start with finite transition systems as a mathematical model to describe behavior of systems with finite, discrete states. We use linear-time properties serve as the specification language (e.g., to specify safety or liveness properties) and we discuss the preliminaries that lead to model checking, a commonly used, powerful verification tool.<br />
<br />
{{righttoc}}<br />
<br />
<br />
== Lecture Materials ==<br />
* Lecture slides: [http://www.cds.caltech.edu/~utopcu/eeci2011/L2_Automata_Theory.pdf Automata Theory] (presentation and notation follow that in "Principles of Model Checking" chapters 2.1, 2.21, 3.2-3.5, and 4.1-4.3 by Baier and Katoen.)<br />
<br />
== Further Reading and Additional Information==<br />
* <p>[http://mitpress.mit.edu/catalog/item/default.asp?ttype=2&tid=11481 Principles of Model Checking], C. Baier and J.-P. Katoen, The MIT Press, 2008. A detailed reference on model checking. Early chapters provide an exposition to automata theory. Slides for this lecture follow this reference. </p> <br />
* <p>[http://www.amazon.com/Introduction-Theory-Computation-Michael-Sipser/dp/053494728X Introduction to the Theory of Computation], M. Sipser, PWS Publishing Company, 1997. This is a textbook on theory of computation covering preliminaries in automata theory. </p> <br />
* <p> [http://www.cds.caltech.edu/~utopcu/VerInCtrl/VerInCtrl.html CDS 270: Verification in Controls]: The second half of the course taught in Fall 2009 at Caltech also covered the material in this lecture. There are brief lecture notes and exercises.</div>Utopcuhttps://murray.cds.caltech.edu/index.php?title=EECI_2012:_Hybrid_Systems_Verification&diff=13909EECI 2012: Hybrid Systems Verification2012-04-22T03:02:55Z<p>Utopcu: </p>
<hr />
<div>{{AFRL12 header|prev=... |next=...}}<br />
<br />
This lecture focuses on the verification of hybrid systems. We first discuss finite-state under- and over-approximations of hybrid dynamics and how these finite-state models coupled with the model checking tools can be used to verify temporal logic properties against hybrid dynamics. Then, we move to deductive verification and a computational procedure for constructing Lyapunov-type functions (e.g., barrier certificates) which witness the fact that a hybrid system satisfies certain temporal specifications. We finally introduce the notions of approximate bisimulations and bisimulation functions and how they can be used in verification of temporal properties.<br />
<br />
<br />
{{righttoc}}<br />
<br />
<br />
<br />
== Lecture Materials ==<br />
* Lecture slides: [http://www.cds.caltech.edu/~utopcu/AFRL2012/L6_Hybrid_Systems_Verification.pdf Hybrid Systems Verification]<br />
<br />
== Additional Material and Further Reading ==<br />
* <p> [http://www.cds.caltech.edu/~utopcu/index.php/Short_Course:_Quantitative_Local_Analysis_of_Nonlinear_Systems_Using_Sum-of-Squares_Decompositions Material on part III]. Links to software packages, slides, and notes on quantitative analysis of nonlinear systems. Shorter version is in these [http://www.cds.caltech.edu/~utopcu/cdc10vvslides/UfukTopcu.pdf slides]</p><br />
* <p>[http://etd.caltech.edu/etd/available/etd-05272005-144358/ Stephen Prajna's dissertation] on verifying temporal properties for hybrid dynamical systems. </p><br />
* <p> [http://www.cds.caltech.edu/~utopcu/images//9/9b/TPSB-CSM-2010.pdf Help on SOS]: a paper on the very basics of sum-of-squares programming and their use in nonlinear system verification.</p><br />
* <p> [http://arxiv.org/abs/math.OC/0103170 Minimizing Polynomial Functions] by P. Parrilo and B. Sturmfels on global optimization of polynomial functions and Positivstellensatz (generalizations of the S-procedure). </p><br />
* <p> [http://robotics.eecs.berkeley.edu/~sastry/ee291e/lygeros.pdf Lecture Notes on Hybrid Systems] (by John Lygeros): A rough introduction to hybrid systems. Chapters 5 and 6 are on various analysis techniques relevant for this short course. </p></div>Utopcuhttps://murray.cds.caltech.edu/index.php?title=EECI_2012:_Hybrid_Systems_Verification&diff=13908EECI 2012: Hybrid Systems Verification2012-04-22T02:55:06Z<p>Utopcu: Created page with '{{eeci-sp11 header|prev=Computer Lab I |next=Autonomous Driving}} This lecture focuses on the computational verification of temporal specifications for hybrid, nonlinear dynamic…'</p>
<hr />
<div>{{eeci-sp11 header|prev=Computer Lab I |next=Autonomous Driving}}<br />
<br />
This lecture focuses on the computational verification of temporal specifications for hybrid, nonlinear dynamical systems and associated software packages. We discuss a procedure for computing algebraic functions (e.g., Lyapunov, storage, barrier functions) that witness the fact that a dynamical system satisfies certain temporal specifications. We discuss applications of this procedure to stability, input-output gain, safety, and eventuality verification. The notion of approximate bisimulations is introduced and use of so-called bisimulation functions in temporal property verification is discussed. <br />
<br />
{{righttoc}}<br />
<br />
<br />
<br />
== Lecture Materials ==<br />
* Lecture slides: [http://www.cds.caltech.edu/~utopcu/AFRL2012/L6_Hybrid_Systems_Verification.pdf Hybrid Systems Verification]<br />
<br />
== Additional Material and Further Reading ==<br />
* <p> [http://www.cds.caltech.edu/~utopcu/index.php/Short_Course:_Quantitative_Local_Analysis_of_Nonlinear_Systems_Using_Sum-of-Squares_Decompositions Material on part III]. Links to software packages, slides, and notes on quantitative analysis of nonlinear systems. Shorter version is in these [http://www.cds.caltech.edu/~utopcu/cdc10vvslides/UfukTopcu.pdf slides]</p><br />
* <p>[http://etd.caltech.edu/etd/available/etd-05272005-144358/ Stephen Prajna's dissertation] on verifying temporal properties for hybrid dynamical systems. </p><br />
* <p> [http://www.cds.caltech.edu/~utopcu/images//9/9b/TPSB-CSM-2010.pdf Help on SOS]: a paper on the very basics of sum-of-squares programming and their use in nonlinear system verification.</p><br />
* <p> [http://arxiv.org/abs/math.OC/0103170 Minimizing Polynomial Functions] by P. Parrilo and B. Sturmfels on global optimization of polynomial functions and Positivstellensatz (generalizations of the S-procedure). </p><br />
* <p> [http://robotics.eecs.berkeley.edu/~sastry/ee291e/lygeros.pdf Lecture Notes on Hybrid Systems] (by John Lygeros): A rough introduction to hybrid systems. Chapters 5 and 6 are on various analysis techniques relevant for this short course. </p></div>Utopcuhttps://murray.cds.caltech.edu/index.php?title=EECI_2012:_Model_Checking_and_Logic_Synthesis&diff=13907EECI 2012: Model Checking and Logic Synthesis2012-04-22T02:30:34Z<p>Utopcu: /* Further Reading */</p>
<hr />
<div>{{AFRL12 header|prev=Temporal Logic |next=Computer Session: Spin}}<br />
<br />
{{righttoc}}<br />
<br />
This lecture provides an introduction to automata based model checking and its use for closed system synthesis. We first discuss what model checking is, how it works (in particular how automata based model checking works), and how it is used for verification of linear temporal logic specifications against finite transition system models. We then move to its use for synthesizing (open-loop) control strategies. We also provide examples using the SPIN model checker (discussed in [[Computer Session: Spin|Computer Session: Spin]] lecture) and discuss the computational complexity of model checking. <br />
<br />
== Lecture Materials ==<br />
* Lecture slides: [http://www.cds.caltech.edu/~utopcu/AFRL2012/L4_Model_Checking_Logic_Synthesis.pdf Model Checking and Logic Synthesis] (Presentation and notation follow that in "Model Checking" chapter 5.2 by Baier and Katoen.)<br />
<br />
== Further Reading ==<br />
* <p>[http://www.amazon.com/SPIN-Model-Checker-Primer-Reference/dp/0321228626/ref=sr_1_1?ie=UTF8&qid=1297068669&sr=8-1 The SPIN Model Checker: Primer and Reference Manual], G. J. Holzmann, Addison-Wesley Professional, 2003. A comprehensive reference on Spin model checker </p><br />
* <p>[http://mitpress.mit.edu/catalog/item/default.asp?ttype=2&tid=11481 Principles of Model Checking], C. Baier and J.-P. Katoen, The MIT Press, 2008. A detailed reference on model checking. Slides for this lecture follow Chapter 6 of this reference. </p><br />
* <p>[http://www.amazon.com/Model-Checking-Edmund-Clarke-Jr/dp/0262032708/ref=sr_1_1?s=books&ie=UTF8&qid=1297071898&sr=1-1 Model Checking], E. M. Clarke, O. Grumberg and D. A. Peled, The MIT Press, 1999. A very good reference on automata based model checking. </p><br />
* <p>[http://portal.acm.org/citation.cfm?id=101990 On the development of reactive systems], D. Harel and A. Pnueli, Logics and models of concurrent systems, Springer-Verlag New York, Inc., 1985, pp. 477–498. For discussion about closed and open systems</p><br />
<br />
== Additional Information ==<br />
* [http://spinroot.com/spin/whatispin.html Spin website]</div>Utopcuhttps://murray.cds.caltech.edu/index.php?title=EECI_2012:_Model_Checking_and_Logic_Synthesis&diff=13906EECI 2012: Model Checking and Logic Synthesis2012-04-22T00:40:54Z<p>Utopcu: </p>
<hr />
<div>{{AFRL12 header|prev=Temporal Logic |next=Computer Session: Spin}}<br />
<br />
{{righttoc}}<br />
<br />
This lecture provides an introduction to automata based model checking and its use for closed system synthesis. We first discuss what model checking is, how it works (in particular how automata based model checking works), and how it is used for verification of linear temporal logic specifications against finite transition system models. We then move to its use for synthesizing (open-loop) control strategies. We also provide examples using the SPIN model checker (discussed in [[Computer Session: Spin|Computer Session: Spin]] lecture) and discuss the computational complexity of model checking. <br />
<br />
== Lecture Materials ==<br />
* Lecture slides: [http://www.cds.caltech.edu/~utopcu/AFRL2012/L4_Model_Checking_Logic_Synthesis.pdf Model Checking and Logic Synthesis] (Presentation and notation follow that in "Model Checking" chapter 5.2 by Baier and Katoen.)<br />
<br />
== Further Reading ==<br />
* <p>[http://www.amazon.com/SPIN-Model-Checker-Primer-Reference/dp/0321228626/ref=sr_1_1?ie=UTF8&qid=1297068669&sr=8-1 The SPIN Model Checker: Primer and Reference Manual], G. J. Holzmann, Addison-Wesley Professional, 2003. A comprehensive reference on Spin model checker </p><br />
* <p>[http://mitpress.mit.edu/catalog/item/default.asp?ttype=2&tid=11481 Principles of Model Checking], C. Baier and J.-P. Katoen, The MIT Press, 2008. A detailed reference on model checking. Slides for this lecture follow Chapter 6 of this reference. </p><br />
* <p>[http://www.amazon.com/Model-Checking-Edmund-Clarke-Jr/dp/0262032708/ref=sr_1_1?s=books&ie=UTF8&qid=1297071898&sr=1-1 Model Checking], E. M. Clarke, O. Grumberg and D. A. Peled, The MIT Press, 1999. A very good reference on automata based model checking. </p><br />
<br />
== Additional Information ==<br />
* [http://spinroot.com/spin/whatispin.html Spin website]</div>Utopcuhttps://murray.cds.caltech.edu/index.php?title=EECI_2012:_Model_Checking_and_Logic_Synthesis&diff=13905EECI 2012: Model Checking and Logic Synthesis2012-04-22T00:40:09Z<p>Utopcu: </p>
<hr />
<div>{{AFRL12 header|prev=Temporal Logic |next=Computer Session: Spin}}<br />
<br />
{{righttoc}}<br />
<br />
This lecture provides an introduction to automata based model checking and its use for closed system synthesis. We first discuss what model checking is, how it works (in particular how automata based model checking works), and how it is used for verification of linear temporal logic specifications against finite transition system models. We then move to its use for synthesizing (open-loop) control strategies. We also provide examples using the SPIN model checker (discussed in [[Computer Session: Spin| Computer Session: Spin]] lecture) and discuss the computational complexity of model checking. <br />
<br />
== Lecture Materials ==<br />
* Lecture slides: [http://www.cds.caltech.edu/~utopcu/AFRL2012/L4_Model_Checking_Logic_Synthesis.pdf Model Checking and Logic Synthesis] (Presentation and notation follow that in "Model Checking" chapter 5.2 by Baier and Katoen.)<br />
<br />
== Further Reading ==<br />
* <p>[http://www.amazon.com/SPIN-Model-Checker-Primer-Reference/dp/0321228626/ref=sr_1_1?ie=UTF8&qid=1297068669&sr=8-1 The SPIN Model Checker: Primer and Reference Manual], G. J. Holzmann, Addison-Wesley Professional, 2003. A comprehensive reference on Spin model checker </p><br />
* <p>[http://mitpress.mit.edu/catalog/item/default.asp?ttype=2&tid=11481 Principles of Model Checking], C. Baier and J.-P. Katoen, The MIT Press, 2008. A detailed reference on model checking. Slides for this lecture follow Chapter 6 of this reference. </p><br />
* <p>[http://www.amazon.com/Model-Checking-Edmund-Clarke-Jr/dp/0262032708/ref=sr_1_1?s=books&ie=UTF8&qid=1297071898&sr=1-1 Model Checking], E. M. Clarke, O. Grumberg and D. A. Peled, The MIT Press, 1999. A very good reference on automata based model checking. </p><br />
<br />
== Additional Information ==<br />
* [http://spinroot.com/spin/whatispin.html Spin website]</div>Utopcuhttps://murray.cds.caltech.edu/index.php?title=EECI_2012:_Model_Checking_and_Logic_Synthesis&diff=13904EECI 2012: Model Checking and Logic Synthesis2012-04-22T00:39:48Z<p>Utopcu: </p>
<hr />
<div>{{AFRL12 header|prev=Temporal Logic |next=Computer Session: Spin}}<br />
<br />
{{righttoc}}<br />
<br />
This lecture provides an introduction to automata based model checking and its use for closed system synthesis. We first discuss what model checking is, how it works (in particular how automata based model checking works), and how it is used for verification of linear temporal logic specifications against finite transition system models. We then move to its use for synthesizing (open-loop) control strategies. We also provide examples using the SPIN model checker (discussed in [[Computer Session: SPIN|Computer Session: Spin]] lecture) and discuss the computational complexity of model checking. <br />
<br />
== Lecture Materials ==<br />
* Lecture slides: [http://www.cds.caltech.edu/~utopcu/AFRL2012/L4_Model_Checking_Logic_Synthesis.pdf Model Checking and Logic Synthesis] (Presentation and notation follow that in "Model Checking" chapter 5.2 by Baier and Katoen.)<br />
<br />
== Further Reading ==<br />
* <p>[http://www.amazon.com/SPIN-Model-Checker-Primer-Reference/dp/0321228626/ref=sr_1_1?ie=UTF8&qid=1297068669&sr=8-1 The SPIN Model Checker: Primer and Reference Manual], G. J. Holzmann, Addison-Wesley Professional, 2003. A comprehensive reference on Spin model checker </p><br />
* <p>[http://mitpress.mit.edu/catalog/item/default.asp?ttype=2&tid=11481 Principles of Model Checking], C. Baier and J.-P. Katoen, The MIT Press, 2008. A detailed reference on model checking. Slides for this lecture follow Chapter 6 of this reference. </p><br />
* <p>[http://www.amazon.com/Model-Checking-Edmund-Clarke-Jr/dp/0262032708/ref=sr_1_1?s=books&ie=UTF8&qid=1297071898&sr=1-1 Model Checking], E. M. Clarke, O. Grumberg and D. A. Peled, The MIT Press, 1999. A very good reference on automata based model checking. </p><br />
<br />
== Additional Information ==<br />
* [http://spinroot.com/spin/whatispin.html Spin website]</div>Utopcuhttps://murray.cds.caltech.edu/index.php?title=EECI_2012:_Model_Checking_and_Logic_Synthesis&diff=13903EECI 2012: Model Checking and Logic Synthesis2012-04-22T00:39:28Z<p>Utopcu: </p>
<hr />
<div>{{AFRL12 header|prev=Temporal Logic |next=Computer Session: Spin}}<br />
<br />
{{righttoc}}<br />
<br />
This lecture provides an introduction to automata based model checking and its use for closed system synthesis. We first discuss what model checking is, how it works (in particular how automata based model checking works), and how it is used for verification of linear temporal logic specifications against finite transition system models. We then move to its use for synthesizing (open-loop) control strategies. We also provide examples using the SPIN model checker (discussed in [[Computer Session: SPin|Computer Session: SPIN]] lecture) and discuss the computational complexity of model checking. <br />
<br />
== Lecture Materials ==<br />
* Lecture slides: [http://www.cds.caltech.edu/~utopcu/AFRL2012/L4_Model_Checking_Logic_Synthesis.pdf Model Checking and Logic Synthesis] (Presentation and notation follow that in "Model Checking" chapter 5.2 by Baier and Katoen.)<br />
<br />
== Further Reading ==<br />
* <p>[http://www.amazon.com/SPIN-Model-Checker-Primer-Reference/dp/0321228626/ref=sr_1_1?ie=UTF8&qid=1297068669&sr=8-1 The SPIN Model Checker: Primer and Reference Manual], G. J. Holzmann, Addison-Wesley Professional, 2003. A comprehensive reference on Spin model checker </p><br />
* <p>[http://mitpress.mit.edu/catalog/item/default.asp?ttype=2&tid=11481 Principles of Model Checking], C. Baier and J.-P. Katoen, The MIT Press, 2008. A detailed reference on model checking. Slides for this lecture follow Chapter 6 of this reference. </p><br />
* <p>[http://www.amazon.com/Model-Checking-Edmund-Clarke-Jr/dp/0262032708/ref=sr_1_1?s=books&ie=UTF8&qid=1297071898&sr=1-1 Model Checking], E. M. Clarke, O. Grumberg and D. A. Peled, The MIT Press, 1999. A very good reference on automata based model checking. </p><br />
<br />
== Additional Information ==<br />
* [http://spinroot.com/spin/whatispin.html Spin website]</div>Utopcuhttps://murray.cds.caltech.edu/index.php?title=EECI_2012:_Model_Checking_and_Logic_Synthesis&diff=13902EECI 2012: Model Checking and Logic Synthesis2012-04-22T00:38:20Z<p>Utopcu: </p>
<hr />
<div>{{AFRL12 header|prev=Temporal Logic |next=Computer Session: Spin}}<br />
<br />
{{righttoc}}<br />
<br />
This lecture provides an introduction to automata based model checking and its use for closed system synthesis. We first discuss what model checking is, how it works (in particular how automata based model checking works), and how it is used for verification of linear temporal logic specifications against finite transition system models. We then move to its use for synthesizing (open-loop) control strategies. We also provide examples using the SPIN model checker (discussed in XXX) and discuss the computational complexity of model checking. <br />
<br />
== Lecture Materials ==<br />
* Lecture slides: [http://www.cds.caltech.edu/~utopcu/AFRL2012/L4_Model_Checking_Logic_Synthesis.pdf Model Checking and Logic Synthesis] (Presentation and notation follow that in "Model Checking" chapter 5.2 by Baier and Katoen.)<br />
<br />
== Further Reading ==<br />
* <p>[http://www.amazon.com/SPIN-Model-Checker-Primer-Reference/dp/0321228626/ref=sr_1_1?ie=UTF8&qid=1297068669&sr=8-1 The SPIN Model Checker: Primer and Reference Manual], G. J. Holzmann, Addison-Wesley Professional, 2003. A comprehensive reference on Spin model checker </p><br />
* <p>[http://mitpress.mit.edu/catalog/item/default.asp?ttype=2&tid=11481 Principles of Model Checking], C. Baier and J.-P. Katoen, The MIT Press, 2008. A detailed reference on model checking. Slides for this lecture follow Chapter 6 of this reference. </p><br />
* <p>[http://www.amazon.com/Model-Checking-Edmund-Clarke-Jr/dp/0262032708/ref=sr_1_1?s=books&ie=UTF8&qid=1297071898&sr=1-1 Model Checking], E. M. Clarke, O. Grumberg and D. A. Peled, The MIT Press, 1999. A very good reference on automata based model checking. </p><br />
<br />
== Additional Information ==<br />
* [http://spinroot.com/spin/whatispin.html Spin website]</div>Utopcuhttps://murray.cds.caltech.edu/index.php?title=Template:AFRL12_header&diff=13901Template:AFRL12 header2012-04-22T00:36:51Z<p>Utopcu: Created page with 'Return to Caltech/AFRL 2012 Main Page'</p>
<hr />
<div>[[Caltech/AFRL,_Spring_2012|Return to Caltech/AFRL 2012 Main Page]]</div>Utopcuhttps://murray.cds.caltech.edu/index.php?title=EECI_2012:_Model_Checking_and_Logic_Synthesis&diff=13900EECI 2012: Model Checking and Logic Synthesis2012-04-22T00:34:03Z<p>Utopcu: </p>
<hr />
<div>{{righttoc}}<br />
<br />
This lecture provides an introduction to automata based model checking and its use for closed system synthesis. We first discuss what model checking is, how it works (in particular how automata based model checking works), and how it is used for verification of linear temporal logic specifications against finite transition system models. We then move to its use for synthesizing (open-loop) control strategies. We also provide examples using the SPIN model checker (discussed in XXX) and discuss the computational complexity of model checking. <br />
<br />
== Lecture Materials ==<br />
* Lecture slides: [http://www.cds.caltech.edu/~utopcu/AFRL2012/L4_Model_Checking_Logic_Synthesis.pdf Model Checking and Logic Synthesis] (Presentation and notation follow that in "Model Checking" chapter 5.2 by Baier and Katoen.)<br />
<br />
== Further Reading ==<br />
* <p>[http://www.amazon.com/SPIN-Model-Checker-Primer-Reference/dp/0321228626/ref=sr_1_1?ie=UTF8&qid=1297068669&sr=8-1 The SPIN Model Checker: Primer and Reference Manual], G. J. Holzmann, Addison-Wesley Professional, 2003. A comprehensive reference on Spin model checker </p><br />
* <p>[http://mitpress.mit.edu/catalog/item/default.asp?ttype=2&tid=11481 Principles of Model Checking], C. Baier and J.-P. Katoen, The MIT Press, 2008. A detailed reference on model checking. Slides for this lecture follow Chapter 6 of this reference. </p><br />
* <p>[http://www.amazon.com/Model-Checking-Edmund-Clarke-Jr/dp/0262032708/ref=sr_1_1?s=books&ie=UTF8&qid=1297071898&sr=1-1 Model Checking], E. M. Clarke, O. Grumberg and D. A. Peled, The MIT Press, 1999. A very good reference on automata based model checking. </p><br />
<br />
== Additional Information ==<br />
* [http://spinroot.com/spin/whatispin.html Spin website]</div>Utopcuhttps://murray.cds.caltech.edu/index.php?title=EECI_2012:_Model_Checking_and_Logic_Synthesis&diff=13899EECI 2012: Model Checking and Logic Synthesis2012-04-22T00:29:21Z<p>Utopcu: </p>
<hr />
<div>{{righttoc}}<br />
<br />
This lecture provides an introduction to automata based model checking. We first describe how automata based model checking works, including an efficient algorithm for computing language intersection. The rest of the lecture focuses on the use of Spin model checker and the computational complexity issue.<br />
<br />
== Lecture Materials ==<br />
* Lecture slides: [http://www.cds.caltech.edu/~utopcu/AFRL2012/L4_Model_Checking_Logic_Synthesis.pdf Model Checking and Logic Synthesis] (Presentation and notation follow that in "Model Checking" chapter 5.2 by Baier and Katoen.)<br />
<br />
== Further Reading ==<br />
* <p>[http://www.amazon.com/SPIN-Model-Checker-Primer-Reference/dp/0321228626/ref=sr_1_1?ie=UTF8&qid=1297068669&sr=8-1 The SPIN Model Checker: Primer and Reference Manual], G. J. Holzmann, Addison-Wesley Professional, 2003. A comprehensive reference on Spin model checker </p><br />
* <p>[http://mitpress.mit.edu/catalog/item/default.asp?ttype=2&tid=11481 Principles of Model Checking], C. Baier and J.-P. Katoen, The MIT Press, 2008. A detailed reference on model checking. Slides for this lecture follow Chapter 6 of this reference. </p><br />
* <p>[http://www.amazon.com/Model-Checking-Edmund-Clarke-Jr/dp/0262032708/ref=sr_1_1?s=books&ie=UTF8&qid=1297071898&sr=1-1 Model Checking], E. M. Clarke, O. Grumberg and D. A. Peled, The MIT Press, 1999. A very good reference on automata based model checking. </p><br />
<br />
== Additional Information ==<br />
* [http://spinroot.com/spin/whatispin.html Spin website]</div>Utopcu