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

Alexandre David, Kim Guldstrand Larsen, Thomas Chatain, Peter Bulychev

Publikation: Bidrag til tidsskriftKonferenceartikel i tidsskriftForskningpeer review

18 Citationer (Scopus)

Abstrakt

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.
OriginalsprogEngelsk
BogserieLecture Notes in Computer Science
Vol/bind5813
Sider (fra-til)73-87
ISSN0302-9743
DOI
StatusUdgivet - 2009
Begivenhed7th International Conference, FORMATS 2009 - Budapest, Ungarn
Varighed: 14 sep. 200916 sep. 2009
Konferencens nummer: 7

Konference

Konference7th International Conference, FORMATS 2009
Nummer7
LandUngarn
ByBudapest
Periode14/09/200916/09/2009

Bibliografisk note

Titel:
Formal Modeling and Analysis of Timed Systems

Oversat titel:


Oversat undertitel:


Forlag:
Springer

ISBN (Trykt):
978-3-642-04367-3

ISBN (Elektronisk):


Publikationsserier:
Lecture Notes in Computer Science, Springer Verlag, 0302-9743, 1611-3349, 5813

Fingeraftryk Dyk ned i forskningsemnerne om 'Efficient on-the-fly Algorithm for Checking Alternating Timed Simulation'. Sammen danner de et unikt fingeraftryk.

Citationsformater