Efficient on-the-fly Algorithm for Checking Alternating Timed Simulation

In this paper we focus on property-preserving preorders between timed game automata and their application to control of partially observable systems. We define timed weak alternating simulation as a preorder between timed game automata, which preserves controllability. We define the rules of building a symbolic turn-based two-player game such that the existence of a winning strategy is equivalent to the simulation being satisfied. We also propose an on-the-fly algorithm for solving this game. This simulation checking method can be applied to the case of non-alternating or strong simulations as well. We illustrate our algorithm by a case study and report on results.

[1]  Kim G. Larsen,et al.  Guided Controller Synthesis for Climate Controller Using Uppaal Tiga , 2007, FORMATS.

[2]  Charles Lesire,et al.  Planning robust temporal plans a comparison between CBTP and TGA approaches , 2007 .

[3]  Stavros Tripakis,et al.  Kronos: A Model-Checking Tool for Real-Time Systems , 1998, CAV.

[4]  Joseph Sifakis,et al.  On the Synthesis of Discrete Controllers for Timed Systems (An Extended Abstract) , 1995, STACS.

[5]  Rajeev Alur,et al.  A Theory of Timed Automata , 1994, Theor. Comput. Sci..

[6]  Kousha Etessami,et al.  Fair Simulation Relations, Parity Games, and State Space Reduction for Büchi Automata , 2001, ICALP.

[7]  Rob J. van Glabbeek,et al.  Branching time and abstraction in bisimulation semantics , 1996, JACM.

[8]  Kim Guldstrand Larsen,et al.  Timed Modal Specification —Theory and Tools , 1997 .

[9]  Wang Yi,et al.  Timed Automata: Semantics, Algorithms and Tools , 2003, Lectures on Concurrency and Petri Nets.

[10]  Kim G. Larsen,et al.  Efficient On-the-Fly Algorithms for the Analysis of Timed Games , 2005, CONCUR.

[11]  Kim G. Larsen,et al.  Scaling up Uppaal Automatic Verification of Real-Time Systems Using Compositionality and Abstraction , 2000, FTRTFT.

[12]  Thomas A. Henzinger,et al.  Alternating-time temporal logic , 1999 .

[13]  Wolfgang Reisig,et al.  Lectures on Concurrency and Petri Nets , 2003, Lecture Notes in Computer Science.

[14]  Wang Yi,et al.  Uppaal in a nutshell , 1997, International Journal on Software Tools for Technology Transfer.

[15]  Kim G. Larsen,et al.  Optimal scheduling using priced timed automata , 2005, PERV.

[16]  Thomas A. Henzinger,et al.  Alternating Refinement Relations , 1998, CONCUR.

[17]  Kim G. Larsen,et al.  Playing Games with Timed Games , 2009, ADHS.

[18]  Carsten Weise,et al.  Efficient Scaling-Invariant Checking of Timed Bisimulation , 1997, STACS.

[19]  Karlis Cerans,et al.  Decidability of Bisimulation Equivalences for Parallel Timer Processes , 1992, CAV.

[20]  Thomas A. Henzinger,et al.  The Element of Surprise in Timed Games , 2003, CONCUR.

[21]  Rajeev Alur,et al.  Model-Checking in Dense Real-time , 1993, Inf. Comput..

[22]  Kim G. Larsen,et al.  Timed Control with Observation Based and Stuttering Invariant Strategies , 2007, ATVA.