PROJECT TITLE :
Integer Parameter Synthesis for Real-Time Systems
We tend to offer a subclass of parametric timed automata (PTA) that we can really and efficiently analyze, and we tend to argue that it retains most of the practical usefulness of PTA for the modeling of real-time systems. The currently most helpful known subclass of PTA, L/U automata, encompasses a strong syntactical restriction for practical purposes, and we tend to show that the associated theoretical results are mixed. We have a tendency to therefore advocate for a different restriction theme: since in classical timed automata, real-valued clocks are forever compared to integers for all sensible functions, we additionally hunt for parameter values as bounded integers. We have a tendency to show that the problem of the existence of parameter values such that some TCTL property is satisfied is PSPACE-complete. In such a setting, we have a tendency to will after all synthesize all the values of parameters and we have a tendency to provide symbolic algorithms, for reachability and unavoidability properties, to try and do it efficiently, i.e., while not an explicit enumeration. This conjointly has the sensible advantage of giving the result as symbolic constraints between the parameters. We tend to finally report on a few experimental results to illustrate the practical usefulness of our approach.
Did you like this research project?
To get this research project Guidelines, Training and Code... Click Here