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 条
  • [1] Complexity and expressive power of logic programming
    Dantsin, E
    Eiter, T
    Gottlob, G
    Voronkov, A
    TWELFTH ANNUAL IEEE CONFERENCE ON COMPUTATIONAL COMPLEXITY, PROCEEDINGS, 1997, : 82 - 101
  • [2] Complexity and expressive power of logic programming
    Dantsin, E
    Eiter, T
    Gottlob, G
    Voronkov, A
    ACM COMPUTING SURVEYS, 2001, 33 (03) : 374 - 425
  • [3] Circumscribing DATALOG: Expressive power and complexity
    Cadoli, M
    Palopoli, L
    THEORETICAL COMPUTER SCIENCE, 1998, 193 (1-2) : 215 - 244
  • [4] Expressive power and complexity in algebraic logic
    Hirsch, R
    JOURNAL OF LOGIC AND COMPUTATION, 1997, 7 (03) : 309 - 351
  • [5] The Complexity and Expressive Power of Limit Datalog
    Kaminski, Mark
    Kostylev, Egor, V
    Grau, Bernardo Cuenca
    Motik, Boris
    Horrocks, Ian
    JOURNAL OF THE ACM, 2022, 69 (01)
  • [6] DatalogMTL: Computational Complexity and Expressive Power
    Walega, Przemyslaw A.
    Grau, Bernardo Cuenca
    Kaminski, Mark
    Kostylev, Egor, V
    PROCEEDINGS OF THE TWENTY-EIGHTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2019, : 1886 - 1892
  • [7] Complexity and expressive power of KR formalisms
    Gottlob, G
    PRINCIPLES OF KNOWLEDGE REPRESENTATION AND REASONING: PROCEEDINGS OF THE FIFTH INTERNATIONAL CONFERENCE (KR '96), 1996, : 647 - 649
  • [8] Complexity and expressive power of deterministic semantics for DATALOG
    Greco, S
    Saccà, D
    INFORMATION AND COMPUTATION, 1999, 153 (01) : 81 - 98
  • [9] ON THE EXPRESSIVE POWER OF SOME DYNAMIC LOGICS
    STOLBOUSHKIN, AP
    MATHEMATICS OF THE USSR-SBORNIK, 1984, 125 (3-4): : 411 - 419
  • [10] Complexity and Expressive Power of Ontology-Mediated Queries
    Lutz, Carsten
    33RD SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE (STACS 2016), 2016, 47
12345