Ongoing Projects Umang Mathur Department of Computer Science and Engineering IIT Bombay, Mumbai, India March 25, 2014 Umang Mathur – 1 of 1
Non-Zeno Strategies for Timed Games – With Prof. Igor Walukiewicz and Prof. Fr´ ed´ eric Herbreteau (LabRI, University of Bordeaux - I) Umang Mathur – 2 of 1
Non-Zeno Strategies for Timed Games – With Prof. Igor Walukiewicz and Prof. Fr´ ed´ eric Herbreteau (LabRI, University of Bordeaux - I) – Goal: Design an algorithm to solve the problem of synthesizing safe non-Zeno strategies for Timed Games. Umang Mathur – 2 of 1
Non-Zeno Strategies for Timed Games – With Prof. Igor Walukiewicz and Prof. Fr´ ed´ eric Herbreteau (LabRI, University of Bordeaux - I) – Goal: Design an algorithm to solve the problem of synthesizing safe non-Zeno strategies for Timed Games. Definition (Safe non-Zeno strategy synthesis problem) Given a timed game and a safety objective, the Safe non-Zeno strategy synthesis problem is to decide if there exists a winning strategy for the given game and objective (safe non-Zeno), and to compute a maximal strategy, or the maximal (continuously) permissive strategy if it exists Umang Mathur – 2 of 1
Non-Zeno Strategies for Timed Games – With Prof. Igor Walukiewicz and Prof. Fr´ ed´ eric Herbreteau (LabRI, University of Bordeaux - I) – Goal: Design an algorithm to solve the problem of synthesizing safe non-Zeno strategies for Timed Games. Definition (Safe non-Zeno strategy synthesis problem) Given a timed game and a safety objective, the Safe non-Zeno strategy synthesis problem is to decide if there exists a winning strategy for the given game and objective (safe non-Zeno), and to compute a maximal strategy, or the maximal (continuously) permissive strategy if it exists – Formulated sound and complete conditions for the region-based abstraction will meet this criterion Umang Mathur – 2 of 1
Non-Zeno Strategies for Timed Games – With Prof. Igor Walukiewicz and Prof. Fr´ ed´ eric Herbreteau (LabRI, University of Bordeaux - I) – Goal: Design an algorithm to solve the problem of synthesizing safe non-Zeno strategies for Timed Games. Definition (Safe non-Zeno strategy synthesis problem) Given a timed game and a safety objective, the Safe non-Zeno strategy synthesis problem is to decide if there exists a winning strategy for the given game and objective (safe non-Zeno), and to compute a maximal strategy, or the maximal (continuously) permissive strategy if it exists – Formulated sound and complete conditions for the region-based abstraction will meet this criterion – Proposed a technique to concretize the abstract strategy to a non-Zeno strategy on the actual timed game Umang Mathur – 2 of 1
Non-Zeno Strategies for Timed Games – With Prof. Igor Walukiewicz and Prof. Fr´ ed´ eric Herbreteau (LabRI, University of Bordeaux - I) – Goal: Design an algorithm to solve the problem of synthesizing safe non-Zeno strategies for Timed Games. Definition (Safe non-Zeno strategy synthesis problem) Given a timed game and a safety objective, the Safe non-Zeno strategy synthesis problem is to decide if there exists a winning strategy for the given game and objective (safe non-Zeno), and to compute a maximal strategy, or the maximal (continuously) permissive strategy if it exists – Formulated sound and complete conditions for the region-based abstraction will meet this criterion – Proposed a technique to concretize the abstract strategy to a non-Zeno strategy on the actual timed game We plan to: Umang Mathur – 2 of 1
Non-Zeno Strategies for Timed Games – With Prof. Igor Walukiewicz and Prof. Fr´ ed´ eric Herbreteau (LabRI, University of Bordeaux - I) – Goal: Design an algorithm to solve the problem of synthesizing safe non-Zeno strategies for Timed Games. Definition (Safe non-Zeno strategy synthesis problem) Given a timed game and a safety objective, the Safe non-Zeno strategy synthesis problem is to decide if there exists a winning strategy for the given game and objective (safe non-Zeno), and to compute a maximal strategy, or the maximal (continuously) permissive strategy if it exists – Formulated sound and complete conditions for the region-based abstraction will meet this criterion – Proposed a technique to concretize the abstract strategy to a non-Zeno strategy on the actual timed game We plan to: – Extend our techniques to Zone-based abstractions : Splitting of Zones Umang Mathur – 2 of 1
Non-Zeno Strategies for Timed Games – With Prof. Igor Walukiewicz and Prof. Fr´ ed´ eric Herbreteau (LabRI, University of Bordeaux - I) – Goal: Design an algorithm to solve the problem of synthesizing safe non-Zeno strategies for Timed Games. Definition (Safe non-Zeno strategy synthesis problem) Given a timed game and a safety objective, the Safe non-Zeno strategy synthesis problem is to decide if there exists a winning strategy for the given game and objective (safe non-Zeno), and to compute a maximal strategy, or the maximal (continuously) permissive strategy if it exists – Formulated sound and complete conditions for the region-based abstraction will meet this criterion – Proposed a technique to concretize the abstract strategy to a non-Zeno strategy on the actual timed game We plan to: – Extend our techniques to Zone-based abstractions : Splitting of Zones – Build a minimal tool to implement the results Umang Mathur – 2 of 1
Recommend
More recommend
