Operations on Timed Scenarios

被引：1
|
作者：
Saeedloei, Neda [1 ]
Kluniak, Feliks [2 ]
机构：
[1] Towson Univ, Towson, MD 21252 USA
[2] RelationalAl, Berkeley, CA USA
来源：
FORMAL TECHNIQUES FOR DISTRIBUTED OBJECTS, COMPONENTS, AND SYSTEMS, FORTE 2023 | 2023年 / 13910卷
关键词：
AUTOMATA; MODELS;
D O I：
10.1007/978-3-031-35355-0_7
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
We introduce three operations for timed scenarios: subsumption, intersection and union. They have constructive definitions based on the syntactic properties of the constituent scenarios. We show that they have the desired semantic properties. These results expand the theory of timed scenarios, but their development was inspired by practical considerations: they are directly relevant to the problem of synthesizing a timed automaton with a minimal number of clocks from a set of scenarios.
引用
收藏
页码：97 / 114
页数：18
相关论文
共 50 条
  • [1] TIMED launch operations
    Vernon, SR
    Kozuch, SF
    [J]. JOHNS HOPKINS APL TECHNICAL DIGEST, 2003, 24 (02): : 170 - 178
  • [2] Visual timed event scenarios
    Alfonso, A
    Braberman, V
    Kicillof, N
    Olivero, A
    [J]. ICSE 2004: 26TH INTERNATIONAL CONFERENCE ON SOFTWARE ENGINEERING, PROCEEDINGS, 2004, : 168 - 177
  • [3] From Scenarios to Timed Automata
    Saeedloei, Neda
    Kluzniak, Feliks
    [J]. FORMAL METHODS: FOUNDATIONS AND APPLICATIONS, SBMF 2017, 2017, 10623 : 33 - 51
  • [4] TIMED lights out operations
    LaVallee, D
    Knopf, W
    [J]. 2003 IEEE AEROSPACE CONFERENCE PROCEEDINGS, VOLS 1-8, 2003, : 3443 - 3450
  • [5] Minimization of the Number of Clocks for Timed Scenarios
    Saeedloei, Neda
    Kluzniak, Feliks
    [J]. FORMAL METHODS: FOUNDATIONS AND APPLICATIONS, SBMF 2021, 2021, 13130 : 122 - 139
  • [6] Synthesizing Timed Automata with Minimal Numbers of Clocks from Optimised Timed Scenarios
    Saeedloei, Neda
    Kluzniak, Feliks
    [J]. FORMAL TECHNIQUES FOR DISTRIBUTED OBJECTS, COMPONENTS, AND SYSTEMS, FORTE 2024, 2024, 14678 : 136 - 154
  • [7] TIMED ground system and mission operations
    Rodberg, EH
    Knopf, WP
    Lafferty, PM
    Nylund, SR
    [J]. JOHNS HOPKINS APL TECHNICAL DIGEST, 2003, 24 (02): : 209 - 220
  • [8] Checking coverage for infinite collections of timed scenarios
    Akshay, S.
    Mukund, Madhavan
    Kumar, K. Narayan
    [J]. CONCUR 2007 - CONCURRENCY THEORY, PROCEEDINGS, 2007, 4703 : 181 - +
  • [9] Implicit integration of scenarios into a reduced timed automaton
    Salah, A
    Dssouli, R
    Lapalme, G
    [J]. INFORMATION AND SOFTWARE TECHNOLOGY, 2003, 45 (11) : 715 - 725
  • [10] Compiling real-time scenarios into a timed automaton
    Salah, A
    Dssouli, R
    Lapalme, G
    [J]. FORMAL TECHNIQUES FOR NETWORKED AND DISTRIBUTED SYSTEMS, 2001, 69 : 135 - 150
12345