EECS 219D
Contents

Home
Earlier offerings

EECS 219D, Spring 2014: Concurrent Models of Computation

The course web page is now on bCourses: https://bcourses.berkeley.edu/courses/1195544

This course covers the theory and practice of concurrent models of computation (MoCs) with applications to cyber-physical systems modeling and design, embedded systems, and concurrent and distributed software systems. Topics include timed models of computation; modeling mixed discrete and continuous systems (hybrid systems); concurrent composition of state machines; analysis for boundedness, deadlock, and determinacy; formal semantics (fixed point semantics and metric-space models); and language design (type systems, higher-order components, aspect-oriented modeling, structured design). The MoCs covered will vary and may include discrete-events (e.g. DEVS), synchronous/reactive (e.g. Esterel), process networks, continuous-time (e.g. Simulink), acausal models (e.g. Modelica), threads, message passing, publish and subscribe, concurrent state machines, dataflow, rendezvous (e.g. CSP, CCS), and time-triggered models. Heterogeneous compositions of MoCs, such as hybrid systems and Statecharts, are also be included, with a particular focus on the use of heterogeneous compositions for modeling and design of cyber-physical systems. Experimental work will provide exposure a variety of MoCs, languages, and tools. A project is required.

The instructor is Professor Edward A. Lee, eal@eecs.berkeley.edu.

Schedule

  • Tuesdays and Thursdays 2:00-3:30PM, 293 Cory
  • Office hours: Wednesdays 11:30-12:30, Thursdays 3:30-4:30 545Q (call 3-3728 for access)

Required reading includes:

We will use Ptolemy II as an experimental framework. See also Previous offerings of this course

How to update this page

You are not logged in 
Contact 
©2002-2014 U.C. Regents