<--- Back to Details
First PageDocument Content
Complexity classes / Mathematics / Theoretical computer science / Discrete mathematics / EXPTIME / P / Reachability problem / Matrix / Controllability / Decidability / Reachability / Word problem
Date: 2018-05-21 09:45:07
Complexity classes
Mathematics
Theoretical computer science
Discrete mathematics
EXPTIME
P
Reachability problem
Matrix
Controllability
Decidability
Reachability
Word problem

Reachability games and related matrix and word problems Thesis submitted in accordance with the requirements of the University of Liverpool for the degree of Doctor in Philosophy by

Add to Reading List

Source URL: cgi.csc.liv.ac.uk

Download Document from Source Website

File Size: 4,10 MB

Share Document on Facebook

Similar Documents

Reachability in Recursive Markov Decision Processes? Tom´ aˇs Br´ azdil, V´ aclav Broˇzek, Vojtˇech Forejt, and Anton´ın Kuˇcera

Reachability in Recursive Markov Decision Processes? Tom´ aˇs Br´ azdil, V´ aclav Broˇzek, Vojtˇech Forejt, and Anton´ın Kuˇcera

DocID: 1xW2m - View Document

Reachability Analysis of Deep Neural Networks with Provable Guarantees Wenjie Ruan1 , Xiaowei Huang2 , Marta Kwiatkowska1 Department of Computer Science, University of Oxford, UK 2 Department of Computer Science, Univers

Reachability Analysis of Deep Neural Networks with Provable Guarantees Wenjie Ruan1 , Xiaowei Huang2 , Marta Kwiatkowska1 Department of Computer Science, University of Oxford, UK 2 Department of Computer Science, Univers

DocID: 1xW0E - View Document

Towards Personalized Cancer Therapy Using Delta-Reachability Analysis∗ Bing Liu Soonho Kong

Towards Personalized Cancer Therapy Using Delta-Reachability Analysis∗ Bing Liu Soonho Kong

DocID: 1xVOI - View Document

Symbolic Optimal Expected Time Reachability Computation and Controller Synthesis for Probabilistic Timed Automata Aleksandra Jovanovi´ca , Marta Kwiatkowskaa , Gethin Normanb , Quentin Peyrasc a Department

Symbolic Optimal Expected Time Reachability Computation and Controller Synthesis for Probabilistic Timed Automata Aleksandra Jovanovi´ca , Marta Kwiatkowskaa , Gethin Normanb , Quentin Peyrasc a Department

DocID: 1xVlv - View Document

LIPIcs  Leibniz International Proceedings in Informatics Continuous-Time Stochastic Games with Time-Bounded Reachability

LIPIcs Leibniz International Proceedings in Informatics Continuous-Time Stochastic Games with Time-Bounded Reachability

DocID: 1xVbZ - View Document