Ongoing Projects Umang Mathur Department of Computer Science and - - PowerPoint PPT Presentation

ongoing projects
SMART_READER_LITE
LIVE PREVIEW

Ongoing Projects Umang Mathur Department of Computer Science and - - PowerPoint PPT Presentation

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


slide-1
SLIDE 1

Umang Mathur – 1 of 1

Ongoing Projects

Umang Mathur

Department of Computer Science and Engineering IIT Bombay, Mumbai, India

March 25, 2014

slide-2
SLIDE 2

Umang Mathur – 2 of 1

Non-Zeno Strategies for Timed Games

– With Prof. Igor Walukiewicz and Prof. Fr´ ed´ eric Herbreteau (LabRI, University

  • f Bordeaux - I)
slide-3
SLIDE 3

Umang Mathur – 2 of 1

Non-Zeno Strategies for Timed Games

– With Prof. Igor Walukiewicz and Prof. Fr´ ed´ eric Herbreteau (LabRI, University

  • f Bordeaux - I)

– Goal: Design an algorithm to solve the problem of synthesizing safe non-Zeno strategies for Timed Games.

slide-4
SLIDE 4

Umang Mathur – 2 of 1

Non-Zeno Strategies for Timed Games

– With Prof. Igor Walukiewicz and Prof. Fr´ ed´ eric Herbreteau (LabRI, University

  • f 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

  • bjective (safe non-Zeno), and to compute a maximal strategy, or the maximal

(continuously) permissive strategy if it exists

slide-5
SLIDE 5

Umang Mathur – 2 of 1

Non-Zeno Strategies for Timed Games

– With Prof. Igor Walukiewicz and Prof. Fr´ ed´ eric Herbreteau (LabRI, University

  • f 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

  • bjective (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

slide-6
SLIDE 6

Umang Mathur – 2 of 1

Non-Zeno Strategies for Timed Games

– With Prof. Igor Walukiewicz and Prof. Fr´ ed´ eric Herbreteau (LabRI, University

  • f 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

  • bjective (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

  • n the actual timed game
slide-7
SLIDE 7

Umang Mathur – 2 of 1

Non-Zeno Strategies for Timed Games

– With Prof. Igor Walukiewicz and Prof. Fr´ ed´ eric Herbreteau (LabRI, University

  • f 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

  • bjective (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

  • n the actual timed game

We plan to:

slide-8
SLIDE 8

Umang Mathur – 2 of 1

Non-Zeno Strategies for Timed Games

– With Prof. Igor Walukiewicz and Prof. Fr´ ed´ eric Herbreteau (LabRI, University

  • f 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

  • bjective (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

  • n the actual timed game

We plan to: – Extend our techniques to Zone-based abstractions : Splitting of Zones

slide-9
SLIDE 9

Umang Mathur – 2 of 1

Non-Zeno Strategies for Timed Games

– With Prof. Igor Walukiewicz and Prof. Fr´ ed´ eric Herbreteau (LabRI, University

  • f 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

  • bjective (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

  • n 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