SLIDE 1
Some Advice to Budding Researchers Jo el Ouaknine Max Planck - - PowerPoint PPT Presentation
Some Advice to Budding Researchers Jo el Ouaknine Max Planck - - PowerPoint PPT Presentation
Some Advice to Budding Researchers Jo el Ouaknine Max Planck Institute for Software Systems & Department of Computer Science, Oxford University Logic Mentoring Workshop 6 July 2020 How Should You Listen to Such a Talk? How Should You
SLIDE 2
SLIDE 3
How Should You Listen to Such a Talk?
Some things will be familiar or immediately resonate with you
SLIDE 4
How Should You Listen to Such a Talk?
Some things will be familiar or immediately resonate with you Good!
SLIDE 5
How Should You Listen to Such a Talk?
Some things will be familiar or immediately resonate with you Good! Some things will sound like complete rubbish!
SLIDE 6
How Should You Listen to Such a Talk?
Some things will be familiar or immediately resonate with you Good! Some things will sound like complete rubbish! Feel free to ignore!
SLIDE 7
How Should You Listen to Such a Talk?
Some things will be familiar or immediately resonate with you Good! Some things will sound like complete rubbish! Feel free to ignore! Some things will sound unfamiliar but intriguing
SLIDE 8
How Should You Listen to Such a Talk?
Some things will be familiar or immediately resonate with you Good! Some things will sound like complete rubbish! Feel free to ignore! Some things will sound unfamiliar but intriguing Perhaps make a note and revisit later . . .
SLIDE 9
How Should You Listen to Such a Talk?
SLIDE 10
Credit Also to Manuel Blum
SLIDE 11
Books Are Not Scrolls!
SLIDE 12
Ignorance Can be an Asset
SLIDE 13
The Feynman Method
SLIDE 14
The Feynman Method Meets Timed Automata
For A and B automata, “L(A) ⊆ L(B)?” is decidable (Kleene ??)
SLIDE 15
The Feynman Method Meets Timed Automata
For A and B automata, “L(A) ⊆ L(B)?” is decidable (Kleene ??) For A and B timed automata, “L(A) ⊆ L(B)?” is undecidable (Alur & Dill 1990)
SLIDE 16
The Feynman Method Meets Timed Automata
For A and B automata, “L(A) ⊆ L(B)?” is decidable (Kleene ??) For A and B timed automata, “L(A) ⊆ L(B)?” is undecidable (Alur & Dill 1990) What if we bound the time duration? (2002)
SLIDE 17
The Feynman Method Meets Timed Automata
For A and B automata, “L(A) ⊆ L(B)?” is decidable (Kleene ??) For A and B timed automata, “L(A) ⊆ L(B)?” is undecidable (Alur & Dill 1990) What if we bound the time duration? (2002) Let A and B be timed automata and T ∈ N some time bound.
SLIDE 18
The Feynman Method Meets Timed Automata
For A and B automata, “L(A) ⊆ L(B)?” is decidable (Kleene ??) For A and B timed automata, “L(A) ⊆ L(B)?” is undecidable (Alur & Dill 1990) What if we bound the time duration? (2002) Let A and B be timed automata and T ∈ N some time bound. Is “L(A)↾T ⊆ L(B)↾T?” decidable??
SLIDE 19
The Feynman Method Meets Timed Automata
For A and B automata, “L(A) ⊆ L(B)?” is decidable (Kleene ??) For A and B timed automata, “L(A) ⊆ L(B)?” is undecidable (Alur & Dill 1990) What if we bound the time duration? (2002) Let A and B be timed automata and T ∈ N some time bound. Is “L(A)↾T ⊆ L(B)↾T?” decidable?? This led us to the development of alternating timed automata, the decidability of Metric Temporal Logic and related formalisms, etc.
- etc. — but the original time-bounded problem remained elusive!
SLIDE 20
The Feynman Method Meets Timed Automata
For A and B automata, “L(A) ⊆ L(B)?” is decidable (Kleene ??) For A and B timed automata, “L(A) ⊆ L(B)?” is undecidable (Alur & Dill 1990) What if we bound the time duration? (2002) Let A and B be timed automata and T ∈ N some time bound. Is “L(A)↾T ⊆ L(B)↾T?” decidable?? This led us to the development of alternating timed automata, the decidability of Metric Temporal Logic and related formalisms, etc.
- etc. — but the original time-bounded problem remained elusive!
Until . . .
SLIDE 21
The Feynman Method Meets Timed Automata
I met Alex Rabinovich at FORMATS 2008 . . .
SLIDE 22
The Feynman Method Meets Timed Automata
I met Alex Rabinovich at FORMATS 2008 . . . and we published at CONCUR 2009!
SLIDE 23
Embrace Discomfort & Play to Your Strengths
SLIDE 24
Embrace Discomfort & Play to Your Strengths
“Somewhere around every seven years make a significant, if not complete, shift in your field.” Richard Hamming
SLIDE 25
Seek Collaborations with People Smarter than Yourself
SLIDE 26
Seek Collaborations with People Smarter than Yourself
SLIDE 27
Seek Collaborations with People Smarter than Yourself
SLIDE 28
Seek Collaborations with People Smarter than Yourself
SLIDE 29
Finally . . . Be Curious, and Above All Enjoy Yourself!
SLIDE 30
One Last Word: Problem Selection
SLIDE 31