Decidable Continuous Time Temporal Logic
Alex Rabinovich ( Tel Aviv University, School of Computer Science )
- 11:30 29th October 2008 ( week 3, Michaelmas Term 2008 )Room 441, Oxford University Computing Laboratory
In this talk we survey expressiveness and complexity results for continuous time temporal logic which can specify metric properties.
Share this:
