Invited Talk at 5th CSPSAT2 meeting in Kobe University: Challenges of model-checking of hybrid systems

Posted on August 26, 2014 by Morgan Magnin

I have been invited to give a talk at the 5th CSPSAT2 meeting in Kobe University on the challenges of model-checking and its connection with Constraint Satisfaction Problem and Boolean satisfiability. This was really enriching to give such a presentation to an audience expert with CSP and SAT approaches. This raised many interesting questions, especially with regard to the applicability of these methods to large-scale industrial cases studies.

This talk was part of my activity as JSPS invited researcher at Inoue Lab, National Institute of Informatics (Tokyo).