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 条
  • [31] Some complexity results for polynomial ideals
    Mayr, EW
    JOURNAL OF COMPLEXITY, 1997, 13 (03) : 303 - 325
  • [32] CIRCUIT COMPLEXITY AND THE EXPRESSIVE POWER OF GENERALIZED 1ST-ORDER FORMULAS
    STRAUBING, H
    LECTURE NOTES IN COMPUTER SCIENCE, 1992, 623 : 16 - 27
  • [33] COMPARING THE EXPRESSIVE POWER OF SOME LANGUAGES FOR BOOLEAN-ALGEBRAS
    HEINDORF, L
    ZEITSCHRIFT FUR MATHEMATISCHE LOGIK UND GRUNDLAGEN DER MATHEMATIK, 1981, 27 (05): : 419 - 434
  • [34] Complexity Results for Some Global Optimization Problems
    Locatelli, M.
    JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS, 2009, 140 (01) : 93 - 102
  • [35] Some complexity results for stateful network verification
    Alpernas, Kalev
    Panda, Aurojit
    Rabinovich, Alexander
    Sagiv, Mooly
    Shenker, Scott
    Shoham, Sharon
    Velner, Yaron
    FORMAL METHODS IN SYSTEM DESIGN, 2019, 54 (02) : 191 - 231
  • [36] Some Complexity Results for Stateful Network Verification
    Velner, Yaron
    Alpernas, Kalev
    Panda, Aurojit
    Rabinovich, Alexander
    Sagiv, Mooly
    Shenker, Scott
    Shoham, Sharon
    TOOLS AND ALGORITHMS FOR THE CONSTRUCTION AND ANALYSIS OF SYSTEMS (TACAS 2016), 2016, 9636 : 811 - 830
  • [37] SOME COMPLEXITY RESULTS ABOUT THRESHOLD GRAPHS
    MARGOT, F
    DISCRETE APPLIED MATHEMATICS, 1994, 49 (1-3) : 299 - 308
  • [38] Some complexity results on fuzzy description logics
    Bonatti, PA
    Tettamanzi, AGB
    FUZZY LOGIC AND APPLICATIONS, 2006, 2955 : 19 - 24
  • [39] Some Complexity Results Involving Quantum Computing
    Ivanyos, Gabor
    Pereszlenyi, Attila
    Ronyai, Lajos
    ERCIM NEWS, 2022, (128): : 18 - 19
  • [40] Some complexity results for polynomial rational expressions
    Héam, PC
    THEORETICAL COMPUTER SCIENCE, 2003, 299 (1-3) : 735 - 741
12345