Reactive Synthesis

Dear students,

here is some additional information regarding our virtual oral exams:

1. each of you is assigned a 30-minute time slot between 10:00 and 16:00 on Friday. This includes 15-20 min for the exam itself, as well as time for setup and feedback. You will receive an email with an invitation to your individual time slot.

2. regarding contents, the scope of the exam is the same as announced for the written exam. Due to the restricted time, the focus will not be on lengthy computations, but rather on basic understanding of the definitions, algorithms and proofs presented in the lecture.

3. for the exam, please be prepared to first show us the room you are in, and then set up the webcam such that we can at all times during the exam see you and the material you are working with: only blank sheets and pens/pencils are allowed.

See you on Friday!

Dear students,

I noticed that some of you that are working on projects are not registered for the exam in the LSF and/or have not written to me regarding their preferences.

If you want to take the exam:

- to still register in LSF, write an email to Evelyn Kraska (kraska@cs.uni-saarland.de). She has agreed to manually register you for the exam in our exceptional situation.

- write me an email regarding whether an oral exam on Friday is OK for you or if you'd prefer to have a written exam at some later date.

Dear students,

here are some news regarding exam and project.

Regarding the exam: since we will not be able to take a written exam on the scheduled date of April 3, you will have two options:

1. take an *oral* exam on April 3 via videoconference, or

2. take a written exam *at some later time* that is not determined yet. We will try to figure out something asap.

Please let me know until Sunday which one you prefer.

 

Regarding the project, here are some clarifications:

1. Some of the benchmark examples do not use all identifiers or all colors in the given range (i.e., the highest id is n but some id smaller than n is not used, or similarly for colors). Please make sure that your implementation supports such examples.

2. Some benchmark examples also give a start vertex. You do not have to support these.

Dear students,

some of you still have not booked your time slot for the project meeting. In order to finish the project, you have to book a slot for a meeting tomorrow until today 23:59.

Also, once you have booked the meeting, please let us know how we can get access to your code, such that we can have a look at it before the meeting.

Dear students,

here is the Doodle poll for the project meeting time slots:

https://doodle.com/poll/5vd7rn9cvxg8hc9y

Please enter either the names of both team members, or "Team n", where n is your team id.

You can only choose one option (per team), and it is first come, first served. When choosing, please keep in mind: if you choose a late time (say on Tue), you will not have much time to work with our feedback before the checkpoint submission.

If for some reason none of the times work for you, please let us know.

 

Regarding submission of your program and documentation, we recommend that you set up your own (private) GitHub or BitBucket repository and give us access. We need access to your code before our meetings, such that we can have a look at your code beforehand.

As an alternative, you will also be be able to upload your code into the CMS.

Dear students,

the project files are now all online:
- the PGSolver files and benchmark library
- a Python BDD package
- a code example for attractor computation
- basic parser files in Python and Java
- a file that defines the output format for strategies, should you decide to implement strategy extraction

The parser files include a basic ANTLR grammar that can parse multiple lines of the PGSolver format. You have to extend it yourself to make it read a full PGSolver input file and match your intended functionality in your program. We recommend you extend the basic parser based on ANTLR that we provide, but if you prefer to implement a parser in a different way then that's also fine.

We have also included a version in Java that includes some additional example code that takes the resulting parse tree and prints it in a LISP-style human-readable format. Please have a look at the readme files and let us know if something does not work for you.

Moreover, as already announced yesterday, we have to make some on-the-fly adjustments to the organization of the rest of the course. Since there was a delay in getting all the project material online from our side, we will extend both the checkpoint and the final submission of the project by a couple of days:

- the checkpoint date is Tuesday, March 24
- final submission is Tuesday, March 31

Finally, all meetings will only be virtual (using Skype or a similar video conferencing software), we will write a separate news item with a link that lets you sign up for time slots.

Dear Students,

as you have certainly noticed, a lot has changed since we last met on Thursday. What was a possibility is now a certainty: University is shutting down for the next few weeks, and we will not be able to have the exam on the planned date.

We also had some delay regarding the project - most of the promised material is available for download, but the parser is still missing.

We will update you tomorrow regarding the project, and as soon as possible regarding the exam!

Dear students,

as mentioned in the lecture today, there will be no lecture tomorrow. We will meet again on Monday at the usual time.

Moreover, I have fixed the last slide from yesterday's lecture by adding the inputs of the respective functions. The meaning should be much clearer now, please let me know if you have any questions.

See you on Monday!