Discrete and Continuous Strategies for Timed-Arc Petri Net Games

Publikation: Bidrag til tidsskriftTidsskriftartikelForskningpeer review

1 Citation (Scopus)

Resumé

Automatic strategy synthesis for a given control objective can be used to generate correct-by-construction controllers of real-time reactive systems. The existing symbolic approach for continuous timed game is a computationally hard task and current tools like UPPAAL TiGa often scale poorly with the model complexity. We suggest an explicit approach for strategy synthesis in the discrete-time setting and show that even for systems with closed guards, the existence of a safety discrete-time strategy does not imply the existence of a safety continuous-time strategy and vice versa. Nevertheless, we prove that the answers to the existence of discrete-time and continuous-time safety strategies coincide on a practically motivated subclass of urgent controllers that either react immediately after receiving an environmental input or wait with the decision until a next event is triggered by the environment. We then develop an on-the-fly synthesis algorithm for discrete timed-arc Petri net games. The algorithm is implemented in our tool TAPAAL, and based on the experimental evidence, we discuss the advantages of our approach compared to the symbolic continuous-time techniques.
OriginalsprogEngelsk
TidsskriftInternational Journal on Software Tools for Technology Transfer
Vol/bind20
Udgave nummer5
Sider (fra-til)529–546
Antal sider18
ISSN1433-2779
DOI
StatusUdgivet - 2018

Fingeraftryk

Petri nets
Controllers

Emneord

    Citer dette

    @article{9ca881172ca44a12a3b56f0337d806bc,
    title = "Discrete and Continuous Strategies for Timed-Arc Petri Net Games",
    abstract = "Automatic strategy synthesis for a given control objective can be used to generate correct-by-construction controllers of real-time reactive systems. The existing symbolic approach for continuous timed game is a computationally hard task and current tools like UPPAAL TiGa often scale poorly with the model complexity. We suggest an explicit approach for strategy synthesis in the discrete-time setting and show that even for systems with closed guards, the existence of a safety discrete-time strategy does not imply the existence of a safety continuous-time strategy and vice versa. Nevertheless, we prove that the answers to the existence of discrete-time and continuous-time safety strategies coincide on a practically motivated subclass of urgent controllers that either react immediately after receiving an environmental input or wait with the decision until a next event is triggered by the environment. We then develop an on-the-fly synthesis algorithm for discrete timed-arc Petri net games. The algorithm is implemented in our tool TAPAAL, and based on the experimental evidence, we discuss the advantages of our approach compared to the symbolic continuous-time techniques.",
    keywords = "Continuous time, Discrete time, Safety games, Synthesis, Timed-arc Petri net games",
    author = "Jensen, {Peter Gj{\o}l} and Larsen, {Kim Guldstrand} and Jiri Srba",
    year = "2018",
    doi = "10.1007/s10009-017-0473-2",
    language = "English",
    volume = "20",
    pages = "529–546",
    journal = "International Journal on Software Tools for Technology Transfer",
    issn = "1433-2779",
    publisher = "Springer Publishing Company",
    number = "5",

    }

    Discrete and Continuous Strategies for Timed-Arc Petri Net Games. / Jensen, Peter Gjøl; Larsen, Kim Guldstrand; Srba, Jiri.

    I: International Journal on Software Tools for Technology Transfer, Bind 20, Nr. 5, 2018, s. 529–546.

    Publikation: Bidrag til tidsskriftTidsskriftartikelForskningpeer review

    TY - JOUR

    T1 - Discrete and Continuous Strategies for Timed-Arc Petri Net Games

    AU - Jensen, Peter Gjøl

    AU - Larsen, Kim Guldstrand

    AU - Srba, Jiri

    PY - 2018

    Y1 - 2018

    N2 - Automatic strategy synthesis for a given control objective can be used to generate correct-by-construction controllers of real-time reactive systems. The existing symbolic approach for continuous timed game is a computationally hard task and current tools like UPPAAL TiGa often scale poorly with the model complexity. We suggest an explicit approach for strategy synthesis in the discrete-time setting and show that even for systems with closed guards, the existence of a safety discrete-time strategy does not imply the existence of a safety continuous-time strategy and vice versa. Nevertheless, we prove that the answers to the existence of discrete-time and continuous-time safety strategies coincide on a practically motivated subclass of urgent controllers that either react immediately after receiving an environmental input or wait with the decision until a next event is triggered by the environment. We then develop an on-the-fly synthesis algorithm for discrete timed-arc Petri net games. The algorithm is implemented in our tool TAPAAL, and based on the experimental evidence, we discuss the advantages of our approach compared to the symbolic continuous-time techniques.

    AB - Automatic strategy synthesis for a given control objective can be used to generate correct-by-construction controllers of real-time reactive systems. The existing symbolic approach for continuous timed game is a computationally hard task and current tools like UPPAAL TiGa often scale poorly with the model complexity. We suggest an explicit approach for strategy synthesis in the discrete-time setting and show that even for systems with closed guards, the existence of a safety discrete-time strategy does not imply the existence of a safety continuous-time strategy and vice versa. Nevertheless, we prove that the answers to the existence of discrete-time and continuous-time safety strategies coincide on a practically motivated subclass of urgent controllers that either react immediately after receiving an environmental input or wait with the decision until a next event is triggered by the environment. We then develop an on-the-fly synthesis algorithm for discrete timed-arc Petri net games. The algorithm is implemented in our tool TAPAAL, and based on the experimental evidence, we discuss the advantages of our approach compared to the symbolic continuous-time techniques.

    KW - Continuous time

    KW - Discrete time

    KW - Safety games

    KW - Synthesis

    KW - Timed-arc Petri net games

    UR - http://www.scopus.com/inward/record.url?scp=85029818811&partnerID=8YFLogxK

    UR - https://link.springer.com/article/10.1007%2Fs10009-017-0473-2

    U2 - 10.1007/s10009-017-0473-2

    DO - 10.1007/s10009-017-0473-2

    M3 - Journal article

    VL - 20

    SP - 529

    EP - 546

    JO - International Journal on Software Tools for Technology Transfer

    JF - International Journal on Software Tools for Technology Transfer

    SN - 1433-2779

    IS - 5

    ER -