Some results on the expressive power and complexity of LSCs

被引：0
|
作者：
Harel, David [1 ]
Maoz, Shahar [1 ]
Segall, Itai [1 ]
机构：
[1] Weizmann Inst Sci, IL-76100 Rehovot, Israel
来源：
PILLARS OF COMPUTER SCIENCE | 2008年 / 4800卷
关键词：
D O I：
暂无
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
We survey some of the main results regarding the complexity and expressive power of Live Sequence Charts (LSCs). We first describe the two main semantics given to LSCs: a trace-based semantics and an operational semantics. The expressive power of the language is then examined by describing translations into various temporal logics. Some limitations of the language are also discussed. Finally, we survey complexity results, mainly due to Bontemps and Schobbens, regarding the use of LSCs for model checking, execution, and synthesis.
引用
收藏
页码：351 / 366
页数：16
相关论文
共 50 条
  • [41] SOME RESULTS ON UNIFORM ARITHMETIC CIRCUIT COMPLEXITY
    FRANDSEN, GS
    VALENCE, M
    BARRINGTON, DAM
    MATHEMATICAL SYSTEMS THEORY, 1994, 27 (02): : 105 - 124
  • [42] Some complexity results in the theory of normal numbers
    Airey, Dylan
    Jackson, Steve
    Mance, Bill
    CANADIAN JOURNAL OF MATHEMATICS-JOURNAL CANADIEN DE MATHEMATIQUES, 2022, 74 (01): : 170 - 198
  • [43] STRENGTHENING SOME COMPLEXITY RESULTS ON TOUGHNESS OF GRAPHS
    Katona, Gyula Y.
    Varga, Kitti
    DISCUSSIONES MATHEMATICAE GRAPH THEORY, 2023, 43 (02) : 401 - 419
  • [44] SOME DECIDABILITY RESULTS ON GRAMMATICAL INFERENCE AND COMPLEXITY
    FELDMAN, J
    INFORMATION AND CONTROL, 1972, 20 (03): : 244 - &
  • [45] Some complexity results for System Verilog Assertions
    Bustan, Doron
    Havlicek, John
    COMPUTER AIDED VERIFICATION, PROCEEDINGS, 2006, 4144 : 205 - 218
  • [46] SOME MORE INDEPENDENCE RESULTS IN COMPLEXITY THEORY
    GRANT, PW
    THEORETICAL COMPUTER SCIENCE, 1980, 12 (02) : 119 - 126
  • [47] Complexity Results for Some Global Optimization Problems
    M. Locatelli
    Journal of Optimization Theory and Applications, 2009, 140 : 93 - 102
  • [48] Some complexity results for stateful network verification
    Kalev Alpernas
    Aurojit Panda
    Alexander Rabinovich
    Mooly Sagiv
    Scott Shenker
    Sharon Shoham
    Yaron Velner
    Formal Methods in System Design, 2019, 54 : 191 - 231
  • [49] Some results on the complexity of planning with incomplete information
    Haslum, P
    Jonsson, P
    RECENT ADVANCES IN AI PLANNING, 2000, 1809 : 308 - 318
  • [50] Complexity of Reasoning With Expressive Ontology Mappings
    Ghidini, Chiara
    Serafini, Luciano
    Tessaris, Sergio
    FORMAL ONTOLOGY IN INFORMATION SYSTEMS, 2008, 183 : 151 - +
12345